-
1
-
-
44949269544
-
Model checking in dense real-time
-
R. Alur, C. Courcoubetis, and D. Dill. Model checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
-
(1993)
Information and Computation
, vol.104
, Issue.1
, pp. 2-34
-
-
Alur, R.1
Courcoubetis, C.2
Dill, D.3
-
2
-
-
0028413052
-
A theory of timed automata
-
25 April
-
R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2): 183-235, 25 April 1994.
-
(1994)
Theoretical Computer Science
, vol.126
, Issue.2
, pp. 183-235
-
-
Alur, R.1
Dill, D.L.2
-
3
-
-
0000025993
-
Timing verification by successive approximation
-
R. Alur, A. Itai, R.P. Kurshan, and M. Yannakakis. Timing verification by successive approximation. Information and Computation, 118(1):142-157, 1995.
-
(1995)
Information and Computation
, vol.118
, Issue.1
, pp. 142-157
-
-
Alur, R.1
Itai, A.2
Kurshan, R.P.3
Yannakakis, M.4
-
4
-
-
33745470484
-
Lower and upper bounds in zone based abstractions of timed automata
-
G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek. Lower and upper bounds in zone based abstractions of timed automata. LNCS, 2988:312-326, 2004.
-
(2004)
LNCS
, vol.2988
, pp. 312-326
-
-
Behrmann, G.1
Bouyer, P.2
Larsen, K.G.3
Pelánek, R.4
-
5
-
-
84863928730
-
Computing abstractions of infinite state systems compositionally and automatically
-
S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. LNCS, 1427:319-331, 1998.
-
(1998)
LNCS
, vol.1427
, pp. 319-331
-
-
Bensalem, S.1
Lakhnech, Y.2
Owre, S.3
-
6
-
-
84944406286
-
Counterexample-guided abstraction refinement
-
E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample- guided abstraction refinement. LNCS, 1855:154-169, 2000.
-
(2000)
LNCS
, vol.1855
, pp. 154-169
-
-
Clarke, E.1
Grumberg, O.2
Jha, S.3
Lu, Y.4
Veith, H.5
-
9
-
-
84947909489
-
Model checking of real-time reachability properties using abstractions
-
C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. LNCS, 1384:313-329, 1998.
-
(1998)
LNCS
, vol.1384
, pp. 313-329
-
-
Daws, C.1
Tripakis, S.2
-
10
-
-
9444264427
-
The ICS decision procedures for embedded deduction
-
L. de Moura, S. Owre, H. Rueß, J. Rushby, and N. Shankar. The ICS decision procedures for embedded deduction. LNCS, 3097:218-222, 2004.
-
(2004)
LNCS
, vol.3097
, pp. 218-222
-
-
De Moura, L.1
Owre, S.2
Rueß, H.3
Rushby, J.4
Shankar, N.5
-
11
-
-
14744281167
-
SAL 2
-
LNCS. Springer-Verlag, Tool description
-
L. de Moura, S. Owre, H. Rueß, J. Rushby, N. Shankar, M. Sorea, and A. Tiwari. SAL 2. In 16th Conference on Computer Aided Verification, LNCS. Springer-Verlag, 2004. Tool description.
-
(2004)
16th Conference on Computer Aided Verification
-
-
De Moura, L.1
Owre, S.2
Rueß, H.3
Rushby, J.4
Shankar, N.5
Sorea, M.6
Tiwari, A.7
-
12
-
-
84947903651
-
Verification of real-time systems by successive over and under approximation
-
D. Dill and H. Wong-Toi. Verification of real-time systems by successive over and under approximation. LNCS, 939:409-422, 1995.
-
(1995)
LNCS
, vol.939
, pp. 409-422
-
-
Dill, D.1
Wong-Toi, H.2
-
13
-
-
84944065857
-
Abstraction-based model checking using modal transition systems
-
P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based model checking using modal transition systems. LNCS, 2154:426-440, 2001.
-
(2001)
LNCS
, vol.2154
, pp. 426-440
-
-
Godefroid, P.1
Huth, M.2
Jagadeesan, R.3
-
14
-
-
84947441305
-
Construction of abstract state graphs with PVS
-
S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. LNCS, 1254:72-83, 1997.
-
(1997)
LNCS
, vol.1254
, pp. 72-83
-
-
Graf, S.1
Saïdi, H.2
-
15
-
-
0036041563
-
Lazy abstraction
-
T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Symposium on Principles of Programming Languages, pages 58-70, 2002.
-
(2002)
Symposium on Principles of Programming Languages
, pp. 58-70
-
-
Henzinger, T.A.1
Jhala, R.2
Majumdar, R.3
Sutre, G.4
-
16
-
-
84903187338
-
Incremental verification by abstraction
-
Y. Lachnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verification by abstraction. LNCS, 2031:98-112, 2001.
-
(2001)
LNCS
, vol.2031
, pp. 98-112
-
-
Lachnech, Y.1
Bensalem, S.2
Berezin, S.3
Owre, S.4
-
18
-
-
84956856293
-
Difference decision diagrams
-
The IT University of Copenhagen, Denmark, September
-
J. Møller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard. Difference decision diagrams. In Computer Science Logic, The IT University of Copenhagen, Denmark, September 1999.
-
(1999)
Computer Science Logic
-
-
Møller, J.1
Lichtenberg, J.2
Andersen, H.R.3
Hulgaard, H.4
-
19
-
-
18544381781
-
Predicate abstraction for dense real-time systems
-
M. O. Möller, H. Rueß, and M. Sorea. Predicate abstraction for dense real-time systems. ENTCS, 65(6), 2002. http://www.elsevier.com/locate/ entcs/volume65.html.
-
ENTCS
, vol.65
, Issue.6
, pp. 2002
-
-
Möller, M.O.1
Rueß, H.2
Sorea, M.3
-
20
-
-
84957079461
-
Abstract and model check while you prove
-
H. Saïdi and N. Shankar. Abstract and model check while you prove. LNCS, 1633:443-454, 1999.
-
(1999)
LNCS
, vol.1633
, pp. 443-454
-
-
Saïdi, H.1
Shankar, N.2
-
21
-
-
33746824851
-
Counterexample-driven model checking
-
SRI International
-
N. Shankar and M. Sorea. Counterexample-driven model checking. Technical Report SRI-CSL-03-04, SRI International, 2003. http://www.csl.sri.com/users/ sorea/ reports/wmc.ps.gz.
-
(2003)
Technical Report SRI-CSL-03-04
-
-
Shankar, N.1
Sorea, M.2
-
22
-
-
0035135204
-
Analysis of timed systems using time-abstracting bisimulations
-
Kluwer Academic Publishers
-
S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(1):25-68, 2001. Kluwer Academic Publishers.
-
(2001)
Formal Methods in System Design
, vol.18
, Issue.1
, pp. 25-68
-
-
Tripakis, S.1
Yovine, S.2
|