Model checking, testing and verification working together

Authors:
Elsa Gunter;Doron Peled
Affiliations:
Department of Computer Science, University of Illinois at Urbana–Champaign, 61801-2302, Urbana, IL, USA;Dept. of Computer Science, The University of Warwick, CV4 7AL, Coventry, IL, UK
Venue:
Formal Aspects of Computing
Year:
2005

Citing 0
Cited 12

SYNERGY: a new algorithm for property checking

Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Proofs from tests

ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
On model checking multiple hybrid views

Theoretical Computer Science
Using formal specifications to support testing

ACM Computing Surveys (CSUR)
Symbolic Model-based Test Selection

Electronic Notes in Theoretical Computer Science (ENTCS)
Proof Assisted Model Checking for B

ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Model-based test selection for infinite-state reactive systems

FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Testing from X-machine specifications

Formal methods and testing
The future of library specification

Proceedings of the FSE/SDP workshop on Future of software engineering research
One step forward: Linking wireless self-organizing network validation techniques with formal testing approaches

ACM Computing Surveys (CSUR)
Model checking a model checker: a code contract combined approach

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Generating tests from EFSM models using guided model checking and iterated search refinement

FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a symbolic model checking approach that allows verifying a unit of code, e.g., a single procedure or a collection of procedures that interact with each other. We allow temporal specifications that assert over both the program counters and the program variables. We decompose the verification into two parts: (1) a search that is based on the temporal behavior of the program counters, and (2) the formulation and refutation of a path condition, which inherits conditions constraining the program variables from the temporal specification. This verification approach is modular, as we do not require that all the involved procedures are provided. Furthermore, we do not request that the code is based on a finite domain. The presented approach can also be used for automating the generation of test cases for unit testing.