Witness and counterexample automata for ACTL

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

Volumn 3235, Issue , 2004, Pages 259-275

  Meolic, Robert ^a   Fantechi, Alessandro ^b   Gnesi, Stefania ^c  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b UNIVERSITY OF FLORENCE   (Italy)

^c ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ACTION-BASED MODELS; COMPUTATION TREE LOGIC; MODEL CHECKER; PROCESS ALGEBRAS; SINGLE COMPUTATION; TEST CASE GENERATION;

MODEL CHECKING;

EID: 35048856013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30232-2_17     Document Type: Article

References (15)

1. F. Buccafurri, T. Eiter, G. Gottlob, N. Leone. On ACTL formulas having linear counterexamples. Journal of computer and syst. sciences, 62(3), 2001, pp. 463515.
2. E. M. Clarke, O. Grumberg, D. E. Long. Model Checking and Abstraction ACM Transaction on Programming Languages and Systems, (16)5, 1994, pp. 1512-1542.
3. E. M. Clarke, E. A. Emerson, A. P. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications. ACM Transaction on Programming Languages and Systems, 8(2), (1986, pp. 244-263.
4. E. M. Clarke, S. Jha, Y. Lu, H. Veith. Tree-like Counterexamples in Model Checking. In 17th IEEE Symp. on Logic in Computer Science (LICS), 2002, pp. 19-29.
5. F. Copty, A. Irron, O. Weissberg, N. Kropp, G. Kamhi. Efficient Debugging in a Formal Verification Environment. In Conf, On Correct Hardware Design and Verification Methods (CHARME), LNCS 2144, 2001, pp. 275-292.
6. A. Casar, Z. Brezocnik, T. Kapus. Exploiting Symbolic Model Checking for Sensing Stuck-at Faults in Digital Circuits. Informacije MIDEM, 32(3), 2002, pp. 171-180.
7. A. Fantechi, S. Gnesi, A. Maggiore. Enhancing test coverage by back-tracing model-checker counterexamples. In Int. Workshop on Test and Analysis of Component Based Syst. (TACOS), 2004, to appear in Electronic Notes in Theoretical Computer Science.
8. D. Geist, M. Farkas, A. Landver, Y. Lichenstein, S. Ur, Y. Wolfsthal. CoverageDirected Test Generation Using Symbolic Techniques. In First Int. Conf. on Formal Method in Computer-Aided Design (FMCAD), LNCS 1166, (1996, pp. 143158.
9. M. Glusman, G. Kamhi, S. Mador-Heim, R. Fraer, M. Vardi. Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation. In Tools and Algorithms for the construction and analysis of syst. (TACAS), LNCS 2619, 2003, pp. 176-191.
10. A. Gurfinkel, M. Chechik. Proof-Like Counter-Examples. In Tools and Algorithms for the construction and analysis of syst. (TACAS), LNCS 2619, 2003, pp. 160175.
11. P.H. Ho, T. Shiple, K. Harer, J. Kukula, R. Damiano, V. Bertacco, J. Taylor, J. Long. Smart Simulation Using Collaborative Formal and Simulation Engines. In Int. Conf. on Computer Aided Design (ICCAD), 2000.
12. M. Maidl. The Common Fragment of CTL and LTL. In Proc. 41th Symp. on Foundations of Computer Science (FOCS), pp. 643-652, 2000.
13. R. De Nicola, F. W. Vaandrager. Actions versus State Based Logics for Transition Systems. Proc. Ecole de Printemps on Semantics of Concurrency, Lecture Notes in Computer Science, vol. 469, (1990, pp. 407-419.
14. G. Ratzaby, S. Ur, Y. Wolfsthal, Coverability Analysis Using Symbolic Model Checking. In Conf. On Correct Hardware Design and Verification Methods (CHARME), LNCS 2144, 2001.
15. G. Ratsaby, B. Sterin, S. Ur. Improvements in Coverabiliy Analysis. In Int. Symp. of Formal Methods Europe (FME), LNCS 2391, 2002.