Model checking a path (preliminary report)

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

Volumn 2761, Issue , 2003, Pages 251-265

  Markey, N ^a,b   Schnoebelen, P ^b  

^a UNIVERSITÉ D'ORLÉANS   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC;

RUN-TIME VERIFICATION; TEMPORAL LOGIC FORMULA;

MODEL CHECKING;

EID: 35248852800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_17     Document Type: Article

References (26)

1. B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, and Ph. Schnoebelen. Systems and Software Verification. Model-Checking Techniques and Tools. Springer, 2001.
2. A. Biere, A. Cimatti, E. M. Clarke, O. Strichman, and Yunshan Zhu. Bounded model checking. In Highly Dependable Software, volume 58 of Advances in Computers. Academic Press, 2003. To appear.
3. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT Press, 1999.
4. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th ACM Symp. Theory of Computing (STOC'77), Boulder, CO, USA, May 1977, pages 77-90, 1977.
5. D. Drusinsky. The Temporal Rover and the ATG Rover. In SPIN Model Checking and Software Verification, Proc. 7th Int. SPIN Workshop, Stanford, CA, USA, Aug. 2000, volume 1885 of Lecture Notes in Computer Science, pages 323-330. Springer, 2000.
6. S. Demri and Ph. Schnoebelen. The complexity of prepositional linear temporal logics in simple cases. Information and Computation, 174(1):84-103, 2002.
7. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995-1072. Elsevier Science, 1990.
8. B. Finkbeiner and H. Sipma. Checking finite traces using alternating automata. In Proc. 1st Int. Workshop on Runtime Verification (RV'01), Paris, France, DK, July 2001, volume 55(2) of Electronic Notes in Theor. Comp. Sci. Elsevier Science, 2001.
9. R. Greenlaw, H.J. Hoover, and W.L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford Univ. Press, 1995.
10. D.M. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symp. Principles of Programming Languages (POPL'80), Las Vegas, NV, USA, Jan. 1980, pages 163-173, 1980.
11. K. Havelund. Using runtime analysis to guide model checking of Java programs. In SPIN Model Checking and Software Verification, Proc. 7th Int. SPIN Workshop, Stanford, CA, USA, Aug. 2000, volume 1885 of Lecture Notes in Computer Science, pages 245-264. Springer, 2000.
12. D. Harel, D.C. Kozen, and R. Parikh. Process logic: Expressiveness, decidability, completeness. In Proc. 21st IEEE Symp. Foundations of Computer Science (FOCS'80), Syracuse, NY, USA, Oct. 1980, pages 129-142, 1980.
13. D. Harel, O. Kupferman, and M.Y. Vardi. On the complexity of verifying concurrent transition systems. Information and Computation, 173(2):143-161, 2002.
14. F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal logic with forgettable past. In Proc. 17th IEEE Symp. Logic in Computer Science (LICS'2002), Copenhagen, Denmark, July 2002, pages 383-392. IEEE Comp. Soc. Press, 2002.
15. R. Lassaigne and S. Peyronnet. Approximate verification of probabilistic systems. In Proc. 2nd Joint Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV'2002), Copenhagen, Denmark, July 2002, volume 2399 of Lecture Notes in Computer Science, pages 213-214. Springer, 2002.
16. N. Markey. Past is for free: on the complexity of verifying linear temporal properties with past. In Proc. 9th Int. Workshop on Expressiveness in Concurrency (EXPRESS'2002), Brno, Czech Republic, Aug. 2002, volume 68.2 of Electronic Notes in Theor. Camp. Sci. Elsevier Science, 2002.
17. N. Markey and Ph. Schnoebelen. A PTIME-complete problem for SLP-compressed words. Submitted for publication, 2003.
18. W. Plandowski and W. Rytter. Complexity of language recognition problems for compressed words. In J. Karhumaki, H. Maurer, G. Pǎun, and G. Rozenberg, editors, Jewels are Forever, pages 262-272. Springer, 1999.
19. A. Rabinovich. Expressive power of temporal logics. In Proc. 13th Int. Conf. Concurrency Theory (CONCUR'2002), Brno, Czech Republic, Aug. 2002, volume 2421 of Lecture Notes in Computer Science, pages 57-75. Springer, 2002.
20. Muriel Roger and Jean Goubault-Larrecq. Log auditing through model checking. In Proc. 14th IEEE Computer Security Foundations Workshop (CSFW'01), Cape Breton, Nova Scotia, Canada, June 2001, pages 220-236. IEEE Comp. Soc. Press, 2001.
21. J.G. Rosenstein. Linear Orderings. Academic Press, 1982.
22. R. Rosner and A. Pnueli. A choppy logic. In Proc. 1st IEEE Symp. Logic in Computer Science (LICS'86), Cambridge, MA, USA, June 1986, pages 306-313. IEEE Comp. Soc. Press, 1986.
23. A.P. Sistla and E.M. Clarke. The complexity of prepositional linear temporal logics. Journal of the ACM, 32(3):733-749, 1985.
24. Ph. Schnoebelen. The complexity of temporal logic model checking. In Advances in Modal Logic, papers from 4th Int. Workshop on Advances in Modal Logic (AiML'2002), Sep.-Oct. 2002, Toulouse, France. World Scientific, 2003. To appear.
25. L.J. Stockmeyer. The complexity of decision problems in automata and logic. PhD thesis, MIT, 1974.
26. H.L.S. Younes and R.G. Simmons. Probabilistic verification of discrete event systems using acceptance sampling. In Proc. 14th Int. Conf. Computer Aided Verification (CAV'2002), Copenhagen, Denmark, July 2002, volume 2404 of Lecture Notes in Computer Science, pages 223-235. Springer, 2002.