-
1
-
-
84863944806
-
Symbolic reachability analysis based on SAT-solvers
-
Proc. of TACAS'00
-
P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic reachability analysis based on SAT-solvers. In Proc. of TACAS'00, vol. 1785 of LNCS, pp. 411-425, 2000.
-
(2000)
LNCS
, vol.1785
, pp. 411-425
-
-
Abdulla, P.A.1
Bjesse, P.2
Eén, N.3
-
2
-
-
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
-
3
-
-
85031771187
-
Automata for modelling real-time systems
-
Proc. of ICALP'90. Springer-Verlag
-
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of ICALP'90, vol. 443 of LNCS, pp. 322-335. Springer-Verlag, 1990.
-
(1990)
LNCS
, vol.443
, pp. 322-335
-
-
Alur, R.1
Dill, D.2
-
4
-
-
0028413052
-
A theory of timed automata
-
R. Alur and D. Dill. A theory of Timed Automata. Theoretical Computer Science, 126(2):183 - 235, 1994.
-
(1994)
Theoretical Computer Science
, vol.126
, Issue.2
, pp. 183-235
-
-
Alur, R.1
Dill, D.2
-
5
-
-
84957646404
-
Data-structures for the verification of timed automata
-
Proc. of HART'97. Springer-Verlag
-
E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, and A. Rasse. Data-structures for the verification of Timed Automata. In Proc. of HART'97, vol. 1201 of LNCS, pp. 346-360. Springer-Verlag, 1997.
-
(1997)
LNCS
, vol.1201
, pp. 346-360
-
-
Asarin, E.1
Bozga, M.2
Kerbrat, A.3
Maler, O.4
Pnueli, A.5
Rasse, A.6
-
6
-
-
84948948420
-
A SAT based approach for solving formulas over boolean and linear mathematical propositions
-
Proc. of CADE'02. Springer-Verlag
-
G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In Proc. of CADE'02, vol. 2392 of LNCS. Springer-Verlag, 2002.
-
(2002)
LNCS
, vol.2392
-
-
Audemard, G.1
Bertoli, P.2
Cimatti, A.3
Kornilowicz, A.4
Sebastiani, R.5
-
8
-
-
84944319371
-
Symbolic model checking without BDDs
-
Proc. of TACAS'99
-
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS'99, vol. 1579 of LNCS, pp. 193-207. 1999.
-
(1999)
LNCS
, vol.1579
, pp. 193-207
-
-
Biere, A.1
Cimatti, A.2
Clarke, E.3
Zhu, Y.4
-
9
-
-
0031376266
-
On-the-fly symbolic model checking for real-time systems
-
IEEE Comp. Soc. Press
-
A. Bouajjani, S. Tripakis, and S. Yovine. On-the-fly symbolic model checking for real-time systems. In Proc. of RTSS'97, pp. 232-243. IEEE Comp. Soc. Press, 1997.
-
(1997)
Proc. of RTSS'97
, pp. 232-243
-
-
Bouajjani, A.1
Tripakis, S.2
Yovine, S.3
-
10
-
-
84919401135
-
A machine program for theorem proving
-
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving, Communications of the ACM, 5, 1962, 394-397.
-
(1962)
Communications of the ACM
, vol.5
, pp. 394-397
-
-
Davis, M.1
Logemann, G.2
Loveland, D.3
-
11
-
-
84947909489
-
Model checking of real-time reachability properties using abstractions
-
Proc. of TACAS'98
-
C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In Proc. of TACAS'98, vol. 1384 of LNCS, pp. 313-329. 1998.
-
(1998)
LNCS
, vol.1384
, pp. 313-329
-
-
Daws, C.1
Tripakis, S.2
-
12
-
-
84948958346
-
Lazy theorem proving for bounded model checking over infinite domains
-
Proc. of CADE'02
-
L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Proc. of CADE'02, vol. 2392 of LNCS. 2002.
-
(2002)
LNCS
, vol.2392
-
-
De Moura, L.1
Rueß, H.2
Sorea, M.3
-
13
-
-
84947587965
-
Automated verification of infinite state concurrent systems: An improvement in model generation
-
Proc. of PPAM'01. Springer-Verlag
-
P. Dembiński, W. Penczek, and A. Półrola. Automated verification of infinite state concurrent systems: an improvement in model generation. In Proc. of PPAM'01, vol. 2328 of LNCS, pp. 247-255. Springer-Verlag, 2001.
-
(2001)
LNCS
, vol.2328
, pp. 247-255
-
-
Dembiński, P.1
Penczek, W.2
Półrola, A.3
-
14
-
-
84944063124
-
Bounded reachability checking with process semantics
-
Proc. of CONCUR'01. Springer-Verlag
-
K. Heljanko. Bounded reachability checking with process semantics. In Proc. of CONCUR'01, vol. 2154 of LNCS, pp. 218-232. Springer-Verlag, 2001.
-
(2001)
LNCS
, vol.2154
, pp. 218-232
-
-
Heljanko, K.1
-
16
-
-
0038474478
-
A state minimization technique for Timed Automata
-
August
-
I. Kang, I. Lee, and Y. S. Kim. A state minimization technique for Timed Automata. In Proc. of INFINITY'96, August 1996.
-
(1996)
Proc. of INFINITY'96
-
-
Kang, I.1
Lee, I.2
Kim, Y.S.3
-
17
-
-
0031357735
-
Efficient verification of real-time systems: Compact data structures and state-space reduction
-
IEEE Comp. Soc. Press
-
K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Efficient verification of real-time systems: Compact data structures and state-space reduction. In Proc. of RTSS'97, pp. 14-24. IEEE Comp. Soc. Press, 1997.
-
(1997)
Proc. of RTSS'97
, pp. 14-24
-
-
Larsen, K.G.1
Larsson, F.2
Pettersson, P.3
Yi, W.4
-
18
-
-
0034852165
-
Chaff: Engineering an efficient SAT solver
-
June
-
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. of DAC'01, pp. 530-535, June 2001.
-
(2001)
Proc. of DAC'01
, pp. 530-535
-
-
Moskewicz, M.1
Madigan, C.2
Zhao, Y.3
Zhang, L.4
Malik, S.5
-
19
-
-
84974666943
-
Verification of timed automata via satisfiability checking
-
Proc. of FTRTFT'02. Springer-Verlag
-
P. Niebert, M. Mahfoudh, E. Asarin, M. Bozga, O. Maler, and N. Jain. Verification of Timed Automata via Satisfiability Checking. In Proc. of FTRTFT'02, vol. 2469 of LNCS, pp. 226-243. Springer-Verlag, 2002.
-
(2002)
LNCS
, vol.2469
, pp. 226-243
-
-
Niebert, P.1
Mahfoudh, M.2
Asarin, E.3
Bozga, M.4
Maler, O.5
Jain, N.6
-
20
-
-
21644477821
-
Minimum-time reachability for timed automata
-
July. IEEE Comp. Soc. Press
-
P. Niebert, S. Tripakis, and S. Yovine. Minimum-time reachability for Timed Automata. In Proc. of MED'00, July 2000. IEEE Comp. Soc. Press.
-
(2000)
Proc. of MED'00
-
-
Niebert, P.1
Tripakis, S.2
Yovine, S.3
-
21
-
-
0036600797
-
Bounded model checking for the universal fragment of CTL
-
June
-
W. Penczek, B. Woźna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51(1-2):135-156, June 2002.
-
(2002)
Fundamenta Informaticae
, vol.51
, Issue.1-2
, pp. 135-156
-
-
Penczek, W.1
Woźna, B.2
Zbrzezny, A.3
-
22
-
-
26844532040
-
-
Report 947, ICS PAS, Warsaw, September
-
W. Penczek, B. Woźna, and A. Zbrzezny. SAT-Based Bounded Model Checking for the Universal Fragment of TCTL. Report 947, ICS PAS, Warsaw, September 2002.
-
(2002)
SAT-based Bounded Model Checking for the Universal Fragment of TCTL
-
-
Penczek, W.1
Woźna, B.2
Zbrzezny, A.3
-
23
-
-
84974720053
-
Towards bounded model checking for the universal fragment of TCTL
-
Proc. of FTRTFT'02. Springer-Verlag
-
W. Penczek, B. Woźna, and A. Zbrzezny. Towards bounded model checking for the universal fragment of TCTL. In Proc. of FTRTFT'02, vol. 2469 of LNCS, pp. 265-288. Springer-Verlag, 2002.
-
(2002)
LNCS
, vol.2469
, pp. 265-288
-
-
Penczek, W.1
Woźna, B.2
Zbrzezny, A.3
-
24
-
-
18144384719
-
Integrating SAT solvers with math reasoners: Foundations and basic algorithms
-
ITC-IRST, Trento, Italy, November
-
R. Sebastiani. Integrating SAT solvers with math reasoners: Foundations and basic algorithms. Technical Report 0111-22, ITC-IRST, Trento, Italy, November 2001.
-
(2001)
Technical Report
, vol.111
, Issue.22
-
-
Sebastiani, R.1
-
25
-
-
70350787997
-
Checking safety properties using induction and a SAT-solver
-
Proc. of FMCAD'00. Springer-Verlag
-
M. Sheeran, S. Singh, and G. Stalmarck. Checking safety properties using induction and a SAT-solver. In Proc. of FMCAD'00, vol. 1954 of LNCS, pp. 108-125. Springer-Verlag, 2000.
-
(2000)
LNCS
, vol.1954
, pp. 108-125
-
-
Sheeran, M.1
Singh, S.2
Stalmarck, G.3
-
26
-
-
18944388655
-
Bounded model checking for timed automata
-
of ENTCS. Elsevier Science Publishers
-
Maria Sorea. Bounded model checking for timed automata. In Proc. of MTCS'02, vol. 68(5) of ENTCS. Elsevier Science Publishers, 2002.
-
(2002)
Proc. of MTCS'02
, vol.68
, Issue.5
-
-
Sorea, M.1
-
28
-
-
84948953283
-
Timed diagnostic for reachability properties
-
Proc. of TACAS'99. Springer-Verlag
-
S. Tripakis. Timed diagnostic for reachability properties. In Proc. of TACAS'99, vol. 1579 of LNCS, pp. 59-73. Springer-Verlag, 1999.
-
(1999)
LNCS
, vol.1579
, pp. 59-73
-
-
Tripakis, S.1
-
29
-
-
0035135204
-
Analysis of timed systems using time-abstracting bisimulations
-
S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(1):25-68, 2001.
-
(2001)
Formal Methods in System Design
, vol.18
, Issue.1
, pp. 25-68
-
-
Tripakis, S.1
Yovine, S.2
-
31
-
-
84958967825
-
Model checking timed automata
-
Embedded Systems. Springer-Verlag
-
S. Yovine. Model checking Timed Automata. In Embedded Systems, vol. 1494 of LNCS, pp. 114-152. Springer-Verlag, 1997.
-
(1997)
LNCS
, vol.1494
, pp. 114-152
-
-
Yovine, S.1
|