Applying Game Semantics to Compositional Software Modeling and Verification
Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, and C.-H. Luke Ong
TACAS 2004, LNCS 2988, pp. 421–435, 2004.
Abstract.
We describe a software model checking tool founded on game semantics, highlight the underpinning theoretical results and discuss several case studies. The tool is based on an interpretation algorithm defined compositionally on syntax and thus can also handle open programs. Moreover, the models it produces are equationally fully abstract. These features are essential in the modeling and verification of software components such as modules and turn out to lead to very compact models of programs.
This chapter presents an overview of computability logic—the game-semantically constructed logic of interactive computational tasks and resources. There is only one non-overview, technical section in it, devoted to a proof of the soundness of affine logic with respect to the semantics of computability logic.
Oct 2010 | vol . 53 | no. 10 | communications of the acm
remark: A novel approach to computational logic is reaching maturity, opening up new vistas in programming languages, proof nets, and security applications.
Jean-Yves Girard: Linear Logic
1 Proof Nets
big-step inference rules vs. small-step inference rules
remark: Active research areas for linear logic include concurrency theory, quantum computing,
game semantics, and implicit computational complexity.