Relaxed visibility enhances partial order reduction

Formal Methods in System Design

Volumn 19, Issue 3, 2001, Pages 275-289

  Peled, Doron ^a,b   Valmari, Antti ^c   Kokkarinen, Ilkka ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Automatic verification; Model checking; Partial order reduction; State space explosion

Indexed keywords

AUTOMATA THEORY; CONSTRAINT THEORY; ERROR CORRECTION; MATHEMATICAL MODELS; STATE SPACE METHODS;

AUTOMATIC VERIFICATION; CONCURRENT SYSTEMS; MODEL CHECKING; PARTIAL ORDER REDUCTION;

FORMAL LOGIC;

EID: 0035501578     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011202615884     Document Type: Article

References (19)

1. Memory-efficient algorithms for the verification of temporal properties
2. Simple on-the-fly automatic verification of linear temporal logic
3. Using partial orders to improve automatic verification methods
4. Refining dependencies improves partial order verification methods
5. A partial approach to model checking
6. Verification of distributed programs using representative interleaving sequences
7. Defining conditional independence using collapses
8. A verification oriented theory of data in labeled transition system
9. What good is temporal logic
10. All from one, one for all, on model-checking using representatives
11. Combining partial order reductions with on-the-fly model-checking
12. An algorithmic approach for checking closure properties of temporal logic specification and ω-regular languages
13. The temporal logic of programs
14. Stubborn sets for reduced state space generation
15. A stubborn attack on state explosion
16. On-the-fly verification with stubborn sets
17. An automata-theoretic approach to automatic program verification
18. Partial-order methods for model checking: From linear time to branching time