Bubaak-SpLit: Split what you cannot verify (Competition contribution)
Chalupa M, Richter C. 2024. Bubaak-SpLit: Split what you cannot verify (Competition contribution). 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 14572, 353–358.
Download
Conference Paper
| Published
| English
Scopus indexed
Author
Chalupa, MarekISTA;
Richter, Cedric
Corresponding author has ISTA affiliation
Department
Series Title
LNCS
Abstract
BUBAAK-SpLit is a tool for dynamically splitting verification tasks into parts that can then be analyzed in parallel. It is built on top of BUBAAK, a tool designed for running combinations of verifiers in parallel. In contrast to BUBAAK, that directly invokes verifiers on the inputs, BUBAAK-SpLit first starts by splitting the input program into multiple modified versions called program splits. During the splitting process, BUBAAK-SpLit utilizes a weak verifier (in our case symbolic execution with a short timelimit) to analyze each generated program split. If the weak verifier fails on a program split, we split this program split again and start the verification process again on the generated program splits. We run the splitting process until a predefined number of hard-to-verify program splits is generated or a splitting limit is reached. During the main verification phase, we run a combination of BUBAAK-LEE and SLOWBEAST in parallel on the remaining unsolved parts of the verification task.
Publishing Year
Date Published
2024-04-05
Proceedings Title
30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Publisher
Springer Nature
Acknowledgement
This work was partially supported by the ERC-2020-AdG 10102009 grant.
Volume
14572
Page
353–358
Conference
TACAS: Tools and Algorithms for the Construction and Analysis of Systems
Conference Location
Luxembourg City, Luxembourg
Conference Date
2024-04-06 – 2024-04-11
ISBN
ISSN
eISSN
IST-REx-ID
Cite this
Chalupa M, Richter C. Bubaak-SpLit: Split what you cannot verify (Competition contribution). In: 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 14572. Springer Nature; 2024:353–358. doi:10.1007/978-3-031-57256-2_20
Chalupa, M., & Richter, C. (2024). Bubaak-SpLit: Split what you cannot verify (Competition contribution). In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 14572, pp. 353–358). Luxembourg City, Luxembourg: Springer Nature. https://doi.org/10.1007/978-3-031-57256-2_20
Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).” In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 14572:353–358. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-57256-2_20.
M. Chalupa and C. Richter, “Bubaak-SpLit: Split what you cannot verify (Competition contribution),” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 353–358.
Chalupa M, Richter C. 2024. Bubaak-SpLit: Split what you cannot verify (Competition contribution). 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 14572, 353–358.
Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).” 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 14572, Springer Nature, 2024, pp. 353–358, doi:10.1007/978-3-031-57256-2_20.
All files available under the following license(s):
Creative Commons Attribution 4.0 International Public License (CC-BY 4.0):
Main File(s)
File Name
2024_LNCS_Chalupa.pdf
577.13 KB
Access Level
Open Access
Date Uploaded
2024-04-26
MD5 Checksum
208c855c60824bec936b8d01d0396474