Static analysis based on formal models and incremental computation in Go programming

DOI10.1016/J.TCS.2005.09.046MaRDI QIDQ817794zbMATH OpenOpenAlexFDO

Authors Katsuhiko Nakamura

Publication date 20 March 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.09.046

zbMATH Keywords

incremental computationEuler's formulaset operationcapturing racelife and deathSemeai graph

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Games involving graphs (91A43) Semantics in the theory of computing (68Q55)

Recommendations

• Static analysis by abstract interpretation: a mathematical programming approach
• scientific article; zbMATH DE number 2243645
• scientific article; zbMATH DE number 2087567
• scientific article; zbMATH DE number 3890704
• Static trace-based deadlock analysis for synchronous Mini-Go

Cites work

• scientific article; zbMATH DE number 988833 (Why is no real title available?)
• scientific article; zbMATH DE number 598464 (Why is no real title available?)
• Learning to score final positions in the game of Go
• Local Properties of Binary Images in Two Dimensions

This page was built for publication: Static analysis based on formal models and incremental computation in Go programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817794)