Communicating sequential processes
Communicating sequential processes
Handbook of theoretical computer science (vol. B)
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Automatic generation of invariants and intermediate assertions
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Model checking
An axiomatic basis for computer programming
Communications of the ACM
Generalized Temporal Verification Diagrams
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Efficient On-the-Fly Model Checking for CTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The verification methodology studied in this paper stems from investigations on respectively deduction-based model checking and semantics of concurrency. Specifically, we consider imperative programs with CSP-like communication and use a categorical semantics as foundation to extract from a program a control graph labelled by transition predicates. This logical content acts as system description for a deduction-based model checker of LTL properties. We illustrate our methodology with a concrete realisation in the form of the Mc5 verification tool written in Ocaml and using the theorem prover PVS as back-end.