Skip to main content
SpringerLink
Log in

Runtime Verification Through Forward Chaining

  • Conference paper
  • First Online:
Runtime Verification

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9333))

Abstract

In this paper we present a novel rule-based approach for Runtime Verification of FLTL properties over finite but expanding traces. Our system exploits Horn clauses in implication form and relies on a forward chaining-based monitoring algorithm. This approach avoids the branching structure and exponential complexity typical of tableaux-based formulations, creating monitors with a single state and a fixed number of rules. This allows for a fast and scalable tool for Runtime Verification: we present the technical details together with a working implementation.

This research was supported by the ITxLaw project funded by Compagnia di San Paolo.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Barringer, H., Rydeheard, D.E., Havelund, K.: Rule systems for run-time monitoring: from eagle to ruler. J. Logic Comput. 20, 675–706 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. Bauer, A., Leucker, M., Schallhart, C.: Monitoring of real-time properties. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 260–272. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Breitgand, D., Goldstein, M., Shehory, E.H.: Efficient control of false negative and false positive errors with separate adaptive thresholds. IEEE Trans. Netw. Serv. Manage. 8, 128–140 (2011)

    Article  Google Scholar 

  5. d’Avila Garcez, A.S., Zaverucha, G.: The connectionist inductive learning and logic programming system. Appl. Intell. 11, 59–77 (1999)

    Article  Google Scholar 

  6. Drusinsky, A.: The temporal rover and the ATG rover. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, pp. 323–330. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Hollander, C.D., Annie, S.W.: The current state of normative agent-based systems. J. Artif. Soc. Soc. Simul. 14, 47–62 (2011)

    Google Scholar 

  9. Horn, A.: On sentences which are true of direct unions of algebras. J. Symb. Log. 16, 14–21 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kripke, S.A.: Semantical considerations on modal logic. Acta Philosophica Fennica 16, 83–94 (1963)

    MathSciNet  MATH  Google Scholar 

  11. Lassez, J.-L., Maher, M.J.: The denotational semantics of horn clauses as aproduction system. In: Proceedings of the Association for the Advancement of Artificial Intelligence 1983, pp. 229–231 (1983)

    Google Scholar 

  12. Leucker, M., Schallhart, C.: A brief account of runtime verification. J. Logic Algebraic Program. 78, 293–303 (2009)

    Article  MATH  Google Scholar 

  13. Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logics of Programs. Lecture Notes in Computer Science, vol. 193, pp. 196–218. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  14. Lukasiewicz, J.: O logice trjwartosciowej (On Three-Valued Logic) (1920)

    Google Scholar 

  15. Perotti, A., d’Avila Garcez, A.S., Boella, G.: Neural networks for runtime verification. In: 2014 International Joint Conference on Neural Networks, IJCNN 2014, Beijing, China, July 6–11, 2014, pp. 2637–2644. IEEE (2014)

    Google Scholar 

  16. Pesic, M., Schonenberg, H., van der Aalst, W.M.P.: Declare: full support for loosely-structured processes. In: 11th IEEE International Enterprise Distributed Object Computing Conference, EDOC 2007, pp. 287–287 (2007)

    Google Scholar 

  17. Pnueli, A.: The temporal logic of programs. In: Proceedings of the Annual Symposium on Foundations of Computer Science 1977, pp. 46–57 (1977)

    Google Scholar 

  18. van der Aalst, W., et al.: Process mining Manifesto. In: Daniel, F., Barkaoui, K., Dustdar, S. (eds.) BPM Workshops 2011, Part I. LNBIP, vol. 99, pp. 169–194. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23, 733–742 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Turin, Turin, Italy

    Alan Perotti & Guido Boella

  2. City University London, London, England

    Artur d’Avila Garcez

Authors
  1. Alan Perotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guido Boella
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Artur d’Avila Garcez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alan Perotti .

Editor information

Editors and Affiliations

  1. TU Wien, Vienna, Austria

    Ezio Bartocci

  2. Max Planck Institute for Software Systems, Kaiserslautern, Germany

    Rupak Majumdar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Perotti, A., Boella, G., Garcez, A.d. (2015). Runtime Verification Through Forward Chaining. In: Bartocci, E., Majumdar, R. (eds) Runtime Verification. Lecture Notes in Computer Science(), vol 9333. Springer, Cham. https://doi.org/10.1007/978-3-319-23820-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23820-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23819-7

  • Online ISBN: 978-3-319-23820-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation