Runtime verification for LTL and TLTL

ACM Transactions on Software Engineering and Methodology

Volumn 20, Issue 4, 2011, Pages

  Bauer, Andreas ^a   Leucker, Martin ^b   Schallhart, Christian ^c  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Assertion checkers; Monitors; Runtime verification

Indexed keywords

ASSERTION CHECKERS; LINEAR TIME TEMPORAL LOGIC; PARTIAL OBSERVATION; ROAD-MAPS; RUNNING SYSTEMS; RUNTIME VERIFICATION; TEMPORAL LOGIC SPECIFICATIONS; THREE-VALUED; TRUTH VALUES;

DISPLAY DEVICES; MODEL CHECKING; SEMANTICS;

TEMPORAL LOGIC;

EID: 79960344619     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/2000799.2000800     Document Type: Article

References (82)

1. AHO, A., SETHI, R., AND ULLMAN, J. 1986. Compilers: Principles and Techniques and Tools. Addison- Wesley.
2. ALLAN, C., AVGUSTINOV, P., CHRISTENSEN, A. S., HENDREN, L. J., KUZINS, S., LHOTÁK, O., DE MOOR, O., SERENI, D., SITTAMPALAM, G., AND TIBBLE, J. 2005. Adding trace matching with free variables to aspectj. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA). 345-364.
3. ALPERN, B. AND SCHNEIDER, F. B. 1987. Recognizing safety and liveness. Distrib. Comput. 2, 3, 117-126.
4. ALUR, R. AND DILL, D. L. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 2, 183-235.
5. ALUR, R.,COURCOUBETIS, C., AND DILL, D. L. 1993. Model-checking in dense real-time. Inform. Computat. 104, 1, 2-34.
6. ALUR, R., FIX, L., AND HENZINGER, T. A. 1999. Event-clock automata: a determinizable class of timed automata. Theor. Comput. Sci. 211, 1-2, 253-273. (Pubitemid 129609041)
7. BARBON, F., TRAVERSO, P., PISTORE, M., AND TRAINOTTI, M. 2006. Run-time monitoring of instances and classes of web service compositions. In Proceedings of the International Conference on Web Services (ICWS). IEEE Computer Society, 63-71. (Pubitemid 351209839)
8. BARESI, L., GUINEA, S., AND PASQUALE, L. 2008. Towards a unified framework for the monitoring and recovery of bpel processes. In Proceedings of the Workshop on Testing, Analysis, and Verification of Web Services and Applications (TAV-WEB). T. Bultan and T. Xie Eds., ACM, 15-19.
9. BARRINGER, H., GOLDBERG, A., HAVELUND, K., AND SEN, K. 2004. Program monitoring with ltl in eagle. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS).
10. BARRINGER, H., RYDEHEARD, D. E., AND HAVELUND, K. 2007. Rule systems for run-time monitoring: From eagle to ruler. In International Workshop on Runtime Verification (RV). Lecture Notes in Computer Science, vol. 4839, 111-125. (Pubitemid 351152942)
11. BAUER, A., LEUCKER, M., AND SCHALLHART, C. 2006a. Model-based runtime analysis of reactive distributed systems. In Proceedings of the Australian Software Engineering Conference (ASWEC). IEEE Computer Society, 243-252. (Pubitemid 44592158)
12. BAUER, A., LEUCKER, M., AND SCHALLHART, C. 2006b. Monitoring of real-time properties. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). S. Arun-Kumar and N. Garg Eds., Lecture Notes in Computer Science, vol. 4337, Springer- Verlag, 260-272.
13. BAUER, A., LEUCKER, M., AND SCHALLHART, C. 2007. The good, the bad, and the ugly-but how ugly is ugly? In Proceedings of the International Workshop on Runtime Verification (RV). Lecture Notes in Computer Science, vol. 4839, Springer-Verlag, 126-138. (Pubitemid 351152943)
14. BAUER, A., LEUCKER, M., AND SCHALLHART, C. 2010. Comparing LTL semantics for runtime verification. J. Logic Comput. 20, 3, 651-674.
15. BEHRMANN, G., DAVID, A., LARSEN, K. G., HÅKANSSON, J., PETTERSSON, P., YI, W., AND HENDRIKS, M. 2006. Uppaal 4.0. In Proceedings of the International Conference on the Quantitative Evaluaiton of Systems (QEST). IEEE Computer Society, 125-126.
16. BENGTSSON, J., LARSEN, K. G., LARSSON, F., PETTERSSON, P., AND YI, W. 1996. UPPAAL: a tool suite for the automatic verification of real-time systems. In Hybrid Systems III. R. Alur, T. A. Henzinger, and E. D. Sontag Eds., Lecture Notes in Computer Science, vol. 1066., Springer-Verlag, 232-243. (Pubitemid 126066706)
17. BERG, T., JONSSON, B., LEUCKER, M., AND SAKSENA, M. 2003. Insights to Angluin's learning. In Proceedings of the International Workshop on Software Verification and Validation (SVV). Electronic Notes in Theoretical Computer Science, vol. 118, 3-18. (Pubitemid 40219691)
18. BIERE, A., CIMATTI, A., CLARKE, E. M., AND ZHU, Y. 1999. Symbolic model checking without BDDs. In Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS). R. Cleaveland Ed., Lecture Notes in Computer Science, vol. 1579, Springer, 193-207.
19. BIERE, A., CIMATTI, A., CLARKE, E., STRICHMAN, O., AND ZHU, Y. 2003. Bounded model checking. In Advances in Computers, vol. 58. Academic Press, 118-149. (Pubitemid 37553933)
20. BODDEN, E. 2004. A lightweight ltl runtime verification tool for java. In OOPSLA Companion. J. M. Vlissides and D. C. Schmidt Eds., ACM, 306-307.
21. BOUYER, P., CHEVALIER, F., AND D'SOUZA, D. 2005. Fault diagnosis using timed automata. In Proceedings of the 8th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS). V. Sassone Ed., Lecture Notes in Computer Science, vol. 3441, Springer, 219-233. (Pubitemid 41273709)
22. BRYANT, R. E. 1985. Symbolic manipulation of boolean functions using a graphical representation. In Proceedings of the 22nd ACM/IEEE Design Automation Conference. IEEE Computer Society Press, 688-694.
23. BüCHI, J. 1962. On a decision method in restricted second order arithmetic. In Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science. 1-11.
24. CHAUDHURI, S. AND ALUR, R. 2007. Instrumenting c programs with nested word monitors. In Proceedings of the International SPIN Workshop. D. Bosnacki and S. Edelkamp Eds., Lecture Notes in Computer Science, vol. 4595, Springer, 279-283.
25. CHECHIK, M., DEVEREUX, B., AND GURFINKEL, A. 2001. Model-checking infinite state-space systems with fine-grained abstractions using spin. In Proceedings of the International SPIN Workshop. M. B. Dwyer Ed., Lecture Notes in Computer Science, vol. 2057, Springer, 16-36. (Pubitemid 33276261)
26. CHEN, F. AND ROSU, G. 2003. Towards monitoring-oriented programming: A paradigm combining specification and implementation. Electron. Notes Theor. Comput. Sci. 89, 2.
27. CHEN, F. AND ROŞU, G. 2007. MOP: An Efficient and Generic Runtime Verification Framework. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA). 569-588.
28. CHOW, T. S. 1978. Testing software design modeled by finite-state machines. IEEE Trans. Softw. Engin 4, 3, 178-187.
29. CLARKE, E. M., GRUMBERG, O., AND PELED, D. A. 1999. Model Checking. MIT Press, Cambridge,MA.
30. D'AMORIM, M. AND ROSU, G. 2005. Efficient monitoring of omega-languages. In Proceedings of the International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 3576, 364-378.
31. D'ANGELO, B., SANKARANARAYANAN, S., SÁNCHEZ, C., ROBINSON, W., FINKBEINER, B., SIPMA, H. B., MEHROTRA, S., AND MANNA, Z. 2005. LOLA: Runtime monitoring of synchronous systems. In Proceedings of the International Symposium on Temporal Representation and Reasoning (TIME). 166-174.
32. DELGADO, N., GATES, A. Q., AND ROACH, S. 2004. A taxonomy and catalog of runtime software-fault monitoring tools. IEEE Trans. Softw. Engin. 30, 12, 859-872. (Pubitemid 41158279)
33. DEWHURST, S. 2002. C++ Gotchas: Avoiding Common Problems in Coding and Design. Addison-Wesley Longman Publishing Co., Inc., Boston, MA.
34. DILL, D. L. 1989. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems. J. Sifakis Ed., Lecture Notes in Computer Science, vol. 407, Springer, 197-212.
35. D'SOUZA, D. 2003. A logical characterisation of event clock automata. Int. J. Found. Comput. Sci. 14, 4, 625-639.
36. DWYER, M. B., AVRUNIN, G. S., AND CORBETT, J. C. 1999. Patterns in property specifications for finitestate verification. In Proceedings of the International Conference on Software Engineering (ICSE). IEEE, Computer Society Press, 411-420.
37. EISNER, C., FISMAN, D., HAVLICEK, J., LUSTIG, Y., MCISAAC, A., AND CAMPENHOUT, D. V. 2003. Reasoning with temporal logic on truncated paths. In Proceedings of the International Conference Computer Aided Verification (CAV). W. A. H. Jr. and F. Somenzi Eds., Lecture Notes in Computer Science, vol. 2725, Springer, 27-39.
38. ERLINGSSON, Ü. AND SCHNEIDER, F. B. 2000. Sasi enforcement of security policies: A retrospective. Proceedings of the DARPA Information Survivability Conference and Exposition 2, 1287.
39. FINKBEINER, B. AND SIPMA, H. 2004. Checking finite traces using alternating automata. Form. Meth. Syst. Des. 24, 2, 101-127.
40. FRITZ, C. 2003. Constructing Büchi automata from linear temporal logic using simulation relations for alternating büchi automata. In Proceedings of the International Conference on Implementation and Application of Automata (CIAA). O. H. Ibarra and Z. Dang Eds., Lecture Notes in Computer Science, vol. 2759, Springer, 35-48.
41. GASTIN, P. AND ODDOUX, D. 2001. Fast LTL to Büchi automata translation. In Proceedings of the 13th International Conference on Computer-Aided Verification. Lecture Notes in Computer Science, vol. 2102.
42. GEILEN, M. 2001. On the construction of monitors for temporal logic properties. Electron. Notes Theor. Comput. Sci. 55, 2.
43. GIANNAKOPOULOU, D. AND HAVELUND, K. 2001a. Automata-based verification of temporal properties on running programs. In Proceedings of the International Conference on Automated Software Engineering (ASE). IEEE Computer Society, 412-416.
44. GIANNAKOPOULOU, D. AND HAVELUND, K. 2001b. Runtime analysis of linear temporal logic specifications. Tech. rep. 01.21, RIACS/USRA.
45. GOLDSMITH, S.,O'CALLAHAN, R., AND AIKEN, A. 2005. Relational queries over program traces. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA). 385-402.
46. GOLLU, A., PURI, A., AND VARAIYA, P. 1994. Discretization of timed automata. In Proceedings of the 33rd IEEE Conference on Decision and Control. 957-958.
47. GRINCHTEIN, O. AND LEUCKER, M. 2008. Network invariants for real-time systems. Form. Asp. Comput. 20, 619-635.
48. HAKANSSON, J., JONSSON, B., AND LUNDQVIST, O. 2003. Generating online test oracles from temporal logic specifications. J. Softw. Tools Technol. Transfer 4, 4, 456-471.
49. HAVELUND, K. AND ROSU, G. 2001. Monitoring Java Programs with Java PathExplorer. Electron. Notes Theor. Comput. Sci. 55, 2.
50. HAVELUND, K. AND ROSU, G. 2002. Synthesizing Monitors for Safety Properties. In Proceedings of the Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 2280, 342-356.
51. HAVELUND, K. AND ROSU, G. 2004. Efficient monitoring of safety properties. J. Softw. Tools Technol. Transfer 6, 2, 158-173.
52. HOPCROFT, J. 1971. An n log n algorithmfor minimizing states in a finite automation. In Theory ofMachines and Computations. 189-196.
53. KAMP, H. W. 1968. Tense logic and the theory of linear order. Ph.D. thesis, University of California, Los Angeles.
54. KIM, M., KANNAN, S., LEE, I., SOKOLSKY, O., AND VISWANATHAN, M. 2002. Computational analysis of run-time monitoring/fundamentals of java-mac. Electron. Notes Theor. Comput. Sci. 70, 4.
55. KIM, M., VISWANATHAN, M., KANNAN, S., LEE, I., AND SOKOLSKY, O. 2004. Java-mac: A run-time assurance approach for java programs. Form. Meth. Syst. Des. 24, 2, 129-155.
56. KOPETZ, H. 1991. Event-triggered versus time-triggered real-time systems. In Operating Systems of the 90s and Beyond. A. I. Karshmer and J. Nehmer Eds., Lecture Notes in Computer Science, vol. 563, Springer, 87-101.
57. KUPFERMAN, O. AND VARDI, M. Y. 2001. Model checking of safety properties. Form. Meth. Syst. Des. 19, 3, 291-314. (Pubitemid 32902639)
58. LAMPORT, L. 1977. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Engin. 3, 2, 125-143.
59. LICHTENSTEIN, O. AND PNUELI, A. 1985. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Conference on Principles of Programming Languages (POPL). ACM, New York, 97-107. (Pubitemid 16542722)
60. MALER, O. AND NICKOVIC, D. 2004. Monitoring temporal properties of continuous signals. In Proceedings of the Joint International Conferences on Formal Modelling and Analysis of Timed Systems/Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems (FORMATS/FTRTFT). Y. Lakhnech and S. Yovine Eds., Lecture Notes in Computer Science, vol. 3253, Springer, 152-166. (Pubitemid 39738302)
61. MANNA, Z. AND PNUELI, A. 1995. Temporal Verification of Reactive Systems: Safety. Springer,New York.
62. MARKEY, N. AND SCHNOEBELEN, P. 2003. Model checking a path. In Proceedings of the Conference on Concurrency Theory (CONCUR). Lecture Notes in Computer Science, vol. 2761, 248-262.
63. MARTIN, M. C., LIVSHITS, V. B., AND LAM, M. S. 2005. Finding application errors and security flaws using pql: a program query language. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA). 365-383.
64. PELED, D., VARDI, M., AND YANNAKAKIS, M. 1999. Black box checking. In Proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification (FORTE/PSTV). Kluwer, 225-240.
65. PNUELI, A. 1977. The temporal logic of programs. In Proceedings of the Symposium on the Foundations of Computer Science (FOCS). IEEE Computer Society Press, 46-57.
66. PNUELI, A. AND ZAKS, A. 2006. PSL model checking and run-time verification via testers. In Proceedings of the International Symposium on Formal Methods (FM). J. Misra, T. Nipkow, and E. Sekerinski Eds., Lecture Notes in Computer Science, vol. 4085, Springer, 573-586. (Pubitemid 44502931)
67. RASKIN, J.-F. 1999. Logics, automata and classical theories for deciding real-time. Ph.D. thesis, Namur, Belgium.
68. RASKIN, J.-F. AND SCHOBBENS, P.-Y. 1999. The logic of event clocks-decidability, complexity and expressiveness. J. Autom. Lang. Combina. 4, 3, 247-286.
69. ROBINSON, W. 2006. A requirements monitoring framework for enterprise systems. Require. Engin. 11, 1, 17-41. (Pubitemid 43118933)
70. ROSU, G. AND BENSALEM, S. 2006. Allen linear (interval) temporal logic - translation to LTL and monitor synthesis. In Proceedings of the International Conference on Computer Aided Verification (CAV). T. Ball and R. B. Jones Eds., Lecture Notes in Computer Science, vol. 4144, Springer, 263-277. (Pubitemid 44560882)
71. SCHWOON, S. AND ESPARZA, J. 2005. A note on on-the-fly verification algorithms. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 3440, 174-190.
72. SEN, K. AND ROSU, G. 2003. Generating optimal monitors for extended regular expressions. Electron. Notes Theor. Comput. Sci. 89, 2.
73. SISTLA, A. P. AND CLARKE, E. M. 1985. Complexity of propositional temporal logics. J. ACM 32, 733-749.
74. STOLZ, V. AND BODDEN, E. 2006. Temporal assertions using AspectJ. Electron. Notes Theor. Comput. Sci. 144, 4, 109-124. (Pubitemid 43728185)
75. STROUSTRUP, B. 2000. The C++ Programming Language Special Ed. Addison-Wesley, Boston, MA.
76. TARJAN, R. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2, 146-160.
77. THATI, P. AND ROSU, G. 2005. Monitoring algorithms for metric temporal logic specifications. Electron. Notes Theor. Comput. Sci. 113, 145-162. (Pubitemid 40073310)
78. TRIPAKIS, S. 2002. Fault diagnosis for timed automata. In Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT).W. DammandE.-R. Olderog Eds., Lecture Notes in Computer Science, vol. 2469, Springer, 205-224.
79. TRIPAKIS, S. AND YOVINE, S. 2001. Analysis of timed systems using time-abstracting bisimulations. Form. Meth. Syst. Des. 18, 1, 25-68. (Pubitemid 32159779)
80. VARDI, M. Y. 1996. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure Versus Automata. Lecture Notes in Computer Science, vol. 1043, 238-266. (Pubitemid 126047609)
81. VARDI, M. Y. AND WOLPER, P. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of the Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, 332-345.
82. VASILEVSKI,M. 1973. Failure diagnosis of automata. Cybernetic 9, 4, 653-665.