An improved algorithm for the evaluation of fixpoint expressions

Theoretical Computer Science

Volumn 178, Issue 1-2, 1997, Pages 237-255

  Browne, A ^a   Clarke, E M ^b   Jha, S ^b   Long, D E ^c   Marrero, W ^b  

^a Stanford University   (United States)

^b Carnegie Mellon University   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING;

AUTOMATED FINITE STATE VERIFICATION PROCEDURES; FIXPOINT COMPUTATIONS;

FINITE AUTOMATA;

EID: 0347307589     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00228-9     Document Type: Article

References (24)

1. H.R. Andersen, Model checking and boolean graphs, in: B. Krieg-Bruckner, ed., Proc. 4th European Symp. on Programming, Lecture Notes in Computer Science, Vol. 582 (Springer, Berlin, 1992).
2. A. Arnold and P. Crubille. A linear algorithm to solve fix-point equations on transition systems, IPL 29 (1988) 57-66.
3. G.V. Bochmann and D.K. Probst, eds., Proc. 4th Workshop on Computer-Aided Verification, Lecture Notes in Computer Science. Vol. 663 (Springer, Berlin, July 1992).
4. R.E. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. Comput. C-35 (8) (1986) 677-691.
5. 20 states and beyond, in: Proc. 5th Annual Symp on Logic in Computer Science (IEEE Computer Soc. Press, Silver Spring, MD, 1990).
6. E.M. Clarke, I.A. Draghicescu and R.P. Kurshan, A unified approach for showing language containment and equivalence between various types of ω-automata, in: A. Arnold and N.D. Jones, eds., Proc. 15th Coll. on Trees in Algebra and Programming, Lecture Notes in Computer Science. Vol. 407 (Springer, Berlin, 1990).
7. E.M. Clarke and E.A. Emerson, Synthesis of synchronization skeletons for branching time temporal logic, in: D. Kozen, ed., Logic of Programs: Workshop (Yorktown Heights, NY, May 1981), Lecture Notes in Computer Science, Vol. 131 (Springer, Berlin, 1981).
8. E.M. Clarke, E.A. Emerson and A.P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Trans. Programming Languages Systems 8 (2) (1986) 244-263.
9. R. Cleaveland, Tableau-based model checking in the propositional mu-calculus, Acta Inform. 27 (8) (1990) 725-747.
10. R. Cleaveland, M. Klein and B. Steffen, Faster model checking for the modal mu-calculus, in: G.V. Bochmann and D.K. Probst, eds., Proc. 4th Workshop on Computer Aided Verification, Lecture Notes in Computer Science, Vol. 663 (Springer, Berlin, 1992).
11. R. Cleaveland and B. Steffen, A linear-time model-checking algorithm for the alternation-free modal mu-calculus, Formal Methods System Des. 2 (2) (1993) 121-147.
12. O. Coudert, C. Berthet and J.C. Madre, Verification of synchronous sequential machines based on symbolic execution, In: J. Sifakis, ed., Proc. 1989 Internat. Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, Lecture Notes in Computer Science, Vol. 407 (Springer, Berlin, 1989).
13. J.W. de Bakker, Mathematical Theory of Program Correctness (Prentice-Hall, Englewood Cliffs, NJ, 1980).
14. E.A. Emerson and C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus, in: Proc. 1st Annual Symp. on Logic in Computer Science (IEEE Computer Soc. Press, Silver Spring, MD, 1986).
15. M.J. Fischer and R.E. Ladner, Propositional dynamic logic of regular programs, J. Comput. System Sci. 18 (1979) 194-211.
16. D. Kozen, Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
17. K.G. Larsen, Efficient local correctness checking, in: G.V. Bochmann and D.K. Probst, eds., Proc. 4th Workshop on Computer Aided Verification, Lecture Notes in Computer Science, Vol. 663 (Springer, Berlin, 1992).
18. A. Mader, Tableau recycling, in: G.V. Bochmann and D.K. Probst, eds., Proc. 4th Workshop on Computer Aided Verification, Lecture Notes in Computer Science, Vol. 663 (Springer, Berlin, 1992).
19. K.L. McMillan, Symbolic model checking: an approach to the state explosion problem, Ph.D. Thesis, Carnegie Mellon University, 1992.
20. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).
21. D.M.R. Park, Finiteness is mu-ineffable, Theory of Computation Report No. 3, University of Warwick, 1974.
22. C. Stirling and D.J. Walker, Local model checking in the modal mu-calculus, Theoret. Comput. Sci. 89 (1) (1991) 161-177.
23. A. Tarski A lattice-theoretic fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
24. G. Winskel, Model checking in the modal v-calculus, in: Proc. 16th Internat. Coll. on Automata, Languages, and Programming (1989).