Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
Principles of Program Analysis
Principles of Program Analysis
Relaxed Visibility Enhances Partial Order Reduction
Formal Methods in System Design
A generalized semantics of PROMELA for abstract model checking
Formal Aspects of Computing
Model checking software with well-defined APIs: the socket case
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Concrete model checking with abstract matching and refinement
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On-the-Fly Data Flow Analysis Based on Verification Technology
Electronic Notes in Theoretical Computer Science (ENTCS)
Model extraction for ARINC 653 based avionics software
Proceedings of the 14th international SPIN conference on Model checking software
C.OPEN and ANNOTATOR: tools for on-the-fly model checking C programs
Proceedings of the 14th international SPIN conference on Model checking software
A model-extraction approach to verifying concurrent C programs with CADP
Science of Computer Programming
Using SPIN for automated debugging of infinite executions of Java programs
Journal of Systems and Software
| Hi-index | 0.00 |
Current research in software model checking explores new techniques to handle the storage of visited states (usually called the heap). One approach consists in saving only parts or representations of the states in the heap. This paper presents a new technique to implement sound abstract matching of states. This kind of matching produces a reduction in the number of states and traces explored. With the aim of obtaining a useful result, it is necessary to establish some correctness conditions on the matching scheme. In this paper, we use static analysis to automatically construct an abstract matching function which depends on the program and the property to be verified. The soundness of the static analysis guarantees the soundness of verification. This paper describes the overall technique applied to Spin, the correctness issues and some examples which show its efficiency.