Debugging Program Verification Proof Scripts (Tool Paper)
Bernhard Beckert, Sarah Grebing, and Alexander Weigl

TL;DR
This paper introduces an offline, replay debugger for proof scripts in interactive program verification, aiding users in analyzing and debugging proof attempts more effectively, based on software debugging principles.
Contribution
It presents a novel debugger tool for proof scripts that adapts software debugging techniques to improve proof analysis in verification systems.
Findings
Supports proof script analysis and debugging
Built on top of KeY for Java program verification
Designed to be adaptable to other provers
Abstract
Interactive program verification is characterized by iterations of unfinished proof attempts. To support the process of constructing a complete proof, many interactive program verification systems offer a proof scripting language as a text-based way to describe the non-automatic steps in a proof. Such scripting languages are beneficial, but users spent a lot of effort on inspecting proof scripts and the proofs they construct to detect the cause when a proof attempt is unsuccessful and leads to unintended proof states. We present an offline and replay debugger to support the user in analyzing proof attempts performed with proof scripts. This debugger adapts successful concepts from software debugging to the area of proof script debugging. The tool is built on top of KeY, a system for deductive verification of Java programs. The debugger and its graphical user interface are designed to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Logic, programming, and type systems · Advanced Malware Detection Techniques
