-
1
-
-
33749024841
-
-
http://wwu.fi.muni.cz/~xpelanek/state_spaces.
-
-
-
-
2
-
-
35248862117
-
To store or not to store
-
Proc. Computer Aided Verification (CAV'03)
-
G. Behrmann, K.G. Larsen, and R. Pelánek. To store or not to store. In Proc. Computer Aided Verification (CAV'03), volume 2725 of LNCS, 2003.
-
(2003)
LNCS
, vol.2725
-
-
Behrmann, G.1
Larsen, K.G.2
Pelánek, R.3
-
3
-
-
84903134392
-
A Sweep-Line Method for State Space Exploration
-
Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS'01)
-
S. Christensen, L.M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS'01), 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
-
4
-
-
84894638887
-
Directed explicit model checking with HSF-SPIN
-
Proc. SPIN workshop
-
S. Edelkamp, A. L. Lafuente, and S. Leue. Directed explicit model checking with HSF-SPIN. In Proc. SPIN workshop, volume 2057 of LNCS, pages 57-79, 2001.
-
(2001)
LNCS
, vol.2057
, pp. 57-79
-
-
Edelkamp, S.1
Lafuente, A.L.2
Leue, S.3
-
5
-
-
35048849927
-
State caching reconsidered
-
SPIN Workshop
-
J. Geldenhuys. State caching reconsidered. In SPIN Workshop, volume 2989 of LNCS, pages 23-39, 2004.
-
(2004)
LNCS
, vol.2989
, pp. 23-39
-
-
Geldenhuys, J.1
-
6
-
-
84976767702
-
State space caching revisited
-
Proc. of Computer Aided Verification (CAV 1992)
-
P. Godefroid, G.J. Holzmann, and D. Pirottin. State space caching revisited. In Proc. of Computer Aided Verification (CAV 1992), volume 663 of LNVS, pages 178-191, 1992.
-
(1992)
LNVS
, vol.663
, pp. 178-191
-
-
Godefroid, P.1
Holzmann, G.J.2
Pirottin, D.3
-
7
-
-
84888223846
-
Exploring very large state spaces using genetic algorithms
-
Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2002)
-
P. Godefroid and S. Khurshid. Exploring very large state spaces using genetic algorithms. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2002), volume 2280 of LNCS, pages 266-280, 2002.
-
(2002)
LNCS
, vol.2280
, pp. 266-280
-
-
Godefroid, P.1
Khurshid, S.2
-
9
-
-
24644470653
-
Monte carlo model checking
-
Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2005), Springer
-
R. Grosu and S. A. Smolka. Monte carlo model checking. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2005), volume 3440 of LNCS, pages 271-286. Springer, 2005.
-
(2005)
LNCS
, vol.3440
, pp. 271-286
-
-
Grosu, R.1
Smolka, S.A.2
-
12
-
-
0025207743
-
Algorithms for automated protocol verification
-
February
-
G.J. Holzmann. Algorithms for automated protocol verification. AT&T Technical Journal, 69(2):32-44, February 1990.
-
(1990)
AT&T Technical Journal
, vol.69
, Issue.2
, pp. 32-44
-
-
Holzmann, G.J.1
-
13
-
-
13844316527
-
Parallel random walk search for LTL violations
-
Proc. of Parallel and Distributed Model Checking (PDMC 2002)
-
M.D. Jones and J.Sorber. Parallel random walk search for LTL violations. In Proc. of Parallel and Distributed Model Checking (PDMC 2002), volume 68 of ENTCS, pages 156-161, 2002.
-
(2002)
ENTCS
, vol.68
, pp. 156-161
-
-
Jones, M.D.1
Sorber, J.2
-
15
-
-
85006568223
-
Protocol verification using reachability analysis: The state space explosion problem and relief strategies
-
F. Lin, P. Chu, and M. Liu. Protocol verification using reachability analysis: the state space explosion problem and relief strategies. Computer Communication Review, 17(5): 126-134, 1987.
-
(1987)
Computer Communication Review
, vol.17
, Issue.5
, pp. 126-134
-
-
Lin, F.1
Chu, P.2
Liu, M.3
-
16
-
-
33749229744
-
On the random walk method for protocol testing
-
Proc. Computer-Aided Verification (CAV 1994)
-
M. Mihail and C. H. Papadimitriou. On the random walk method for protocol testing. In Proc. Computer-Aided Verification (CAV 1994), volume 818 of LNCS, pages 132-141, 1994.
-
(1994)
LNCS
, vol.818
, pp. 132-141
-
-
Mihail, M.1
Papadimitriou, C.H.2
-
18
-
-
84954431068
-
On the advantages of approximate vs. complete verification: Bigger models, faster, less memory, usually accurate
-
IEEE
-
D. Owen, T. Menzies, M. Heimdahl, and J. Gao. On the advantages of approximate vs. complete verification: Bigger models, faster, less memory, usually accurate. In Proc. of IEEE/NASA Software Engineering Workshop (SEW'03), pages 75-81. IEEE, 2003.
-
(2003)
Proc. of IEEE/NASA Software Engineering Workshop (SEW'03)
, pp. 75-81
-
-
Owen, D.1
Menzies, T.2
Heimdahl, M.3
Gao, J.4
-
19
-
-
35048896472
-
Typical structural properties of state spaces
-
Proc. of SPIN Workshop
-
R. Pelánek. Typical structural properties of state spaces. In Proc. of SPIN Workshop, volume 2989 of LNCS, pages 5-22, 2004.
-
(2004)
LNCS
, vol.2989
, pp. 5-22
-
-
Pelánek, R.1
-
21
-
-
18944398809
-
Random walk based heuristic algorithms for distributed memory model checking
-
Proc. of Parallel and Distributed Model Checking (PDMC'OS)
-
H. Sivaraj and G. Gopalakrishnan. Random walk based heuristic algorithms for distributed memory model checking. In Proc. of Parallel and Distributed Model Checking (PDMC'OS), volume 89 of ENTCS, 2003.
-
(2003)
ENTCS
, vol.89
-
-
Sivaraj, H.1
Gopalakrishnan, G.2
-
23
-
-
33749014236
-
Exploiting transition locality in automatic verification
-
E. Tronci, G. D. Penna, B. Intriglia, and M. V. Zilli. Exploiting transition locality in automatic verification. In Proc. of Correct Hardware Design and Verification Methods (CHARME 2001), volume 2144, pages 259-274, 2001.
-
(2001)
Proc. of Correct Hardware Design and Verification Methods (CHARME 2001)
, vol.2144
, pp. 259-274
-
-
Tronci, E.1
Penna, G.D.2
Intriglia, B.3
Zilli, M.V.4
|