Why functional programming matters
The Computer Journal - Special issue on Lazy functional programming
The existence of refinement mappings
Theoretical Computer Science
Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms
IEEE Transactions on Software Engineering
Model checking
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Model Checking
Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Modeling and Verification of Biphase Mark Protocolsin Duration Calculus Using PVS
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Theory Interpretations in PVS
Generating Efficient Test Sets with a Model Checker
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
The formal verification of a reintegration protocol
Proceedings of the 5th ACM international conference on Embedded software
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
Harnessing Disruptive Innovation in Formal Verification
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
Formal Methods in System Design
Modeling Time-Triggered Protocols and Verifying Their Real-Time Schedules
FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Temporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols
MEMOCODE '07 Proceedings of the 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign
Easy parameterized verification of biphase mark and 8n1 protocols
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
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.