Minimal counterexamples in O(n log n) memory and O(n2) time

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2006, Pages 133-140

  Hansen, Henri ^a   Kervinen, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; SYSTEMS ANALYSIS;

(PL) PROPERTIES; (SEMI)AUTOMATA; BREADTH-FIRST SEARCH (BFS); COMPLEXITY RESULTS; EXPLICIT STATE MODEL CHECKING; GENERAL (CO); INTERNATIONAL CONFERENCES; MATHEMATICAL PROPERTIES; NEW ALGORITHM; NUMBER OF STATES; SYSTEM DESIGNS; TIME CONSUMPTION;

MODEL CHECKING;

EID: 45149127335     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2006.11     Document Type: Conference Paper

References (13)

1. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT Press, 1999. 314 p.
2. Edmund Clarke and Helmut Veith. Counterexamples revisited: Principles, algorithms, applications. In Nahum Dershowitz, editor, Verification: Theory and Practice: Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, number 2772 in LNCS, pages 208-224. Springer, 2004.
3. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288. Springer, 1992.
4. Jean-Michel Couvreur. On-the-fly verification of linear temporal logic. In J.M. Wing, J. Woodcock, and J. Davies, editors, M'99 - Formal Methods: World Congress on Formal Methods in the Development of Computing Systems, number 1708 in LNCS, page 253. Springer, September 1999.
5. Stefan Edelkamp, Stefan Leue, and Alberto LluchLafuente. Partial-order Reduction and Trail Improvement in Directed Model Checking, International Journal on Software Tools for Technology Transfer, 6(4):277-301, 2004.
6. th International SPIN workshop, number 2989 in LNCS, pages 92-108. Springer, 2004.
7. th International Conference, TACAS, number 2988 in LNCS, pages 205-219. Springer, 2004.
8. th International SPIN workshop, number 2648 in LNCS, pages 121 - 135, Springer, 2003.
9. th International Conference, TACAS, number 2280 in LNCS, pages 445-459. Springer, 2002.
10. th International SPIN workshop, number 2989 in LNCS. Springer, 2004.
11. th International Conference, TACAS 2005, number 3440 in LNCS, page 493. Springer, 2005.
12. Jianbin Tan, George S. Avrunin, Lori A. Clarke, Shlomo Zilberstein and Stefan Leue. Heuristic-Guided Counterexample Search in FLAVERS, ACM SIGSOFT Softw. Eng. Notes 29(6):201-210, 2004.
13. Gerard Tell. Introduction to Distributed Algorithms. Cambridge University Press, 2nd edition, 2000.