Generalizing the Paige-Tarjan algorithm by abstract interpretation

Information and Computation

Volumn 206, Issue 5, 2008, Pages 620-651

  Ranzato, Francesco ^a   Tapparo, Francesco ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MATHEMATICAL OPERATORS; MODEL CHECKING;

ABSTRACT INTERPRETATION; PAIGE AND TARJAN ALGORITHM (PT);

ALGORITHMS;

EID: 41349108646     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.01.001     Document Type: Article

References (32)

1. Bloom B., and Paige R. Transformational design and implementation of a new efficient solution to the ready simulation problem. Sci. Comp. Program. 24 3 (1995) 189-220
2. Browne M.C., Clarke E.M., and Grumberg O. Characterizing finite Kripke structures in propositional temporal logic. Theor. Comp. Sci. 59 (1988) 115-131
3. Bustan D., and Grumberg O. Simulation-based minimization. ACM Trans. Comput. Logic 4 2 (2003) 181-204
4. Clarke E.M., Grumberg O., and Peled D.A. Model Checking (1999), The MIT Press
5. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the 4th ACM POPL, ACM Press, 1977, pp. 238-252.
6. P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Proceedings of the 6th ACM POPL, ACM Press, 1979, pp. 269- 282.
7. D. Dams, Abstract Interpretation and Partition Refinement for Model Checking, PhD Thesis, Eindhoven University, 1996.
8. De Nicola R., and Vaandrager F. Three logics for branching bisimulation. J. ACM 42 2 (1995) 458-487
9. Dovier A., Piazza C., and Policriti A. An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci. 325 1 (2004) 45-67
10. Filé G., Giacobazzi R., and Ranzato F. A unifying view of abstract domain design. ACM Comput. Surv. 28 2 (1996) 333-336
11. Gentilini R., Piazza C., and Policriti A. From bisimulation to simulation: coarsest partition problems. J. Autom. Reason. 31 1 (2003) 73-103
12. R. Giacobazzi, E. Quintarelli, Incompleteness, counterexamples and refinements in abstract model checking, in: Proceedings of the 8th SAS, LNCS vol. 2126, 2001, Springer, pp. 356-373.
13. R. Giacobazzi, F. Ranzato, Refining and compressing abstract domains, in: Proceedings of the 24th ICALP, LNCS, vol. 1256, 1997, Springer, pp. 771-781.
14. Giacobazzi R., Ranzato F., and Scozzari F. Making abstract interpretations complete. J. ACM 47 2 (2000) 361-416
15. van Glabbeek R.J. The linear time-branching time spectrum I: the semantics of concrete sequential processes. Handbook of Process Algebra (2001), Elsevier 3-99
16. van Glabbeek R.J., and Weijland W.P. Branching time and abstraction in bisimulation semantics. In: Ritter G.X. (Ed). Information Processing '89 (1989), Elsevier 613-618
17. J.F. Groote, F. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, in: Proceedings of the 17th ICALP, LNCS, vol. 443, Springer, 1990, pp. 626-638.
18. Habib M., Paul C., and Vienot L. Partition refinement techniques: an interesting algorithmic tool kit. Int. J. Found. Comput. Sci. 10 2 (1999) 147-170
19. Hennessy M., and Milner R. Algebraic laws for nondeterminism and concurrency. J. ACM 32 1 (1985) 137-161
20. M.R. Henzinger, T.A. Henzinger, P.W. Kopke, Computing simulations on finite and infinite graphs, in: Proceedings of 36th FOCS, IEEE Press, 1995, pp. 453-462.
21. Henzinger T.A., Maujumdar R., and Raskin J.-F. A classification of symbolic transition systems. ACM Trans. Comput. Logic 6 1 (2005) 1-31
22. Hopcroft J.E. An n log n algorithm for minimizing states in a finite automaton. In: Kohavi Z., and Paz A. (Eds). Theory of Machines and Computations (1971), Academic Press 189-196
23. A. Kucera, R. Mayr, Why is simulation harder than bisimulation? in: Proceedings of the 13th CONCUR, LNCS, vol. 2421, Springer, 2002, pp. 594-610.
24. Lamport L. What good is temporal logic?. Information Processing '83 (1983), IFIP North-Holland 657-668
25. Milner R. A Calculus of Communicating Systems, LNCS, vol. 92 (1980), Springer
26. Paige R., and Tarjan R.E. Three partition refinement algorithms. SIAM J. Comput. 16 6 (1987) 973-989
27. F. Ranzato, F. Tapparo, in: An abstract interpretation-based refinement algorithm for strong preservation, in: Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05), LNCS, vol. 3440, Springer, 2005, pp. 140-156.
28. Ranzato F., and Tapparo F. Generalized strong preservation by abstract interpretation. J. Logic Comput. 17 1 (2007) 157-197
29. F. Ranzato, F. Tapparo, A new efficient simulation equivalence algorithm, in: Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS'07), IEEE Press, 2007, pp. 171-180.
30. L. Tan, R. Cleaveland, Simulation revisited, in: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), LNCS, vol. 2031, 2001, Springer, pp. 480-495.
31. R.E. Tarjan, Depth-first search and linear graph algorithms, in: SIAM J. Comput. 1 (2) (1972) 146-160.
32. The VLTS Benchmark Suite. Collection of Very Large Transition Systems, Available from: http://www.inrialpes.fr/vasy/cadp/resources/benchmark_bcg.html.