-
1
-
-
35048868166
-
-
[://wuw.fi.muni.cz/~xpelanek/state_spaces.
-
-
-
-
3
-
-
85083132922
-
Parallel breadth-first search LTL model-checking
-
IEEE Computer Society
-
J. Barnat, L. Brim, and J. Chaloupka. Parallel breadth-first search LTL model-checking. In Proc. Automated Software Engineering (ASE 2003), pages 106-115. IEEE Computer Society, 2003.
-
(2003)
Proc. Automated Software Engineering ASE
, vol.2003
, pp. 106-115
-
-
Barnat, J.1
Brim, L.2
Chaloupka, J.3
-
4
-
-
35248862117
-
To store or not to store
-
G. Behrmann, K.G. Larsen, and R. Pelánek. To store or not to store. In Proc. Computer Aided Verification (CAV 2003), volume 2725 of LNCS, pages 433-445, 2003.
-
(2003)
Proc. Computer Aided Verification (CAV 2003)
, vol.2725
, pp. 433-445
-
-
Behrmann, G.1
Larsen, K.G.2
Pelánek, R.3
-
5
-
-
84944319371
-
Symbolic model checking without BDDs
-
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 1999), volume 1579 of LNCS, pages 193-207, 1999.
-
(1999)
Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 1999)
, vol.1579
, pp. 193-207
-
-
Biere, A.1
Cimatti, A.2
Clarke, E.3
Zhu, Y.4
-
6
-
-
33745787583
-
Distributed explicit fair cycle detection
-
I. Černá and R. Pelánek. Distributed explicit fair cycle detection. In Proc. SPIN workshop, volume 2648 of LNCS, pages 49-73, 2003.
-
(2003)
Proc. SPIN workshop
, vol.2648
, pp. 49-73
-
-
Černá, I.1
Pelánek, R.2
-
8
-
-
84903134392
-
A Sweep-Line Method for State Space Exploration
-
Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001)
-
S. Christensen, L.M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001), volume 2031 of LNCS, pages 450-464, 2001.
-
(2001)
LNCS
, vol.2031
, pp. 450-464
-
-
Christensen, S.1
Kristensen, L.M.2
Mailund, T.3
-
9
-
-
35248844099
-
Unification & sharing in timed automata verification
-
A. David, G. Behrmann, K. G. Larsen, and W. Yi. Unification & sharing in timed automata verification. In Proc. SPIN Workshop, volume 2648 of LNCS, pages 225-229, 2003.
-
(2003)
Proc. SPIN Workshop
, vol.2648
, pp. 225-229
-
-
David, A.1
Behrmann, G.2
Larsen, K.G.3
Yi, W.4
-
10
-
-
0001801746
-
Protocol verification as a hardware design aid. in
-
IEEE Computer Society
-
D. L. Dill, A. J. Drexler, A. J. Hu, and C. Han Yang. Protocol verification as a hardware design aid. In Proc. Computer Design: VLSI in Computers and Processors, pages 522-525. IEEE Computer Society, 1992.
-
(1992)
Proc. Computer Design: VLSI in Computers and Processors
, pp. 522-525
-
-
Dill, D.L.1
Drexler, A.J.2
Hu, A.J.3
Han Yang, C.4
-
11
-
-
0001540595
-
On random graphs
-
P. Erdos and A. Renyi. On random graphs. Publ. Math., 6:290-297, 1959.
-
(1959)
Publ. Math.
, vol.6
, pp. 290-297
-
-
Erdos, P.1
Renyi, A.2
-
12
-
-
84903186573
-
Is there a best symbolic cycle-detection algorithm?
-
Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001)
-
K. Fisler, R. Fraer, G. Kamhi Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001), volume 2031 of LNCS, pages 420-434, 2001.
-
(2001)
LNCS
, vol.2031
, pp. 420-434
-
-
Fisler, K.1
Fraer, R.2
Kamhi, G.3
Vardi, Y.4
Yang, Z.5
-
15
-
-
0029408815
-
State space caching revisited
-
P. Godefroid, G.J. Holzmann, and D. Pirottin. State space caching revisited. Formal Methods in System Design, 7(3):227-241, 1995.
-
(1995)
Formal Methods in System Design
, vol.7
, Issue.3
, pp. 227-241
-
-
Godefroid, P.1
Holzmann, G.J.2
Pirottin, D.3
-
16
-
-
0001879305
-
The syntax and semantics of μCRL
-
Workshops in Computing Series
-
J.F. Groote and A. Ponse. The syntax and semantics of μCRL. In Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26-62, 1995.
-
(1995)
Algebra of Communicating Processes '94
, pp. 26-62
-
-
Groote, J.F.1
Ponse, A.2
-
17
-
-
35248852442
-
Large state space visualization
-
Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2003)
-
J.F. Groote and F. van Ham. Large state space visualization. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2003), volume 2619 of LNCS, pages 585-590, 2003.
-
(2003)
LNCS
, vol.2619
, pp. 585-590
-
-
Groote, J.F.1
Van Ham, F.2
-
18
-
-
6344262665
-
An analysis of bitstate hashing
-
G. J. Holzmann. An analysis of bitstate hashing. In Proc. Protocol Specification, Testing, and Verification, INWG/IFIP, pages 301-314, 1995.
-
(1995)
Proc. Protocol Specification, Testing, and Verification, INWG/IFIP
, pp. 301-314
-
-
Holzmann, G.J.1
-
19
-
-
35048889330
-
State compression in SPIN: Recursive indexing and compression training runs
-
Twente Univ.
-
G. J. Holzmann. State compression in SPIN: Recursive indexing and compression training runs. In Proc. SPIN Workshop. Twente Univ., 1997.
-
(1997)
Proc. SPIN Workshop
-
-
Holzmann, G.J.1
-
20
-
-
0025207743
-
Algorithms for automated protocol verification
-
G.J. Holzmann. Algorithms for automated protocol verification. AT&T Technical Journal, 69(2):32-44, 1990.
-
(1990)
AT&T Technical Journal
, vol.69
, Issue.2
, pp. 32-44
-
-
Holzmann, G.J.1
-
21
-
-
84948144846
-
The engineering of a model checker: The gnu i-protocol case study revisited
-
Proc. SPIN Workshop
-
G.J. Holzmann. The engineering of a model checker: the gnu i-protocol case study revisited. In Proc. SPIN Workshop, volume 1680 of LNCS, pages 232-244, 1999.
-
(1999)
LNCS
, vol.1680
, pp. 232-244
-
-
Holzmann, G.J.1
-
23
-
-
16244409154
-
Simplified distributed LTL model checking by localizing cycles
-
Institut für Informatik, Universität Freiburg, July
-
A. L. Lafuente. Simplified distributed LTL model checking by localizing cycles. Technical Report 176, Institut für Informatik, Universität Freiburg, July 2002.
-
(2002)
Technical Report
, vol.176
-
-
Lafuente, A.L.1
-
24
-
-
35048881296
-
Exploiting transition locality in the disk based Murphi verifier
-
G. D. Penna, B. Intrigua, E. Tronci, and M. V. Zilli. Exploiting transition locality in the disk based Murphi verifier. In Proc. Formal Methods in Computer-Aided Design (FMCAD 2002), volume 2517 of LNCS, pages 202-219, 2002.
-
(2002)
Proc. Formal Methods in Computer-Aided Design (FMCAD 2002)
, vol.2517
, pp. 202-219
-
-
Penna, G.D.1
Intrigua, B.2
Tronci, E.3
Zilli, M.V.4
-
25
-
-
84947265856
-
A comparative study of symbolic algorithms for the computation of fair cycles
-
Proc. Formal Methods in Computer-Aided Design (FMCAD 2000)
-
K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In Proc. Formal Methods in Computer-Aided Design (FMCAD 2000), volume 1954 of LNCS, pages 143-160, 2000.
-
(2000)
LNCS
, vol.1954
, pp. 143-160
-
-
Ravi, K.1
Bloem, R.2
Somenzi, F.3
-
26
-
-
84947288420
-
Low-fat recipes for SPIN
-
Theo C. Ruys. Low-fat recipes for SPIN. In Proc. SPIN Workshop, volume 1885 of LNCS, pages 287-321, 2000.
-
(2000)
Proc. SPIN Workshop
, vol.1885
, pp. 287-321
-
-
Ruys, T.C.1
-
27
-
-
35048853824
-
Analysis of symbolic SCC hull algorithms
-
F. Somenzi, K. Ravi, and R. Bloem. Analysis of symbolic SCC hull algorithms. In Proc. Formal Methods in Computer-Aided Design (FMCAD 2002), volume 2517 of LNCS, pages 88-105, 2002.
-
(2002)
Proc. Formal Methods in Computer-Aided Design (FMCAD 2002)
, vol.2517
, pp. 88-105
-
-
Somenzi, F.1
Ravi, K.2
Bloem, R.3
-
29
-
-
84863899988
-
Using magnatic disk instead of main memory in the Murphi verifier
-
Proc. Computer Aided Verification (CAV 1998)
-
U. Stern and D. L. Dill. Using magnatic disk instead of main memory in the Murphi verifier. In Proc. Computer Aided Verification (CAV 1998), volume 1427 of LNCS, pages 172-183, 1998.
-
(1998)
LNCS
, vol.1427
, pp. 172-183
-
-
Stern, U.1
Dill, D.L.2
-
30
-
-
0035690292
-
A probabilistic approach to automatic verification of concurrent systems
-
IEEE Computer Society
-
E. Tronci, G. D. Penna, B. Intrigua, and M. Venturini. A probabilistic approach to automatic verification of concurrent systems. In Proc. Asia-Pacific Software Engineering Conference (APSEC 2001), pages 317-324. IEEE Computer Society, 2001.
-
(2001)
Proc. Asia-Pacific Software Engineering Conference (APSEC 2001)
, pp. 317-324
-
-
Tronci, E.1
Penna, G.D.2
Intrigua, B.3
Venturini, M.4
-
31
-
-
33749014236
-
Exploiting transition locality in automatic verification
-
E. Tronci, G. D. Penna, B. Intrigila, and M. V. Zilli. Exploiting transition locality in automatic verification. In Proc. Correct Hardware Design and Verification Methods (CHARME 2001), volume 2144, pages 259-274, 2001.
-
(2001)
Proc. Correct Hardware Design and Verification Methods (CHARME 2001)
, vol.2144
, pp. 259-274
-
-
Tronci, E.1
Penna, G.D.2
Intrigila, B.3
Zilli, M.V.4
|