An abstract interpretation-based refinement algorithm for strong preservation

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 140-156

  Ranzato, Francesco ^a   Tapparo, Francesco ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION; EQUIVALENCE CLASSES; FORMAL LANGUAGES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; STATE SPACE METHODS;

BISIMULATION; STATE PARTITION; TEMPORAL LANGUAGES;

ALGORITHMS;

EID: 24644510411     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_10     Document Type: Conference Paper

References (17)

1. A. V. Aho, J.E. Hopcroft and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.
2. M.C. Browne, E.M. Clarke and O. Grumberg. Characterizing finite Kripke structures in prepositional temporal logic. Theor. Comp. Sci., 59:115-131, 1988.
3. E.M. Clarke, O. Grumberg and D.A. Peled. Model Checking. The MIT Press, 1999.
4. th ACM POPL, 238-252, 1977.
5. th ACM POPL, 269-282, 1979.
6. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD Thesis, Eindhoven Univ., 1996.
7. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. J. ACM, 42(2):458-487, 1995
8. R. Gentilini, C. Piazza and A. Policriti. From bisimulation to simulation: coarsest partition problems. J. Automated Reasoning, 31(1):73-103, 2003.
9. th SAS, LNCS 2126:356-373, 2001.
10. R. Giacobazzi, F. Ranzato and F. Scozzari. Making abstract interpretations complete. J. ACM, 47(2):361-416, 2000.
11. th ICALP, LNCS 443:626-638, 1990.
12. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. ACM, 32(1):137-161, 1985.
13. th FOCS, 453-462, 1995.
14. th CONCUR, LNCS 2421:594-610, 2002.
15. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973-989, 1987
16. th ESOP, LNCS 2986:18-32, 2004.
17. R.J. van Glabbeek. The linear time - branching time spectrum I: the semantics of concrete sequential processes. In Handbook of Process Algebra, pp. 3-99, Elsevier, 2001.