Enhancing model checking in verification by AI techniques

Artificial Intelligence

Volumn 112, Issue 1, 1999, Pages 57-104

  Buccafurri, Francesco ^a   Eiter, Thomas ^b   Gottlob, Georg ^b   Leone, Nicola ^b  

^a UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; FORMAL LOGIC; MATHEMATICAL MODELS; OPTIMIZATION; THEOREM PROVING;

ABDUCTIVE THEORY REVISION; MODEL CHECKING;

ARTIFICIAL INTELLIGENCE;

EID: 0033170365     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00039-9     Document Type: Article

References (47)

1. L.C. Aiello, D. Nardi, Perspectives in knowledge representation, Appl. Artificial Intelligence 5 (1) (1991) 29-44.
2. M. Ben-Ari, Z. Manna, A. Pnueli, The temporal logic of branching time, Acta Informatica 20 (1983) 207-226.
3. G. Brewka, K. Konolige, An abductive framework for generalized logic programs and other nonmonotonic systems, in: Proc. IJCAI-93, Chambéry, France, 1993, pp. 9-17.
4. G. Brewka, J. Dix, K. Konolige, Nonmonotonic Reasoning - An Overview, Chapter 5: Abduction, CSLI Lecture Notes 73, CSLI Publications, Stanford University, 1997, pp. 65-86.
5. C. Boutilier, V. Becher, Abduction as belief revision, Artificial Intelligence 77 (1997) 43-94.
6. M.C. Browne, E.M. Clarke, D. Dill, Checking the correctness of sequential circuits, in: Proc. 1985 International Conference on Computer Design, Port Chester, New York, 1985.
7. F. Buccafurri, T. Eiter, G. Gottlob, and N. Leone. On ACTL formulas having deterministic counterexamples. Journal of Computer and System Sciences, 2001, 62, 3, p: 463-515, DOI: 10.1006/jcss.2000.1734.
8. 120states and beyond, Inform, and Comput. 98 (2) (1992) 142-170.
9. E.M. Clarke, E.A. Emerson, Synthesis of synchronization skeletons for branching time temporal logic, in: Logic of Programs: Workshop, Yorktown Heights, NY, Lecture Notes in Computer Science, Vol. 131, Sponger, Berlin, 1981.
10. E.M. Clarke, E.A. Emerson, A.P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Trans. Programming Languages and Systems 8 (2) (1986) 244-263.
11. E.M. Clarke, O. Grumberg, D.E. Long, Verification tools for finite-state concurrent systems, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), A Decade of Concurrency - Reflections and Perspectives, Lecture Notes in Computer Science, Vol. 803, Springer, Berlin, 1994, pp. 124-175.
12. E.M. Clarke, O. Grumberg, D.E. Long, Model checking, in: M. Broy (Ed.), Deductive Program Design, Proc. NATO ASI Series F, Vol. 152, Springer, Berlin, 1996.
13. E.M. Clarke, O. Grumberg, D.E. Long, Model checking and abstraction, ACM Trans. Programming Languages and Systems 16 (5) (1994) 1512-1542.
14. E.M. Clarke, O. Grumberg, K. McMillan, X. Zhao, Efficient generation of counterexamples and witnesses in symbolic model checking, in: Proc. 32nd ACM/SIGDA Design Automation Conference (DAC-95), ACM Press, New York, 1995. Also: Technical Report CMU-CS-94-204, Carnegie Mellon University, Pittsburgh, PA, 1994.
15. L. Console, D. Theseider Dupré, G. Friedrich, Model-based diagnosis meets error diagnosis in logic programs, in: Proc. IJCAI-93, Chambéry, France, 1993, pp. 1494-1499.
16. L. Console, D. Theseider Dupré, P. Torasso, On the relationship between abduction and deduction, J. Logic Comput. 1 (5) (1991) 661-690.
17. O. Coudert, C. Berthet, J.C. Madre, Verification of synchronous sequential machines, based on symbolic execution, in: Proc. 1989 International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, Lecture Notes in Computer Science, Vol. 407, Springer, Berlin, 1989.
18. T. Eiter, G. Gottlob, The complexity of logic-based abduction, J. ACM 42 (1) (1995) 3-42.
19. T. Eiter, G. Gottlob, N. Leone, Semantics and complexity for abduction from default theories, Artificial Intelligence 90 (1997) 177-222.
20. E.A. Emerson, Temporal and modal logics, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Chapter 16, Elsevier, Amsterdam, 1990, pp. 995-1072.
21. E.A. Emerson, J.Y Halpern, "sometimes" and "not never" revisited: On branching versus linear time temporal logic, J. ACM 33 (1) (1986) 151-178.
22. E.A. Emerson, E.M. Clarke, Using branching-time logic to synthesize synchronization skeletons, Sci. Comput. Programming 2 (1982) 241-266.
23. G. Friedrich, G. Gottlob, W. Nejdl, Hypothesis classification, abductive diagnosis, and therapy, in: G. Gottlob, W. Nejdl (Eds.), Proc. International Workshop on Expert Systems in Engineering, Lecture Notes in Artificial Intelligence, Vol. 462, Springer, Berlin, 1990, pp. 69-78.
24. G. Friedrich, G. Gottlob, W. Nejdl, Formalizing the repair process - Extended report, Ann. Math. Artificial Intelligence 11 (1994) 187-201.
25. P. Gärdenfors, Knowledge in Flux, Bradford Books/MIT Press, Cambridge, MA, 1988.
26. O. Grumberg, D.E. Long, Model checking and modular verification, ACM Trans. Programming Languages and Systems 16 (3) (1994) 843-87 1.
27. W. Hamscher, (Ed.), Readings in Model-Based Diagnosis, Morgan Kaufmann, San Mateo, CA, 1992.
28. N. Immerman, M. Vardi, Model checking and transitive-closure logic, in: Proc. Computer Aided Verification (CAV-97), 1997, pp. 291-302.
29. K. Inoue, Ch. Sakama, Abductive framework for nonmonotonic theory change, in: Proc. IJCAI-95, Montreal, Quebec, 1995, pp. 204-210.
30. H. Katsuno, A.O. Mendelzon, Propositional knowledge base revision and minimal change, Artificial Intelligence 52 (1991) 253-294.
31. K. Konolige, Abduction versus closure in causal theories, Artificial Intelligence 53 (1992) 255-272.
32. O. Kupferman, O. Grumberg, Buy one, get one free!!, J. Logic Comput. 6 (4) (1996) 523-539.
33. J. Lobo, C. Uzcátegui, Abductive change operators, Fundamenta Informaticae 27 (1996) 385-412.
34. J. Lobo, C. Uzcátegui, Abductive consequence relations, Artificial Intelligence 89 (1-2) (1997) 149-171.
35. D.E. Long, Model Checking, Abstraction and Compositional Reasoning, Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA, 1993.
36. K.L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem, Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA, 1992.
37. B. Misra, E.M. Clarke, Hierarchical verification of asynchronous circuits using temporal logic, Theoret. Comput. Sci. 38 (1985) 269-291.
38. G. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115-116.
39. A. Pnueli, The temporal semantics of concurrent programs, Theoret. Comput. Sci. 13 (1981) 45-60.
40. D. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1988) 27-47.
41. G.M. Provan, D. Poole, The utility of consistency-based diagnostic techniques, in: Proc. Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-91), Morgan Kaufmann, San Mateo, CA, 1991, pp. 461-472.
42. R. Reiter, A theory of diagnosis from first principles, Artificial Intelligence 32 (1987) 57-95.
43. B. Selman, HJ. Levesque, Support set selection for abductive and default reasoning, Artificial Intelligence 82 (1996) 259-272.
44. A.P. Sistla, E.M. Clarke, The complexity of propositional linear temporal logics, J. ACM 32 (3) (1985) 733-749.
45. M. Stumptner, F. Wotawa, Model-based program debugging and repair, in: Proc. 9th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-96), Fukuoka, Japan, 1996, pp. 155-160.
46. M. Stumptner, F. Wotawa, A model-based approach to software debugging, in: S. Abu-Hakima (Ed.), Proc. 7th International Workshop on the Principles of Diagnosis (DX-96), Val Morin, Quebec, 1996, pp. 214-223.
47. M.Y. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification, in: Proc. 1st Annual Symposium on Logic in Computer Science (LICS-86), IEEE Computer Society Press, 1986, pp. 332-344.