Towards modularly comparing programs using automated theorem provers

Authors:
Chris Hawblitzel;Ming Kawaguchi;Shuvendu K. Lahiri;Henrique Rebêlo
Affiliations:
Microsoft Research, Redmond, WA;University of California, San Diego;Microsoft Research, Redmond, WA;Federal University of Pernambuco, Brazil
Venue:
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Year:
2013

Citing 12
Cited 0

Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Translation Validation

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Automatically proving the correctness of compiler optimizations

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Translation and Run-Time Validation of Loop Transformations

Formal Methods in System Design
Weakest-precondition of unstructured programs

PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inference rules for proving the equivalence of recursive procedures

Acta Informatica
Equality saturation: a new approach to optimization

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving optimizations correct using parameterized program equivalence

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Evaluating value-graph translation validation for LLVM

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
SYMDIFF: a language-agnostic semantic diff tool for imperative programs

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.