A Theorem Prover for Boolean BI

作者：Park Jonghyun^*; Seo Jeongbong; Park Sungwoo

来源：ACM Sigplan Notices, 2013, 48(1): 219-231.

DOI：10.1145/2480359.2429095

• Verification
• Separation logic
• Boolean BI
• Theorem prover
• Nested sequent calculus

While separation logic is acknowledged as an enabling technology for large-scale program verification, most of the existing verification tools use only a fragment of separation logic that excludes separating implication. As the first step towards a verification tool using full separation logic, we develop a nested sequent calculus for Boolean BI (Bunched Implications), the underlying theory of separation logic, as well as a theorem prover based on it. A salient feature of our nested sequent calculus is that its sequent may have not only smaller child sequents but also multiple parent sequents, thus producing a graph structure of sequents instead of a tree structure. Our theorem prover is based on backward search in a refinement of the nested sequent calculus in which weakening and contraction are built into all the inference rules. We explain the details of designing our theorem prover and provide empirical evidence of its practicality.

• 出版日期2013-1