A syntactic characterization of distributive LTL queries

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

Volumn 3142, Issue , 2004, Pages 1099-1110

  Samer, Marko ^a   Veith, Helmut ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; CONTEXT FREE GRAMMARS; MODEL CHECKING; SPECIFICATIONS; SYNTACTICS;

MODEL CHECKER; PROOF METHODS; SOLVING ALGORITHM; SYNTACTIC CHARACTERIZATION;

TEMPORAL LOGIC;

EID: 35048876292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_91     Document Type: Article

References (16)

1. Glenn Bruns and Patrice Godefroid. Temporal logic query checking. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 409-417. IEEE Computer Society Press, 2001.
2. Francesco Buccafurri, Thomas Eiter, Georg Gottlob, and Nicola Leone. On ACTL formulas having linear counterexamples. Journal of Computer and System Sciences, 62(3):463-515, 2001.
3. William Chan. Temporal-logic queries. In Proceedings of the 12th international Conference on Computer Aided Verification (CAV), volume 1855 of Lecture Notes in Computer Science, pages 450-463. Springer-Verlag, 2000.
4. Marsha Chechik and Arie Gurfinkel. TLQSolver: A temporal logic query checker. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV), volume 2725 of Lecture Notes in Computer Science, pages 210-214. Springer-Verlag, 2003.
5. Edmund M. Clarke and E. Allen Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of the Workshop on Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
6. Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV), volume 1855 of Lecture Notes in Computer Science, pages 154-169. Springer-Verlag, 2000. Extended version available as [7].
7. Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM, 50(5):752-794, 2003.
8. Edmund M. Clarke, Orna Grumberg, and David E Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(5):1521-1542, 1994.
9. Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. Model Checking. MIT Press, 1999.
10. E Allen Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, pages 995-1067. Elsevier, 1990.
11. Arie Gurfinkel, Marsha Chechik, and Benet Devereux. Temporal logic query checking: A tool for model exploration. IEEE Transactions on Software Engineering, 29(10):898-914, 2003.
12. Arie Gurfinkel, Benet Devereux, and Marsha Chechik. Model exploration with temporal logic query checking. In Proceedings of the 10th ACMSlGSOFT Symposium on Foundations of Software Engineering (FSE), pages 139-148. ACM Press, 2002.
13. Samuel Homus and Philippe Schnoebelen. On solving temporal logic queries. In Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology (AMAST), volume 2422 of Lecture Notes in Computer Science, pages 163-177. Springer-Verlag, 2002.
14. Jean-Pierre Queille and Joseph Sifakis. Specification and verification of concurrent systems in CESAR. In Proceedings of the 5th International Symposium on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-350. Springer-Verlag, 1982.
15. Marko Samer. PhD thesis, Vienna University of Technology. In preparation.
16. Marko Samer and Helmut Veith. Validity of CTL queries revisited. In Proceedings of the 12th Annual Conference of the European Association for Computer Science Logic (CSL), volume 2803 of Lecture Notes in Computer Science, pages 470-483. Springer-Verlag, 2003.