Software Model Checking Based on Game Semantics and CSP

Authors:
Aleksandar Dimovski;Ranko Lazić
Affiliations:
Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK;Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 5
Cited 0

The SLAM project: debugging system software via static analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Modern Compiler Implementation in Java

Modern Compiler Implementation in Java
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
The regular-language semantics of second-order idealized ALGOL

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach for software model checking based on game semantics and CSP. Open program fragments are compositionally modelled as CSP processes which represent their game semantics. This translation is performed by a prototype compiler. Observational equivalence and verification of properties are checked by traces refinement using the FDR tool. The effectiveness of our approach is evaluated on several examples.