Compositional Predicate Abstraction from Game Semantics

DOI10.1007/978-3-642-00768-2_8zbMath1234.68069OpenAlexW2117775512MaRDI QIDQ3617753

Dan R. Ghica, Adam Bakewell

Publication date: 31 March 2009

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00768-2_8

Mathematics Subject Classification ID

Applications of game theory (91A80) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Verifying annotated program families using symbolic game semantics ⋮ Latent semantic analysis of game models using LSTM ⋮ Program verification using symbolic game semantics

Uses Software

• BLAST

Cites Work

• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• The regular-language semantics of second-order idealized ALGOL
• A game semantics of names and pointers
• Tools and Algorithms for the Construction and Analysis of Systems
• On-the-Fly Techniques for Game-Based Software Model Checking
• Correct Hardware Design and Verification Methods
• Static Analysis
• Tools and Algorithms for the Construction and Analysis of Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compositional Predicate Abstraction from Game Semantics