-
1
-
-
0029316495
-
Transformational design and implementation of a new efficient solution to the ready simulation problem
-
B. Bloom and R. Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Sci. Comp. Program., 24(3):189-220, 1995.
-
(1995)
Sci. Comp. Program.
, vol.24
, Issue.3
, pp. 189-220
-
-
Bloom, B.1
Paige, R.2
-
2
-
-
0024035719
-
Characterizing finite kripke structures in propositional temporal logic
-
M.C. Browne, E.M. Clarke and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theor. Comp. Sci., 59:115-131, 1988.
-
(1988)
Theor. Comp. Sci.
, vol.59
, pp. 115-131
-
-
Browne, M.C.1
Clarke, E.M.2
Grumberg, O.3
-
5
-
-
85050550846
-
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
-
th ACM POPL, pp. 238-252, 1977.
-
(1977)
th ACM POPL
, pp. 238-252
-
-
Cousot, P.1
Cousot, R.2
-
8
-
-
0345358528
-
From bisimulation to simulation: Coarsest partition problems
-
R. Gentilini, C. Piazza and A. Policriti. From bisimulation to simulation: coarsest partition problems. J. Automated Reasoning, 31(1):73-103, 2003.
-
(2003)
J. Automated Reasoning
, vol.31
, Issue.1
, pp. 73-103
-
-
Gentilini, R.1
Piazza, C.2
Policriti, A.3
-
9
-
-
84890021811
-
Incompleteness, counterexamples and refinements in abstract model checking
-
LNCS 2126
-
th SAS, LNCS 2126:356-373, 2001.
-
(2001)
th SAS
, pp. 356-373
-
-
Giacobazzi, R.1
Quintarelli, E.2
-
12
-
-
84874715172
-
Why is simulation harder than bisimulation?
-
LNCS 2421
-
th CONCUR, LNCS 2421:594-610, 2002.
-
(2002)
th CONCUR
, pp. 594-610
-
-
Kucera, A.1
Mayr, R.2
-
13
-
-
0029207880
-
Property preserving abstractions for the verification of concurrent systems
-
C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1-36, 1995.
-
(1995)
Formal Methods in System Design
, vol.6
, pp. 1-36
-
-
Loiseaux, C.1
Graf, S.2
Sifakis, J.3
Bouajjani, A.4
Bensalem, S.5
-
14
-
-
0023566630
-
Three partition refinement algorithms
-
R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973-989, 1987
-
(1987)
SIAM J. Comput.
, vol.16
, Issue.6
, pp. 973-989
-
-
Paige, R.1
Tarjan, R.E.2
-
15
-
-
40549132074
-
Generalized strong preservation by abstract interpretation
-
F. Ranzato and F. Tapparo. Generalized strong preservation by abstract interpretation. J. Logic and Computation, 17(1):157-197, 2007.
-
(2007)
J. Logic and Computation
, vol.17
, Issue.1
, pp. 157-197
-
-
Ranzato, F.1
Tapparo, F.2
-
16
-
-
84903199314
-
Simulation revisited
-
Tools and Algorithms for the Construction and Analysis of Systems 7th International Conference, TACAS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001 Proceedings
-
th TACAS, LNCS 2031:480-495, 2001. (Pubitemid 33254678)
-
(2001)
Lecture Notes in Computer Science
, Issue.2031
, pp. 480-495
-
-
Tan, L.1
Cleaveland, R.2
|