Ensuring completeness of symbolic verification methods for infinite-state systems

Theoretical Computer Science

Volumn 256, Issue 1-2, 2001, Pages 145-167

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Infinite state systems; Model checking; Reachability analysis; Symbolic verification

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PETRI NETS;

SYMBOLIC VERIFICATION;

COMPUTATIONAL COMPLEXITY;

EID: 0034922627     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00105-5     Document Type: Article

References (36)

1. A really temporal logic
2. Model-checking for real-time systems
3. Verifying programs with unreliable channels
4. Decidability of simulation and bisimulation between lossy channel systems and finite state systems
5. General decidability theorems for infinite-state systems
6. Undecidable verification problems for programs with unreliable channels
7. Verifying programs with unreliable channels
8. Verifying networks of timed processes
9. Distributed cooperation with action systems
10. Automatic construction of complete sample systems for program testing
11. Local model checking for infinite state spaces
12. Graph-based algorithms for boolean function manipulation
13. 20 states and beyond
14. Composition, decomposition, and model checking of pushdown processes
15. Decidability of bisimulation equivalence for parallel timer processes
16. Feasibility of finite and infinite paths in data dependent programs
17. Deciding properties of integral relational automata
18. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors
19. Reduction and covering of infinite reachability trees
20. Decidability of the termination problem for completely specified protocols
21. Reasoning about systems with many processes
22. Using partial orders for the efficient verification of deadlock freedom and safety properties
23. Hybrid automata with finite bisimulations
24. Ordering by divisibility in abstract algebras
25. Decidability of a temporal logic problem for Petri nets
26. Checking regular properties of Petri nets
27. Deciding bisimulation equivalences for a class of non-finite-state programs
28. Symbolic model checking with rich assertional languages
29. Combining partial order reductions with on-the-fly model checking
30. Specification, proof checking, and model checking for protocols and distributed systems with PVS
31. PVS: Combining specification, proof checking, and model checking
32. Decidability of bisimulation equivalence for normed pushdown processes
33. On-the-fly verification with stubborn sets
34. An automata-theoretic approach to automatic program verification
35. Expressing interesting properties of programs in propositional temporal logic