Runtime verification: From propositional to first-order temporal logic

Klaus Havelund; Doron Peled

doi:10.1007/978-3-030-03769-7_7

Runtime verification: From propositional to first-order temporal logic

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

15 Scopus citations

Abstract

Runtime Verification is a branch of formal methods concerned with analysis of execution traces for the purpose of determining the state or general quality of the executing system. The field covers numerous approaches, one of which is specification-based runtime verification, where execution traces are checked against formal specifications. The paper presents syntax, semantics, and monitoring algorithms for respectively propositional and first-order temporal logics. In propositional logics the observed events in the execution trace are represented using atomic propositions, while first-order logic allows universal and existential quantification over data occurring as arguments in events. Monitoring of the first-order case is drastically more challenging than the propositional case, and we present a solution for this problem based on BDDs. We furthermore discuss monitorability of temporal properties by dividing them into different classes representing different degrees of monitorability.

Original language	English
Title of host publication	Runtime Verification- 18th International Conference, RV 2018, Proceedings
Editors	Christian Colombo, Martin Leucker
Publisher	Springer Verlag
Pages	90-112
Number of pages	23
ISBN (Print)	9783030037680
DOIs	https://doi.org/10.1007/978-3-030-03769-7_7
State	Published - 2019
Event	18th International Conference on Runtime Verification, RV 2018 - Limassol, Cyprus Duration: 10 Nov 2018 → 13 Nov 2018

Publication series

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

Conference

Conference	18th International Conference on Runtime Verification, RV 2018
Country/Territory	Cyprus
City	Limassol
Period	10/11/18 → 13/11/18

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2018.

Funding

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 author was partially funded by Israeli Science Foundation grant 2239/15: “Runtime Measuring and Checking of Cyber Physical Systems”.

Funders	Funder number
Israeli Science Foundation	2239/15
Israel Science Foundation

Access to Document

10.1007/978-3-030-03769-7_7

Cite this

Havelund, K., & Peled, D. (2019). Runtime verification: From propositional to first-order temporal logic. In C. Colombo, & M. Leucker (Eds.), Runtime Verification- 18th International Conference, RV 2018, Proceedings (pp. 90-112). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11237). Springer Verlag. https://doi.org/10.1007/978-3-030-03769-7_7

Havelund, Klaus ; Peled, Doron. / Runtime verification : From propositional to first-order temporal logic. Runtime Verification- 18th International Conference, RV 2018, Proceedings. editor / Christian Colombo ; Martin Leucker. Springer Verlag, 2019. pp. 90-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7e310d606cb04e5983dc12c18addbab6,

title = "Runtime verification: From propositional to first-order temporal logic",

abstract = "Runtime Verification is a branch of formal methods concerned with analysis of execution traces for the purpose of determining the state or general quality of the executing system. The field covers numerous approaches, one of which is specification-based runtime verification, where execution traces are checked against formal specifications. The paper presents syntax, semantics, and monitoring algorithms for respectively propositional and first-order temporal logics. In propositional logics the observed events in the execution trace are represented using atomic propositions, while first-order logic allows universal and existential quantification over data occurring as arguments in events. Monitoring of the first-order case is drastically more challenging than the propositional case, and we present a solution for this problem based on BDDs. We furthermore discuss monitorability of temporal properties by dividing them into different classes representing different degrees of monitorability.",

author = "Klaus Havelund and Doron Peled",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 18th International Conference on Runtime Verification, RV 2018 ; Conference date: 10-11-2018 Through 13-11-2018",

year = "2019",

doi = "10.1007/978-3-030-03769-7_7",

language = "אנגלית",

isbn = "9783030037680",

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

publisher = "Springer Verlag",

pages = "90--112",

editor = "Christian Colombo and Martin Leucker",

booktitle = "Runtime Verification- 18th International Conference, RV 2018, Proceedings",

address = "גרמניה",

}

Havelund, K & Peled, D 2019, Runtime verification: From propositional to first-order temporal logic. in C Colombo & M Leucker (eds), Runtime Verification- 18th International Conference, RV 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11237, Springer Verlag, pp. 90-112, 18th International Conference on Runtime Verification, RV 2018, Limassol, Cyprus, 10/11/18. https://doi.org/10.1007/978-3-030-03769-7_7

Runtime verification: From propositional to first-order temporal logic. / Havelund, Klaus; Peled, Doron.
Runtime Verification- 18th International Conference, RV 2018, Proceedings. ed. / Christian Colombo; Martin Leucker. Springer Verlag, 2019. p. 90-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11237).

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

TY - GEN

T1 - Runtime verification

T2 - 18th International Conference on Runtime Verification, RV 2018

AU - Havelund, Klaus

AU - Peled, Doron

PY - 2019

Y1 - 2019

N2 - Runtime Verification is a branch of formal methods concerned with analysis of execution traces for the purpose of determining the state or general quality of the executing system. The field covers numerous approaches, one of which is specification-based runtime verification, where execution traces are checked against formal specifications. The paper presents syntax, semantics, and monitoring algorithms for respectively propositional and first-order temporal logics. In propositional logics the observed events in the execution trace are represented using atomic propositions, while first-order logic allows universal and existential quantification over data occurring as arguments in events. Monitoring of the first-order case is drastically more challenging than the propositional case, and we present a solution for this problem based on BDDs. We furthermore discuss monitorability of temporal properties by dividing them into different classes representing different degrees of monitorability.

AB - Runtime Verification is a branch of formal methods concerned with analysis of execution traces for the purpose of determining the state or general quality of the executing system. The field covers numerous approaches, one of which is specification-based runtime verification, where execution traces are checked against formal specifications. The paper presents syntax, semantics, and monitoring algorithms for respectively propositional and first-order temporal logics. In propositional logics the observed events in the execution trace are represented using atomic propositions, while first-order logic allows universal and existential quantification over data occurring as arguments in events. Monitoring of the first-order case is drastically more challenging than the propositional case, and we present a solution for this problem based on BDDs. We furthermore discuss monitorability of temporal properties by dividing them into different classes representing different degrees of monitorability.

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

U2 - 10.1007/978-3-030-03769-7_7

DO - 10.1007/978-3-030-03769-7_7

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

AN - SCOPUS:85068400435

SN - 9783030037680

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

SP - 90

EP - 112

BT - Runtime Verification- 18th International Conference, RV 2018, Proceedings

A2 - Colombo, Christian

A2 - Leucker, Martin

PB - Springer Verlag

Y2 - 10 November 2018 through 13 November 2018

ER -

Havelund K, Peled D. Runtime verification: From propositional to first-order temporal logic. In Colombo C, Leucker M, editors, Runtime Verification- 18th International Conference, RV 2018, Proceedings. Springer Verlag. 2019. p. 90-112. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-03769-7_7

Runtime verification: From propositional to first-order temporal logic

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this