TY - GEN
T1 - Syntax-Guided Synthesis for Lemma Generation in Hardware Model Checking
AU - Zhang, Hongce
AU - Gupta, Aarti
AU - Malik, Sharad
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - In this work we propose to use Syntax-Guided Synthesis (SyGuS) for lemma generation in a word-level IC3/PDR framework for bit-vector problems. Hardware model checking is moving from bit-level to word-level problems, and it is expected that model checkers can benefit when such high-level information is available. However, for bit-vectors, it is challenging to find a good word-level interpolation strategy for lemma generation, which hinders the use of word-level IC3/PDR algorithms. Our SyGuS-based procedure, SyGuS- APDR, is tightly integrated with an existing word-level IC3/PDR framework APDR. It includes a predefined grammar template and term production rules for generating candidate lemmas, and does not rely on any extra human inputs. Our experiments on benchmarks from the hardware model checking competition show that SyGuS- APDR can outperform state-of-the-art Constrained Horn Clause (CHC) solvers, including those that implement bit-level IC3/PDR. We also show that SyGuS- APDR and these CHC solvers can solve many instances faster than other leading word-level hardware model checkers that are not CHC-based. As a by-product of our work, we provide a translator Btor2CHC that enables the use of CHC solvers for general hardware model checking problems, and contribute representative bit-vector benchmarks to the CHC-solver community.
AB - In this work we propose to use Syntax-Guided Synthesis (SyGuS) for lemma generation in a word-level IC3/PDR framework for bit-vector problems. Hardware model checking is moving from bit-level to word-level problems, and it is expected that model checkers can benefit when such high-level information is available. However, for bit-vectors, it is challenging to find a good word-level interpolation strategy for lemma generation, which hinders the use of word-level IC3/PDR algorithms. Our SyGuS-based procedure, SyGuS- APDR, is tightly integrated with an existing word-level IC3/PDR framework APDR. It includes a predefined grammar template and term production rules for generating candidate lemmas, and does not rely on any extra human inputs. Our experiments on benchmarks from the hardware model checking competition show that SyGuS- APDR can outperform state-of-the-art Constrained Horn Clause (CHC) solvers, including those that implement bit-level IC3/PDR. We also show that SyGuS- APDR and these CHC solvers can solve many instances faster than other leading word-level hardware model checkers that are not CHC-based. As a by-product of our work, we provide a translator Btor2CHC that enables the use of CHC solvers for general hardware model checking problems, and contribute representative bit-vector benchmarks to the CHC-solver community.
KW - Bit-vector theory
KW - CHC solver
KW - Hardware model checking
KW - Lemma generation
KW - Syntax-guided synthesis (SyGuS)
UR - http://www.scopus.com/inward/record.url?scp=85101518580&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85101518580&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-67067-2_15
DO - 10.1007/978-3-030-67067-2_15
M3 - Conference contribution
AN - SCOPUS:85101518580
SN - 9783030670665
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 325
EP - 349
BT - Verification, Model Checking, and Abstract Interpretation - 22nd International Conference, VMCAI 2021, Proceedings
A2 - Henglein, Fritz
A2 - Shoham, Sharon
A2 - Vizel, Yakir
PB - Springer Science and Business Media Deutschland GmbH
T2 - 22nd International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2021
Y2 - 17 January 2021 through 19 January 2021
ER -