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
Model checking
Distributed Algorithms
A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Constraint-Based Verification of Parameterized Cache Coherence Protocols
Formal Methods in System Design
ACM Transactions on Computational Logic (TOCL)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
An automatic abstraction technique for verifying featured, parameterised systems
Theoretical Computer Science
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Proving liveness by backwards reachability
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
The automated verification of concurrent and distributed systems is a vibrant and successful area within Computer Science. Over the last 30 years, temporal logic [10,20] has been shown to provide a clear, concise and intuitive description of many such systems, and automata-theoretic techniques such as model checking [7,14] have been shown to be very useful in practical verification. Recently, the verification of infinite-state systems, particularly parameterised systems comprising arbitrary numbers of identical processes, has become increasingly important [5]. Practical problems of an open, distributed nature often fit into this model, for example robot swarms of arbitrary sizes.