Communicating sequential processes
Communicating sequential processes
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Design and validation of computer protocols
Design and validation of computer protocols
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A structural induction theorem for processes
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Parallel composition of assumption-commitment specifications
Acta Informatica
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework
Seminar on Concurrency, Carnegie-Mellon University
Algorithmic Verification of Linear Temporal Logic Specifications
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
P-A logic: a compositional proof system for distributed programs
Distributed Computing
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Mechanical Abstraction of CSPZ Processes
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Integration of bounded model checking and deductive verification
FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
| Hi-index | 0.00 |
The paper presents an approach to the formal verification of a complete software system intended to support the flagship product of Perfecto Technologies which enforces application security over an open communication net. Based on initial experimentation, it was decided that the verification method will be based on a combination of model-checking using SPIN with deductive verification which handles the more data-intensive elements of the design. The analysis was that only such a combination can cover by formal verification all the important aspects of the complete system. In order to enable model checking of large portions of the design, we have developed an assume-guarantee approach which supports compositional verification. We describe how this general approach was implemented in the spin framework. Then, we explain the need to split the verification activity into the model-checking part which deals with the control issues such as concurrency or deadlocking and a deductive part which handles the data-intensive elements of the design.