Monitoring First-Order Interval Logic

Klaus Havelund; Moran Omer; Doron Peled

doi:10.1007/978-3-030-92124-8_4

Monitoring First-Order Interval Logic

Klaus Havelund, Moran Omer, Doron Peled

CS@BIU

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

3 Scopus citations

Abstract

Runtime verification is used for monitoring the execution of systems, e.g. checking sequences of reported events against formal specifications. Typically the specification refers to the individual monitored events. In this work we perceive the events as defining intervals, each defined by a begin and a subsequent end event. Allen’s logic allows assertions about the relationship between such named intervals. We suggest a formalism that extends Allen’s logic into a first-order logic that allows quantification over intervals; in addition, intervals can carry data. We provide a monitoring algorithm and describe an implementation and experiments performed with it. We furthermore describe an alternative method for monitoring properties in this logic, by translating them into first-order past-time temporal logic, monitored with the tool DejaVu.

Original language	English
Title of host publication	Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings
Editors	Radu Calinescu, Corina S. Pasareanu
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	66-83
Number of pages	18
ISBN (Print)	9783030921231
DOIs	https://doi.org/10.1007/978-3-030-92124-8_4
State	Published - 2021
Event	19th International Conference on Software Engineering and Formal Methods, SEFM 2021 - Virtual Online Duration: 6 Dec 2021 → 10 Dec 2021

Publication series

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

Conference

Conference	19th International Conference on Software Engineering and Formal Methods, SEFM 2021
City	Virtual Online
Period	6/12/21 → 10/12/21

Bibliographical note

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

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Access to Document

10.1007/978-3-030-92124-8_4

Cite this

Havelund, K., Omer, M., & Peled, D. (2021). Monitoring First-Order Interval Logic. In R. Calinescu, & C. S. Pasareanu (Eds.), Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings (pp. 66-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13085 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-92124-8_4

Havelund, Klaus ; Omer, Moran ; Peled, Doron. / Monitoring First-Order Interval Logic. Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings. editor / Radu Calinescu ; Corina S. Pasareanu. Springer Science and Business Media Deutschland GmbH, 2021. pp. 66-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e4861f2d6fdc4a7c9ebc1a0188fe5acf,

title = "Monitoring First-Order Interval Logic",

abstract = "Runtime verification is used for monitoring the execution of systems, e.g. checking sequences of reported events against formal specifications. Typically the specification refers to the individual monitored events. In this work we perceive the events as defining intervals, each defined by a begin and a subsequent end event. Allen{\textquoteright}s logic allows assertions about the relationship between such named intervals. We suggest a formalism that extends Allen{\textquoteright}s logic into a first-order logic that allows quantification over intervals; in addition, intervals can carry data. We provide a monitoring algorithm and describe an implementation and experiments performed with it. We furthermore describe an alternative method for monitoring properties in this logic, by translating them into first-order past-time temporal logic, monitored with the tool DejaVu.",

author = "Klaus Havelund and Moran Omer and Doron Peled",

note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 19th International Conference on Software Engineering and Formal Methods, SEFM 2021 ; Conference date: 06-12-2021 Through 10-12-2021",

year = "2021",

doi = "10.1007/978-3-030-92124-8_4",

language = "אנגלית",

isbn = "9783030921231",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "66--83",

editor = "Radu Calinescu and Pasareanu, {Corina S.}",

booktitle = "Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings",

address = "גרמניה",

}

Havelund, K, Omer, M & Peled, D 2021, Monitoring First-Order Interval Logic. in R Calinescu & CS Pasareanu (eds), Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13085 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 66-83, 19th International Conference on Software Engineering and Formal Methods, SEFM 2021, Virtual Online, 6/12/21. https://doi.org/10.1007/978-3-030-92124-8_4

Monitoring First-Order Interval Logic. / Havelund, Klaus; Omer, Moran; Peled, Doron.
Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings. ed. / Radu Calinescu; Corina S. Pasareanu. Springer Science and Business Media Deutschland GmbH, 2021. p. 66-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13085 LNCS).

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

TY - GEN

T1 - Monitoring First-Order Interval Logic

AU - Havelund, Klaus

AU - Omer, Moran

AU - Peled, Doron

PY - 2021

Y1 - 2021

N2 - Runtime verification is used for monitoring the execution of systems, e.g. checking sequences of reported events against formal specifications. Typically the specification refers to the individual monitored events. In this work we perceive the events as defining intervals, each defined by a begin and a subsequent end event. Allen’s logic allows assertions about the relationship between such named intervals. We suggest a formalism that extends Allen’s logic into a first-order logic that allows quantification over intervals; in addition, intervals can carry data. We provide a monitoring algorithm and describe an implementation and experiments performed with it. We furthermore describe an alternative method for monitoring properties in this logic, by translating them into first-order past-time temporal logic, monitored with the tool DejaVu.

AB - Runtime verification is used for monitoring the execution of systems, e.g. checking sequences of reported events against formal specifications. Typically the specification refers to the individual monitored events. In this work we perceive the events as defining intervals, each defined by a begin and a subsequent end event. Allen’s logic allows assertions about the relationship between such named intervals. We suggest a formalism that extends Allen’s logic into a first-order logic that allows quantification over intervals; in addition, intervals can carry data. We provide a monitoring algorithm and describe an implementation and experiments performed with it. We furthermore describe an alternative method for monitoring properties in this logic, by translating them into first-order past-time temporal logic, monitored with the tool DejaVu.

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

U2 - 10.1007/978-3-030-92124-8_4

DO - 10.1007/978-3-030-92124-8_4

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

AN - SCOPUS:85121920734

SN - 9783030921231

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

SP - 66

EP - 83

BT - Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings

A2 - Calinescu, Radu

A2 - Pasareanu, Corina S.

PB - Springer Science and Business Media Deutschland GmbH

T2 - 19th International Conference on Software Engineering and Formal Methods, SEFM 2021

Y2 - 6 December 2021 through 10 December 2021

ER -

Havelund K, Omer M, Peled D. Monitoring First-Order Interval Logic. In Calinescu R, Pasareanu CS, editors, Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings. Springer Science and Business Media Deutschland GmbH. 2021. p. 66-83. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-92124-8_4

Monitoring First-Order Interval Logic

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this