In this paper, we present a general framework for modularly comparing two (imperative) programs that can leverage single-program verifiers based on automated theorem provers. We formalize (i) mutual summaries for comparing the summaries of two programs, and (ii) relative termination to describe conditions under which two programs relatively terminate. The two rules together allow for checking correctness of interprocedural transformations. We also provide a general framework for dealing with unstructured control flow (including loops) in this framework. We demonstrate the usefulness and limitations of the framework for verifying equivalence, compiler optimizations, and interprocedural transformations. © 2013 Springer-Verlag.
CITATION STYLE
Hawblitzel, C., Kawaguchi, M., Lahiri, S. K., & Rebêlo, H. (2013). Towards modularly comparing programs using automated theorem provers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7898 LNAI, pp. 282–299). https://doi.org/10.1007/978-3-642-38574-2_20
Mendeley helps you to discover research relevant for your work.