Boolean BI 논리를 위한 정리 증명기

Abstract

While separation logic is acknowledged as an enabling technology for large-scale program verification, most of the existing verification tools use only a fragment ofseparation logic that excludes separating implication. As the first step towards a verification tool using full separation logic, we develop a nested sequent calculusfor 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 sequentcalculus is that its sequent may have not only smaller child sequents but also multiple parent sequents, thus producing a graph structure of sequents instead ofa 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.