Program verification using symbolic game semantics
From MaRDI portal
Publication:477213
DOI10.1016/j.tcs.2014.01.016zbMath1303.68083OpenAlexW2124580491MaRDI QIDQ477213
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.016
Formal languages and automata (68Q45) 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 (4)
Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting ⋮ Verifying annotated program families using symbolic game semantics ⋮ Finding suitable variability abstractions for lifted analysis ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symbolic bisimulations
- On full abstraction for PCF: I, II and III
- The regular-language semantics of second-order idealized ALGOL
- Compositional Predicate Abstraction from Game Semantics
- Formal Program Verification Using Symbolic Execution
- Foundations of Software Science and Computation Structures
- Static Analysis
- CONCUR 2005 – Concurrency Theory
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Program verification using symbolic game semantics