BDDs for Representing Data in Runtime Verification

Klaus Havelund; Doron Peled

doi:10.1007/978-3-030-60508-7_6

BDDs for Representing Data in 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

5 Scopus citations

Abstract

A BDD (Boolean Decision Diagram) is a data structure for the compact representation of a Boolean function. It is equipped with efficient algorithms for minimization and for applying Boolean operators. The use of BDDs for representing Boolean functions, combined with symbolic algorithms, facilitated a leap in the capability of model checking for the verification of systems with a huge number of states. Recently BDDs were considered as an efficient representation of data for Runtime Verification (RV). We review here the basic theory of BDDs and summarize their use in model checking and specifically in runtime verification.

Original language	English
Title of host publication	Runtime Verification - 20th International Conference, RV 2020, Proceedings
Editors	Jyotirmoy Deshmukh, Dejan Nickovic
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	107-128
Number of pages	22
ISBN (Print)	9783030605070
DOIs	https://doi.org/10.1007/978-3-030-60508-7_6
State	Published - 2020
Event	20th International Conference on Runtime Verification, RV 2020 - Los Angeles, United States Duration: 6 Oct 2020 → 9 Oct 2020

Publication series

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

Conference

Conference	20th International Conference on Runtime Verification, RV 2020
Country/Territory	United States
City	Los Angeles
Period	6/10/20 → 9/10/20

Bibliographical note

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.

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 1464/18: “Efficient Runtime Verification for Systems with Lots of Data and its Applications”.

Funders	Funder number
National Aeronautics and Space Administration
Israel Science Foundation	1464/18

Access to Document

10.1007/978-3-030-60508-7_6

Cite this

Havelund, K., & Peled, D. (2020). BDDs for Representing Data in Runtime Verification. In J. Deshmukh, & D. Nickovic (Eds.), Runtime Verification - 20th International Conference, RV 2020, Proceedings (pp. 107-128). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12399 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-60508-7_6

Havelund, Klaus ; Peled, Doron. / BDDs for Representing Data in Runtime Verification. Runtime Verification - 20th International Conference, RV 2020, Proceedings. editor / Jyotirmoy Deshmukh ; Dejan Nickovic. Springer Science and Business Media Deutschland GmbH, 2020. pp. 107-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{567c2b6da36d4a26b34aa203a49f6006,

title = "BDDs for Representing Data in Runtime Verification",

abstract = "A BDD (Boolean Decision Diagram) is a data structure for the compact representation of a Boolean function. It is equipped with efficient algorithms for minimization and for applying Boolean operators. The use of BDDs for representing Boolean functions, combined with symbolic algorithms, facilitated a leap in the capability of model checking for the verification of systems with a huge number of states. Recently BDDs were considered as an efficient representation of data for Runtime Verification (RV). We review here the basic theory of BDDs and summarize their use in model checking and specifically in runtime verification.",

author = "Klaus Havelund and Doron Peled",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 20th International Conference on Runtime Verification, RV 2020 ; Conference date: 06-10-2020 Through 09-10-2020",

year = "2020",

doi = "10.1007/978-3-030-60508-7_6",

language = "אנגלית",

isbn = "9783030605070",

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 = "107--128",

editor = "Jyotirmoy Deshmukh and Dejan Nickovic",

booktitle = "Runtime Verification - 20th International Conference, RV 2020, Proceedings",

address = "גרמניה",

}

Havelund, K & Peled, D 2020, BDDs for Representing Data in Runtime Verification. in J Deshmukh & D Nickovic (eds), Runtime Verification - 20th International Conference, RV 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12399 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 107-128, 20th International Conference on Runtime Verification, RV 2020, Los Angeles, United States, 6/10/20. https://doi.org/10.1007/978-3-030-60508-7_6

BDDs for Representing Data in Runtime Verification. / Havelund, Klaus; Peled, Doron.
Runtime Verification - 20th International Conference, RV 2020, Proceedings. ed. / Jyotirmoy Deshmukh; Dejan Nickovic. Springer Science and Business Media Deutschland GmbH, 2020. p. 107-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12399 LNCS).

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

TY - GEN

T1 - BDDs for Representing Data in Runtime Verification

AU - Havelund, Klaus

AU - Peled, Doron

PY - 2020

Y1 - 2020

N2 - A BDD (Boolean Decision Diagram) is a data structure for the compact representation of a Boolean function. It is equipped with efficient algorithms for minimization and for applying Boolean operators. The use of BDDs for representing Boolean functions, combined with symbolic algorithms, facilitated a leap in the capability of model checking for the verification of systems with a huge number of states. Recently BDDs were considered as an efficient representation of data for Runtime Verification (RV). We review here the basic theory of BDDs and summarize their use in model checking and specifically in runtime verification.

AB - A BDD (Boolean Decision Diagram) is a data structure for the compact representation of a Boolean function. It is equipped with efficient algorithms for minimization and for applying Boolean operators. The use of BDDs for representing Boolean functions, combined with symbolic algorithms, facilitated a leap in the capability of model checking for the verification of systems with a huge number of states. Recently BDDs were considered as an efficient representation of data for Runtime Verification (RV). We review here the basic theory of BDDs and summarize their use in model checking and specifically in runtime verification.

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

U2 - 10.1007/978-3-030-60508-7_6

DO - 10.1007/978-3-030-60508-7_6

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

AN - SCOPUS:85093119439

SN - 9783030605070

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

SP - 107

EP - 128

BT - Runtime Verification - 20th International Conference, RV 2020, Proceedings

A2 - Deshmukh, Jyotirmoy

A2 - Nickovic, Dejan

PB - Springer Science and Business Media Deutschland GmbH

T2 - 20th International Conference on Runtime Verification, RV 2020

Y2 - 6 October 2020 through 9 October 2020

ER -

Havelund K, Peled D. BDDs for Representing Data in Runtime Verification. In Deshmukh J, Nickovic D, editors, Runtime Verification - 20th International Conference, RV 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2020. p. 107-128. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-60508-7_6

BDDs for Representing Data in Runtime Verification

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this