Model checking quantified computation tree logic

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

Volumn 4137 LNCS, Issue , 2006, Pages 110-125

  Rensink, Arend ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; COMPUTATION THEORY; MATHEMATICAL OPERATORS; SEMANTICS; TREES (MATHEMATICS);

AUTOMATA MODULO BISIMILARITY; QUANTIFIED COMPUTATION TREE LOGIC (QCTL); SYMMETRY REDUCTION; TEMPORAL LOGICS;

FORMAL LOGIC;

EID: 33749580741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_8     Document Type: Conference Paper

References (21)

1. P. Baldan, A. Corradini, B. König, and A. LLuch Lafuente. A temporal graph logic for abstractions of graph rewrite systems. Draft, 2005.
2. D. A. Basin, S. Matthews, and L. Vigano. Labelled modal logics: Quantifiers. Journal of Logic, Language and Information, 7(3):237-263, 1998.
3. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on words with data. Research Report 2005-004, LIAFA - Laboratoire d'Informatique Algorithmique: Fondements et Applications, 2005.
4. C. Castellini and A. Smaill. A modular, tactic-based approach for first-order temporal theorem proving. In International Conference on Temporal Logic (ICTL), 2000.
5. C. Castellini and A. Smaill. Proof planning for first-order temporal logic. In Nieuwenhuis, ed., 20th International Conference on Automated Deduction (CADE), vol. 3632 of LNCS, pp. 235-249. Springer, 2005.
6. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of the IBM Workshop on Logics of Programs, vol. 131 of LNCS, pp. 52-71. Springer, 1982.
7. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In Symposium on Principles of Programming Languages (POPL), pp. 117-126. ACM Press, 1983.
8. J. C. Corbett, M. B. Dwyer, J. Hatcliff, and Robby. Expressing checkable properties of dynamic systems: the bandera specification language. International Journal on Software Tools for Technology, 4(1):34-56, 2002.
9. M. Dam. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Comput. Sci., 126(1):77-96, 1994.
10. D. Distefano, J.-P. Katoen, and A. Rensink. Who is pointing when to whom? on the automated verification of linked list structures. In K. Lodaya and M. Mahajan, eds., Foundations of Software Technology and Theoretical Computer Science (FSTTCS), vol. 3328 of LNCS, pp. 250-262. Springer-Verlag, 2004.
11. D. Distefano, A. Rensink, and J.-P. Katoen. Model checking birth and death. In Baeza-Yates, Montanari, and Santoro, eds., Foundations of Information Technology in the Era of Network and Mobile Computing, vol. 223 of IFIP Conference Proceedings, pp. 435-447. Kluwer Academic Publishers, 2002.
12. M. Fitting. Bertrand Russell, Herbrand's theorem, and the assignment statement. In Calmet and Plaza, eds., Artificial Intelligence and Symbolic Computation (AISC), vol. 1476 of LNAI, 1998.
13. M. Fitting. On quantified modal logic. Fundamenta Informaticae, 39(1):5-121, 1999.
14. J. W. Garson. Quantification in modal logic. In Guenthner and Gabbay, eds., Handbook of Philosophical Logic, Vol. 3, pp. 267-323. Kluwer, 2 edition, 2001.
15. G. J. Holtzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.
16. U. Montanari and M. Pistore. History-dependent automata. Technical Report TR-11-98, Department of Computer Science, University of Pisa, 1998.
17. U. Montanari and M. Pistore. History-dependent automata: An introduction. In Bernardo and Bogliolo, eds., Formal Methods for Mobile Computing, 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems (SFM), vol. 3465 of LNCS, pp. 1-28. Springer, 2005.
18. F. Neven, T. Schwentick, and V. Vianu. Towards regular languages over infinite alphabets. In Sgall, Pultr, and Kolman, eds., Mathematical Foundations of Computer Science (MFCS), vol. 2136 of LNCS, pp. 560-572. Springer, 2001.
19. A. Rensink. Towards model checking graph grammars. In Leuschel, Gruner, and Presti, eds., Workshop on Automated Verification of Critical Systems (AVoCS), Technical Report DSSE-TR-2003-2, pp. 150-160. University of Southampton, 2003.
20. A. Rensink. The GROOVE simulator: A tool for state space generation. In Pfalz, Nagl, and Böhlen, eds., Applications of Graph Transformations with Industrial Relevance (ACTIVE), vol. 3062 of LNCS, pp. 479-485. Springer-Verlag, 2004.
21. E. Yahav, T. Reps, M. Sagiv, and R. Wilhelm. Verifying temporal heap properties specified via evolution logic. In Degano, ed., Programming Languages and Systems: 12th European Symposium on Programming (ESOP), vol. 2618 of LNCS, pp. 204-222. Springer, 2003.