Model checking and preprocessing

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

Volumn 4733 LNAI, Issue , 2007, Pages 48-59

  Ferrara, Andrea ^a   Liberatore, Paolo ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Compilability; Complexity; Model checking

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; MATHEMATICAL MODELS; POLYNOMIALS; VERIFICATION;

PREPROCESSED MODELS; TEMPORAL LOGIC FORMULA; TEMPORAL LOGIC MODEL CHECKING;

TEMPORAL LOGIC;

EID: 38049169132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74782-6_6     Document Type: Conference Paper

References (25)

1. Beer, I., Ben David, S., Geist, D., Gewirtzman, R., Yoeli, M.: Methodology and system for pratical formal verification of reactive hardware. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 182-193. Springer, Heidelberg (1994)
2. Beer, I., Ben David, S., Landver, A.: On the fly model checking for rctl formulas. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 184-194. Springer, Heidelberg (1998)
3. Brayton, R.K., Hachtel, G.D., Vincetelli, A.S., Somenzi, F., Aziz, A., Cheng, S.T., Edwards, S., Khatri, S., Kukimoto, T., Pardo, A., Qadeer, S., Ranjan, R.K., Sarwary, S., Shiple, T.R., Swamy, G., Villa, T.: VIS: a system for verification and syntesis. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 428-432. Springer, Heidelberg (1996)
4. Bylander, T.: Complexity results for planning. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence. LNCS, pp. 274-279. Morgan Kaufmann, San Mateo, CA (1991)
5. Cadoli, M., Donini, F.M., Liberators, P., Schaerf, M.: Space efficency of propositional knowledge representation formalisms. Journal of Artificial Intelligence Research 13, 25-64 (1999)
6. Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.: The size of a revised knowledge base. Artificial Intelligence 115, 1-31 (2000)
7. Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.: Preprocessing of intractable problems. Information and Computation 176, 89-120 (2002)
8. Cavada, R., Cimatti, A., Jochim, C.A., Keighren, G., Olivetti, E., Pistore, M., Roveri, M., Tchaltsev, A.: NuSMV 2.4 User's Manual. IRST (2005), http://nusmv.irst.itc.it
9. Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An opensource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, Springer, Heidelberg (2002)
10. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)
11. Fikes, R., Nilson, N.: Strips: a new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189-209 (1971)
12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, Ca (1979)
13. Goldblatt, R.: Logics of Time and Computation. CSLI Lecture Notes, vol. 7. Center for the Study of Language and Information, Stanford, CA (1987)
14. Hardin, R.H., Har'el, Z., Kurshan, R.P.: Cospan. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 423-427. Springer, Heidelberg (1996)
15. Holzmann, G.J.: The model checker spin. IEEE Transactions on Software Engineering 23(5), 279-295 (1997)
16. IBM Haifa, RuleBase User's Manual (2006), http://www.haifa.ibm.com/ projects/verification/Formal.Methods-Home/index.html
17. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata theoretic approach to branching-time model checking. Journal of ACM 47(2), 312-360 (2000)
18. Liberatore, P.: Monotonic reductions, representative equivalence, and compilation of intractable problems. Journal of ACM 48(6), 1091-1125 (2001)
19. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems - Safety. Springer, Heidelberg (1995)
20. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA (1993)
21. Pnueli, A.: The temporal logic of programs. In: FOCS'77. Proceeding of the 18th IEEE Symposium on Foundations of Computer Science, pp. 46-57. IEEE Computer Society Press, Los Alamitos (1977)
22. Schnoebelen, Ph.: The complexity of temporal logic model checking. In: AiML'02. Proceedings of the 4th Internationa Workshop in Advances in Modal Logic, vol. 4, pp. 1-44. World Scientific Publishing, San Mateo, CA (2002)
23. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. Journal of ACM 32(3), 733-749 (1985)
24. Stockmeyer, L.J.: The polynomial-time hierarchy. Theoretical Computer Science 3, 1-22 (1976)
25. Villa, T., Swarny, G., Shiple, T.: VIS User's Manual. VIS Group (2004), http://visi.colorado.edu/~vis/