Program verification using symbolic game semantics
DOI10.1016/J.TCS.2014.01.016zbMATH Open1303.68083OpenAlexW2124580491MaRDI QIDQ477213FDOQ477213
Authors: Aleksandar Dimovski 
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
Recommendations
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- On full abstraction for PCF: I, II and III
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symbolic bisimulations
- The regular-language semantics of second-order idealized ALGOL
- Compositional Predicate Abstraction from Game Semantics
- Formal Program Verification Using Symbolic Execution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- Static Analysis
- CONCUR 2005 – Concurrency Theory
- Tools and Algorithms for the Construction and Analysis of Systems
Cited In (8)
- Static Analysis
- State separation for code-based game-playing proofs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding suitable variability abstractions for lifted analysis
- Verifying annotated program families using symbolic game semantics
- From bounded checking to verification of equivalence via symbolic up-to techniques
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
This page was built for publication: Program verification using symbolic game semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477213)
