The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Synthesis of Linear Ranking Functions
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Practical Methods for Proving Program Termination
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Fully Abstract Game Semantics for Finite Nondeterminism
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Compositional software verification based on game semantics and process algebra
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on Advances in Automated Verification of Critical Systems
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
On-the-fly techniques for game-based software model checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
On automated verification of probabilistic programs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Abstraction refinement for termination
SAS'05 Proceedings of the 12th international conference on Static Analysis
Data-abstraction refinement: a game semantic approach
SAS'05 Proceedings of the 12th international conference on Static Analysis
A counterexample-guided refinement tool for open procedural programs
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Parameterized verification of open procedural programs
Proceedings of the Fifth Balkan Conference in Informatics
| Hi-index | 0.00 |
In this paper we address the problem of deciding may-and must-equivalence and termination of nondeterministic finite programs from second-order recursion-free Erratic Idealized Algol. We use game semantics to compositionally extract finite models of programs, and the CSP process algebra as a concrete formalism for representation of models and their efficient verification. Observational may- and must-equivalence and liveness properties, such as divergence and termination, are decided by checking traces refinements and divergence-freedom of CSP processes using the FDR tool. The practicality of the approach is evaluated on several example.