Memory-efficient algorithms for the verification of temporal properties

Formal Methods in System Design

Volumn 1, Issue 2-3, 1992, Pages 275-288

  Courcoubetis, C ^a   Vardi, M ^b   Wolper, P ^c   Yannakakis, M ^d  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c Un de Liège ^*  (Belgium)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

concurrent program; hashing; model checking; state space exploration; temporal logic; verification

Indexed keywords

EID: 0001107626     PISSN: 09259856     EISSN: 15728102     Source Type: Journal    
DOI: 10.1007/BF00121128     Document Type: Article

References (26)

1. Generalized technique for communication protocol validation
2. Protocol engineering
3. Network protocols and tools to help produce them
4. Automated validation of a communication protocol: the ccitt x.21 recommendation
5. A validation technique for tightly-coupled protocols
6. Tools for verifying network protocols
7. Attacking a complex distributed systems for different sides: an experience with complementary validation tools
8. Automatic verification of finite-state concurrent systems using temporal logic specifications
9. Specification and verification of concurrent systems in cesar
10. Unified verification theory
11. On the relation of programs and computations to models of temporal logic
12. An improved protocol reachability analysis technique
13. On-line model-checking for finite linear temporal logic specifications
14. Adding liveness properties to coupled finite-state machines
15. Tracing protocols