Abstract
AbstractInteractive theorem provers (ITPs) exploit the collaboration between humans and computers, enabling proof of complex theorems. Further, ITPs allow extraction of provably correct implementations from proofs. However, often, the extracted code interface with external libraries containing real-life complexities—proprietary library calls, remote/cloud APIs, complex models like ML models, inline assembly, highly non-linear arithmetic, vector instructions etc. We refer to such functions/operations as closed-box components. For such components, the user has to provide appropriate assumed lemmas to model the behavior of these functions. However, we found instances where these assumed lemmas are inconsistent with the actual semantics of these closed-box components. Hence, even correct-by-construction code extracted from an ITP may still behave incorrectly when interfaced with such closed-box components.To this end, we propose StarFuzz, that allows the $$\text {F}^\star $$
F
⋆
interactive theorem prover to provide better end-to-end assurance on the application— even when interfaced with the closed-box components. Under the hood, StarFuzz rides on Sādhak, an SMT solver that combines fuzz testing to allow satisfiability checking over closed-box components. On the $$\text {F}^\star $$
F
⋆
library that includes external implementations in OCaml, StarFuzz discovered four bugs—one bug that revealed an error on the assumed lemmas for a closed-box function, and three bugs in the external implementations of these components.
Publisher
Springer Nature Switzerland
Reference25 articles.
1. Agda Development Team: The Agda wiki. Chalmers University of Technology (2007–2021). http://wiki.portal.chalmers.se/agda/pmwiki.php/
2. Aguirre, A.: Towards a provably correct encoding from F* to SMT. Master’s thesis, Université Paris, vol. 7 (2016)
3. Albarghouthi, A., Dillig, I., Gurfinkel, A.: Maximal specification synthesis. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, pp. 789–801. Association for Computing Machinery, New York (2016). ISBN 9781450335492. https://doi.org/10.1145/2837614.2837628
4. Bhargavan, K., et al.: Implementing and proving the TLS 1.3 record layer. Cryptology ePrint Archive, Paper 2016/1178 (2016). https://eprint.iacr.org/2016/1178
5. LNCS;P Chatterjee,2022