An Extension of LTL with Rules and Its Application to Runtime Verification

Klaus Havelund; Doron Peled

doi:10.1007/978-3-030-32079-9_14

An Extension of LTL with Rules and Its Application to Runtime Verification

Klaus Havelund, Doron Peled

Department of Computer Science

Jet Propulsion Laboratory, California Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Runtime Verification (RV) consists of analyzing execution traces using formal techniques, e.g., monitoring executions against Linear Temporal Logic (LTL) properties. Propositional LTL is, however, limited in expressiveness, as first shown by Wolper [32]. Several extensions to propositional LTL, which promote the expressive power to that of regular expressions, have therefore been proposed; however, none of which was, by and large, adopted for RV. In addition, for many practical cases, there is a need in RV to monitor properties that carry data. This problem has been addressed by numerous authors, and in previous work we addressed this by providing an algorithm that uses BDDs to represent relations over data elements. We show expressiveness deficiencies of first-order LTL and suggest an extension of (propositional as well as first-order) LTL with rules to address these limitations. We describe how the DejaVu tool is correspondingly extended and provide some experimental results.

Original language	English
Title of host publication	Runtime Verification - 19th International Conference, RV 2019, Proceedings
Editors	Bernd Finkbeiner, Leonardo Mariani
Publisher	Springer
Pages	239-255
Number of pages	17
ISBN (Print)	9783030320782
DOIs	https://doi.org/10.1007/978-3-030-32079-9_14
State	Published - 2019
Event	19th International Conference on Runtime Verification, RV 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019 - Porto, Portugal Duration: 8 Oct 2019 → 11 Oct 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11757 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	19th International Conference on Runtime Verification, RV 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019
Country/Territory	Portugal
City	Porto
Period	8/10/19 → 11/10/19

Bibliographical note

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.

Funding

K. Havelund—The research performed by this author was carried out at Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration. D. Peled—The research performed by this author was partially funded by Israeli Science Foundation grant 1464/18: “Efficient Runtime Verification for Systems with Lots of Data and its Applications”.

Funders	Funder number
Israeli Science Foundation	1464/18

Access to Document

10.1007/978-3-030-32079-9_14

Cite this

Havelund, K., & Peled, D. (2019). An Extension of LTL with Rules and Its Application to Runtime Verification. In B. Finkbeiner, & L. Mariani (Eds.), Runtime Verification - 19th International Conference, RV 2019, Proceedings (pp. 239-255). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11757 LNCS). Springer. https://doi.org/10.1007/978-3-030-32079-9_14

Havelund, Klaus ; Peled, Doron. / An Extension of LTL with Rules and Its Application to Runtime Verification. Runtime Verification - 19th International Conference, RV 2019, Proceedings. editor / Bernd Finkbeiner ; Leonardo Mariani. Springer, 2019. pp. 239-255 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cac44e0437984c868da67135366b6e38,

title = "An Extension of LTL with Rules and Its Application to Runtime Verification",

abstract = "Runtime Verification (RV) consists of analyzing execution traces using formal techniques, e.g., monitoring executions against Linear Temporal Logic (LTL) properties. Propositional LTL is, however, limited in expressiveness, as first shown by Wolper [32]. Several extensions to propositional LTL, which promote the expressive power to that of regular expressions, have therefore been proposed; however, none of which was, by and large, adopted for RV. In addition, for many practical cases, there is a need in RV to monitor properties that carry data. This problem has been addressed by numerous authors, and in previous work we addressed this by providing an algorithm that uses BDDs to represent relations over data elements. We show expressiveness deficiencies of first-order LTL and suggest an extension of (propositional as well as first-order) LTL with rules to address these limitations. We describe how the DejaVu tool is correspondingly extended and provide some experimental results.",

author = "Klaus Havelund and Doron Peled",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 19th International Conference on Runtime Verification, RV 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019 ; Conference date: 08-10-2019 Through 11-10-2019",

year = "2019",

doi = "10.1007/978-3-030-32079-9_14",

language = "אנגלית",

isbn = "9783030320782",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "239--255",

editor = "Bernd Finkbeiner and Leonardo Mariani",

booktitle = "Runtime Verification - 19th International Conference, RV 2019, Proceedings",

}

Havelund, K & Peled, D 2019, An Extension of LTL with Rules and Its Application to Runtime Verification. in B Finkbeiner & L Mariani (eds), Runtime Verification - 19th International Conference, RV 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11757 LNCS, Springer, pp. 239-255, 19th International Conference on Runtime Verification, RV 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019, Porto, Portugal, 8/10/19. https://doi.org/10.1007/978-3-030-32079-9_14

An Extension of LTL with Rules and Its Application to Runtime Verification. / Havelund, Klaus; Peled, Doron.
Runtime Verification - 19th International Conference, RV 2019, Proceedings. ed. / Bernd Finkbeiner; Leonardo Mariani. Springer, 2019. p. 239-255 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11757 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An Extension of LTL with Rules and Its Application to Runtime Verification

AU - Havelund, Klaus

AU - Peled, Doron

PY - 2019

Y1 - 2019

N2 - Runtime Verification (RV) consists of analyzing execution traces using formal techniques, e.g., monitoring executions against Linear Temporal Logic (LTL) properties. Propositional LTL is, however, limited in expressiveness, as first shown by Wolper [32]. Several extensions to propositional LTL, which promote the expressive power to that of regular expressions, have therefore been proposed; however, none of which was, by and large, adopted for RV. In addition, for many practical cases, there is a need in RV to monitor properties that carry data. This problem has been addressed by numerous authors, and in previous work we addressed this by providing an algorithm that uses BDDs to represent relations over data elements. We show expressiveness deficiencies of first-order LTL and suggest an extension of (propositional as well as first-order) LTL with rules to address these limitations. We describe how the DejaVu tool is correspondingly extended and provide some experimental results.

AB - Runtime Verification (RV) consists of analyzing execution traces using formal techniques, e.g., monitoring executions against Linear Temporal Logic (LTL) properties. Propositional LTL is, however, limited in expressiveness, as first shown by Wolper [32]. Several extensions to propositional LTL, which promote the expressive power to that of regular expressions, have therefore been proposed; however, none of which was, by and large, adopted for RV. In addition, for many practical cases, there is a need in RV to monitor properties that carry data. This problem has been addressed by numerous authors, and in previous work we addressed this by providing an algorithm that uses BDDs to represent relations over data elements. We show expressiveness deficiencies of first-order LTL and suggest an extension of (propositional as well as first-order) LTL with rules to address these limitations. We describe how the DejaVu tool is correspondingly extended and provide some experimental results.

UR - http://www.scopus.com/inward/record.url?scp=85075713501&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-32079-9_14

DO - 10.1007/978-3-030-32079-9_14

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85075713501

SN - 9783030320782

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

SP - 239

EP - 255

BT - Runtime Verification - 19th International Conference, RV 2019, Proceedings

A2 - Finkbeiner, Bernd

A2 - Mariani, Leonardo

PB - Springer

T2 - 19th International Conference on Runtime Verification, RV 2019 held as part of the 3rd World Congress on Formal Methods, FM 2019

Y2 - 8 October 2019 through 11 October 2019

ER -

Havelund K, Peled D. An Extension of LTL with Rules and Its Application to Runtime Verification. In Finkbeiner B, Mariani L, editors, Runtime Verification - 19th International Conference, RV 2019, Proceedings. Springer. 2019. p. 239-255. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-32079-9_14

An Extension of LTL with Rules and Its Application to Runtime Verification

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this