Applying Game Semantics to Compositional Software Modeling and Verification

Abramsky, Samson; Ghica, Dan R.; Murawski, Andrzej S.; Ong, C.-H. Luke

doi:10.1007/978-3-540-24730-2_32

Cited by 58 publications

(62 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since then the range of applications has broadened further. There has been much work and some spectacular success in model checking and verification [2,29,31,32]. The special topic of type isomorphism is treated in [21], while [1] gives a model of a -calculus with names.…”

Section: Introductionmentioning

confidence: 99%

Categorical Combinatorics for Innocent Strategies

Harmer

Hyland

Melliès

2007

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Categorical Combinatorics for Innocent Strategies

Harmer

Hyland

Melliès

2007

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

View full text Add to dashboard Cite

show abstract

“…In previous work, it has been argued that games constitute a natural model for open systems [1,6,7,4,2]. We use games to represent the interaction between the behavior originating within a component, and the behavior originating from the component's environment.…”

Section: Overviewmentioning

confidence: 99%

Ticc: A Tool for Interface Compatibility and Composition

Adler

Alfaro

Silva

et al. 2006

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. We present the tool Ticc (Tool for Interface Compatibility and Composition). In Ticc, a component interface describes both the behavior of a component, and the component's assumptions on the environment's behavior. Ticc can check the compatibility of such interfaces, and analyze their emergent behavior, via a symbolic implementation of game-theoretic algorithms. OverviewOpen systems are systems whose behavior is jointly determined by their internal structure, and by the inputs that they receive from their environment. In previous work, it has been argued that games constitute a natural model for open systems [1,6,7,4,2]. We use games to represent the interaction between the behavior originating within a component, and the behavior originating from the component's environment. In particular, we model components as Input-Output games: the moves of Input represent the behavior the component can accept from the environment, while the moves of Output represent the behavior the component can generate.Unlike component models based on transition systems, models based on games provide a notion of compatibility [6,7,4]. When two components P and Q are composed, we can check whether the output behavior of P satisfies the input requirements of Q, and vice-versa. However, we do not define P and Q to be compatible only if their input requirements are always satisfied. Rather, we recognize that the output behavior of P and Q can still be influenced by their residual interaction with the environment (unless the composition of P and Q is closed). Thus, we define P and Q to be compatible if there is some environment under which their input assumptions are mutually satisfied, and we associate with their composition P Q the weakest (most general) assumptions about the environment that guarantee mutual compatibility. In game-theoretic terms, P

show abstract

“…The model checking technique described in [16] is for a second-order sequential procedural language. In this paper we substantially expand the expressivity of the programming language we model, by adding higher-order procedures, sharedvariable concurrency and semaphores.…”

Section: Contributionmentioning

confidence: 99%

“…The first application to model checking was proposed by Ghica and McCusker [14], and further developed by Ghica [15]. A model-checker based on these ideas was implemented in [16] with very positive results: it illustrates the ability to model open second-order programs by verifying invariants of abstract data type implementations (ADT) and it shows how the compositionality of the model construction allows the modeling of data-intensive programs such as sorting programs.…”

Section: Introductionmentioning

confidence: 99%

Compositional Model Extraction for Higher-Order Concurrent Programs

Ghica

Murawski

2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. The extraction of accurate finite-state models of higher-order or open programs is a difficult problem. We show how it can be addressed using newly developed game-semantic techniques and illustrate the solution with a model-checking tool based on such techniques. The approach has several important advantages over more traditional ones: precise account of inter-procedural behaviour, concise procedure summaries and economical extracted models.

show abstract

Applying Game Semantics to Compositional Software Modeling and Verification

Cited by 58 publications

References 35 publications

Categorical Combinatorics for Innocent Strategies

Categorical Combinatorics for Innocent Strategies

Ticc: A Tool for Interface Compatibility and Composition

Compositional Model Extraction for Higher-Order Concurrent Programs

Contact Info

Product

Resources

About