Equality-Based Translation Validator for LLVM

Stepp, Michael; Tate, Ross; Lerner, Sorin

doi:10.1007/978-3-642-22110-1_59

Cited by 48 publications

(56 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proving the equivalence of programs has several important applications, including, but not limited to, algorithm recognition [2], regression checking [11,13,25], compiler optimization verification [18,24] and validation [31,33,41,44,47,48], and information flow proofs [5,43].…”

Section: Introductionmentioning

confidence: 99%

Automatic Equivalence Checking of UF+IA Programs

Lopes

Monteiro

2013

Model Checking Software

View full text Add to dashboard Cite

Abstract. Proving the equivalence of programs has several important applications, including algorithm recognition, regression checking, compiler optimization verification, and information flow checking. Despite being a topic with so many important applications, program equivalence checking has seen little advances over the past decades due to its inherent (high) complexity. In this paper, we propose, to the best of our knowledge, the first algorithm for the automatic verification of partial equivalence of two programs over the combined theory of uninterpreted function symbols and integer arithmetic (UF+IA). The proposed algorithm supports, in particular, programs with nested loops. The crux of the technique is a transformation of uninterpreted functions (UFs) applications into integer polynomials, which enables the summarization of loops with UF applications using recurrences. The equivalence checking algorithm then proceeds on loop-free, integer only programs. We implemented the proposed technique in CORK, a tool that automatically verifies the correctness of compiler optimizations, and we show that it can prove more optimizations correct than state-of-the-art techniques.

show abstract

Section: Introductionmentioning

confidence: 99%

Automatic Equivalence Checking of UF+IA Programs

Lopes

Monteiro

2013

Model Checking Software

View full text Add to dashboard Cite

show abstract

“…Eventually, it should be possible to shift all CompCert optimisations into the SSA middle-end. In the longer term, it would be appealing to apply our methods to LLVM, building on [23,21,26].…”

Section: Discussionmentioning

confidence: 99%

“…But they do not prove the semantics preservation of the optimizations. Stepp et al [21] report on a translation validator for LLVM. Their validator uses Equality Saturation [22], which views optimizations as equality analyses.…”

Section: Related Workmentioning

confidence: 99%

A Formally Verified SSA-Based Middle-End

Barthe

Demange

Pichardie

2012

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. CompCert is a formally verified compiler that generates compact and efficient PowerPC, ARM and x86 code for a large and realistic subset of the C language. However, CompCert foregoes using Static Single Assignment (SSA), an intermediate representation that allows for writing simpler and faster optimizers, and is used by many compilers. In fact, it has remained an open problem to verify formally a SSA-based compiler middle-end. We report on a formally verified, SSAbased, middle-end for CompCert. Our middle-end performs conversion from CompCert intermediate form to SSA form, optimization of SSA programs, including Global Value Numbering, and transforming out of SSA to intermediate form. In addition to provide the first formally verified SSA-based middle-end, we address two problems raised by Leroy [13]: giving a simple and intuitive formal semantics to SSA, and leveraging the global properties of SSA to reason locally about program optimizations.

show abstract

“…Translation validation (e.g., [32,35,41,42]) is a set of techniques that attempt to prove that compiler optimizations did not change the semantics of the program given as input (after the optimizer run). Our work is similar in spirit to translation validation since we use an off-the-shelf, untrusted compiler and validate whether the code it produced satisfies the security properties we are interested in.…”

Section: Related Workmentioning

confidence: 99%

A design and verification methodology for secure isolated regions

et al. 2016

View full text Add to dashboard Cite

Hardware support for isolated execution (such as Intel SGX) enables development of applications that keep their code and data confidential even while running on a hostile or compromised host. However, automatically verifying that such applications satisfy confidentiality remains challenging. We present a methodology for designing such applications in a way that enables certifying their confidentiality. Our methodology consists of forcing the application to communicate with the external world through a narrow interface, compiling it with runtime checks that aid verification, and linking it with a small runtime library that implements the interface. The runtime library includes core services such as secure communication channels and memory management. We formalize this restriction on the application as Information Release Confinement (IRC), and we show that it allows us to decompose the task of proving confidentiality into (a) one-time, human-assisted functional verification of the runtime to ensure that it does not leak secrets, (b) automatic verification of the application's machine code to ensure that it satisfies IRC and does not directly read or corrupt the runtime's internal state. We present /CONFIDENTIAL: a verifier for IRC that is modular, automatic, and keeps our compiler out of the trusted computing base. Our evaluation suggests that the methodology scales to real-world applications.

show abstract

Equality-Based Translation Validator for LLVM

Abstract: We updated our Peggy tool, previously presented in [7], to perform translation validation for the LLVM compiler using a technique called Equality Saturation. We present the tool, and illustrate its effectiveness at doing translation validation on SPEC 2006 benchmarks.

Cited by 48 publications

References 8 publications

Automatic Equivalence Checking of UF+IA Programs

Automatic Equivalence Checking of UF+IA Programs

A Formally Verified SSA-Based Middle-End

A design and verification methodology for secure isolated regions

Contact Info

Product

Resources

About