Model checking for the practical verificationist
Author(s) -
Lee Pike
Publication year - 2007
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/1345169.1345172
Subject(s) - model checking , computer science , programming language , gas meter prover , automated theorem proving , exploit , theoretical computer science , bounded function , state (computer science) , formal verification , abstraction model checking , symbolic trajectory evaluation , interface (matter) , algorithm , mathematics , parallel computing , mathematical analysis , geometry , computer security , bubble , maximum bubble pressure method , mathematical proof
SRI's Symbolic Analysis Laboratory (SAL) is a high-level language-interface to a collection of state-of-the-art model checking tools. SAL contains novel and powerful features, many of which are not available in other model checkers. In this experience report, I highlight some of the features I have particularly found useful, drawing examples from published verifications using SAL. In particular, I discuss the use of higher-order functions in model checking, infinite-state bounded model checking, compositional specification and verification, and finally, mechanical theorem prover and model checker interplay. The purpose of this report is to expose these features to working verificationists and to demonstrate how to exploit them effectively.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom