The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Software verification with BLAST
SPIN'03 Proceedings of the 10th international conference on Model checking software
Data-abstraction refinement: a game semantic approach
SAS'05 Proceedings of the 12th international conference on Static Analysis
Game-based safety checking with Mage
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
Automated Security Verification for Crypto Protocol Implementations: Verifying the Jessie Project
Electronic Notes in Theoretical Computer Science (ENTCS)
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
A compositional method for deciding equivalence and termination of nondeterministic programs
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Assume-guarantee software verification based on game semantics
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Parameterized verification of open procedural programs
Proceedings of the Fifth Balkan Conference in Informatics
| Hi-index | 0.00 |
We present a model checking tool based on game semantics and CSP for verifying safety properties of software, such as assertion violations or array-out-of-bounds errors. The tool implements a data-abstraction refinement procedure applicable to open programs with infinite integer types. The procedure is guaranteed to terminate for unsafe inputs.