TY - CHAP
T1 - Synthesizing non-vacuous systems
AU - Bloem, Roderick
AU - Chockler, Hana
AU - Ebrahimi, Masoud
AU - Strichman, Ofer
PY - 2017/1/15
Y1 - 2017/1/15
N2 - Vacuity detection is a common practice accompanying model checking of hardware designs. Roughly speaking, a system satisfies a specification vacuously if it can satisfy a stronger specification obtained by replacing some of its subformulas with stronger expressions. If this happens then part of the specification is immaterial, which typically indicates that there is a problem in the model or the specification itself. We propose to apply the concept of vacuity to the synthesis problem. In synthesis, there is often a problem that the specifications are incomplete, hence under-specifying the desired behaviour, which may lead to a situation in which the synthesised system is different than the one intended by the designer. To address this problem we suggest an algorithm and a tool for non-vacuous bounded synthesis. It combines synthesis for universal and existential properties; the latter stems from the requirement to have at least one interesting witness for each strengthening of the specification. Even when the system satisfies the specification non-vacuously, our tool is capable of improving it by synthesizing a system that has additional interesting witnesses. The user decides when the system reflects their intent.
AB - Vacuity detection is a common practice accompanying model checking of hardware designs. Roughly speaking, a system satisfies a specification vacuously if it can satisfy a stronger specification obtained by replacing some of its subformulas with stronger expressions. If this happens then part of the specification is immaterial, which typically indicates that there is a problem in the model or the specification itself. We propose to apply the concept of vacuity to the synthesis problem. In synthesis, there is often a problem that the specifications are incomplete, hence under-specifying the desired behaviour, which may lead to a situation in which the synthesised system is different than the one intended by the designer. To address this problem we suggest an algorithm and a tool for non-vacuous bounded synthesis. It combines synthesis for universal and existential properties; the latter stems from the requirement to have at least one interesting witness for each strengthening of the specification. Even when the system satisfies the specification non-vacuously, our tool is capable of improving it by synthesizing a system that has additional interesting witnesses. The user decides when the system reflects their intent.
U2 - 10.1007/978-3-319-52234-0_4
DO - 10.1007/978-3-319-52234-0_4
M3 - Conference paper
AN - SCOPUS:85010704963
SN - 9783319522333
VL - 10145
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 55
EP - 72
BT - Proceedings of 18th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI)
PB - Springer‐Verlag Berlin Heidelberg
T2 - 18th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2017
Y2 - 15 January 2017 through 17 January 2017
ER -