Abstract
BRICK is a bounded reachability checker for embedded C programs. BRICK conducts a path-oriented style checking of the bounded state space of the program, that enumerates and checks all the possible paths of the program in the threshold one by one. To alleviate the path explosion problem, BRICK locates and records unsatisfiable core path segments during the checking of each path and uses them to prune the search space. Furthermore, derivative free optimization based falsification and loop induction are introduced to handle complex program features like nonlinear path conditions and loops efficiently.
This work is supported in part by the National Key Research and Development Plan (No. 2017YFA0700604), the Leading-Edge Technology Program of Jiangsu Natural Science Foundation (No. BK20202001), and the National Natural Science Foundation of China (No. 62172200, No. 61632015).
Chapter PDF
Similar content being viewed by others
References
L. Bu, et al.. BACH: Bounded Reachability Checker for Linear Hybrid Automata. In FMCAD’08, pp. 65-68.
D. Xie, et al.. SAT-LP-IIS Joint-Directed Path-Oriented Bounded Reachability Analysis of Linear Hybrid Automata. In FMSD. 45(1): 42-62, 2014.
N. Eénand N. Sörensson. An extensible SAT-solver. In SAT’03, 502-518.
S. Gao, et al.. dReal: An SMT solver for nonlinear theories over the reals. In CADE’13, 208-214.
D. Kroening, et al.. CBMC - C Bounded Model Checker. In TACAS’14: 389-391.
L. De Moura and N. Bjørner. Z3: An Efficient SMT Solver. In TACAS’08: 337-340.
P. Darke, et al.. VeriAbs: Verification by Abstraction and Test Generation - (Competition Contribution). In TACAS’18: 457-462.
L. Bu, et al.. Machine learning steered symbolic execution framework for complex software code. In Formal Aspects of Computing, 33:3, 301-323, 2021.
Y. Yu, et al.. Derivative-free optimization via classification. In AAAI’16, 2286-2292.
D. Beyer, Progress on Software Verification: SV-COMP 2022. In TACAS’22
D. Beyer, Verifiers and Validators of the 11th Intl. Competition on Software Verification (SV-COMP 2022). Zenodo, https://doi.org/10.5281/zenodo.5959149, 2022
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2022 The Author(s)
About this paper
Cite this paper
Bu, L. et al. (2022). BRICK: Path Enumeration Based Bounded Reachability Checking of C Program (Competition Contribution). In: Fisman, D., Rosu, G. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2022. Lecture Notes in Computer Science, vol 13244. Springer, Cham. https://doi.org/10.1007/978-3-030-99527-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-99527-0_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-99526-3
Online ISBN: 978-3-030-99527-0
eBook Packages: Computer ScienceComputer Science (R0)