Advertisement

Abstract

We propose a local proof system for LTL formalising deductions within the constraints of Runtime Verification (RV), and show how such a system can be used as a basis for the construction of online runtime monitors. Novel soundness and completeness results are proven for this system. We also prove decidability and incrementality properties for a monitoring algorithm constructed from it. Finally, we relate its expressivity to existing symbolic analysis techniques used in RV.

Keywords

Proof System Deductive System Linear Temporal Logic Proof Obligation Proof Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [BF12]
    Bauer, A., Falcone, Y.: Decentralised LTL Monitoring. In: Giannakopoulou, D., Méry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 85–100. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  2. [BL08]
    Brunnler, K., Lange, M.: Cut-free sequent systems for temporal logic. JLAP 76(2), 216–225 (2008)MathSciNetGoogle Scholar
  3. [BLS07]
    Bauer, A., Leucker, M., Schallhart, C.: The good, the bad, and the ugly, but how ugly is ugly? In: Sokolsky, O., Taşıran, S. (eds.) RV 2007. LNCS, vol. 4839, pp. 126–138. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. [BLS10]
    Bauer, A., Leucker, M., Schallhart, C.: Comparing LTL semantics for runtime verification. Logic and Comput. 20(3), 651–674 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  5. [BLS11]
    Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. TOSEM 20(4), 14 (2011)CrossRefGoogle Scholar
  6. [BS92]
    Bradfield, J., Stirling, C.: Local model-checking for infinite state spaces. TCS 96, 157–174 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  7. [Bus98]
    Buss, S.R. (ed.): Handbook of Proof Theory. Elsevier (1998)Google Scholar
  8. [EFH+03]
    Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., Van Campenhout, D.: Reasoning with temporal logic on truncated paths. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 27–39. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. [Gei01]
    Geilen, M.: On the construction of monitors for temporal logic properties. ENTCS 55(2), 181–199 (2001)Google Scholar
  10. [GPSS80]
    Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: POPL, pp. 163–173. ACM, New York (1980)Google Scholar
  11. [HR01]
    Havelund, K., Rosu, G.: Monitoring programs using rewriting. In: ASE, pp. 135–143. IEEE, Wash., DC (2001)Google Scholar
  12. [KI11]
    Kojima, K., Igarashi, A.: Constructive linear-time temporal logic: Proof systems and kripke semantics. Inf. Comput. 209(12), 1491–1503 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  13. [KYV01]
    Kupferman, O., Vardi, M.Y.: Model checking of safety properties. Form. Methods Syst. Des. 19(3), 291–314 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  14. [LS09]
    Leucker, M., Schallhart, C.: A brief account of Runtime Verification. JLAP 78(5), 293–303 (2009)zbMATHGoogle Scholar
  15. [MP91]
    Manna, Z., Pnueli, A.: Completing the Temporal Picture. Theoretical Computer Science 83(1), 97–130 (1991)CrossRefzbMATHGoogle Scholar
  16. [Pnu77]
    Pnueli, A.: The Temporal Logic of Programs. In: SFCS, pp. 46–57. IEEE, Wash., DC (1977)Google Scholar
  17. [RH05]
    Roşu, G., Havelund, K.: Rewriting-based techniques for runtime verification. Automated Software Engg. 12(2), 151–197 (2005)CrossRefGoogle Scholar
  18. [SRA04]
    Sen, K., Roşu, G., Agha, G.: Generating optimal linear temporal logic monitors by coinduction. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 260–275. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  19. [SW91]
    Stirling, C., Walker, D.: Local model-checking in the modal mu-calculus. TCS 89, 161–177 (1991)CrossRefzbMATHMathSciNetGoogle Scholar
  20. [TS00]
    Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Computer ScienceICT, University of MaltaMsidaMalta

Personalised recommendations