Minimal counterexample generation for SPIN

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4595 LNCS, Issue , 2007, Pages 24-38

  Gastin, Paul ^a   Moro, Pierre ^b  

^a CNRS   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; SEARCH ENGINES; STORAGE ALLOCATION (COMPUTER);

MINIMAL COUNTEREXAMPLE GENERATION; SEARCHES GUIDED;

COMPUTATION THEORY;

EID: 38149045643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73370-6_4     Document Type: Conference Paper

References (12)

1. Couvreur, J.M.: On-the-fly verification of linear temporal logic. In: FM 1999. LNCS, vol. 1708, pp. 253-271. Springer, Berlin Heidelberg New York (1999)
2. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education (2001)
3. Clarke, E.M., Veith, H.: Counterexamples revisited: Principles, algorithms, applications. In: Verification: Theory and Practice. LNCS, vol. 2772, pp. 208-224. Springer, Heidelberg (2003)
4. Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-efficient algorithms for the verification of temporal properties. Formal Methods in System Design 1(2/3), 275-288 (1992)
5. Gastin, P., Moro, P., Zeitoun, M.: Minimization of counterexample in SPIN. In: Proc. of SPIN'04. LNCS, vol. 2989, pp. 92-108. Springer, Berlin Heidelberg New York (2004)
6. 2) time. In: Proc. of ACDC'06, pp. 133-142. IEEE Computer Society Press, Los Alamitos, CA, USA (2006)
7. Holzmann, G.: An analysis of bitstate hashing. Formal Methods in System Design, 13(3), pp. 287-305, extended and revised version of Proc. PSTV95, pp. 301-314 (1998)
8. Holzmann, G., Peled, D., Yannakakis, M.: On nested depth first search. In: Proc. of SPIN'96. American Mathematical Society (1996)
9. Schuppan, V., Biere, A.: Shortest counterexamples for symbolic model checking of LTL with past. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 493-509. Springer, Heidelberg (2005)
10. Schwoon, S., Esparza, J.: A note on on-the-fly verification algorithms. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 174-190. Springer, Heidelberg (2005)
11. Valmari, A., Geldenhuys, J.: Tarjan's algorithm makes on-the-fly LTL verification more efficient. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 205-219. Springer, Heidelberg (2004)
12. Wolper, P., Leroy, D.: Reliable hashing without collusion detection. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 59-70. Springer, Heidelberg (1993)