Machine-Checkable Correctness Proofs for Intra-procedural Dataflow Analyses

Authors:
Alexandru Sălcianu;Konstantine Arkoudas
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Fax: 617-253-1221;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Fax: 617-253-1221
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 13
Cited 0

A relational framework for abstract interpretation

on Programs as data objects
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
VLISP: a verified implementation of Scheme

Lisp and Symbolic Computation
Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis

Principles of Program Analysis
Generation of Efficient Interprocedural Analyzers with PAG

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Verified bytecode verifiers

Theoretical Computer Science - Foundations of software science and computation structures
Combining superposition, sorts and splitting

Handbook of automated reasoning
Automatically proving the correctness of compiler optimizations

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Structure-preserving binary relations for program abstraction

The essence of computation
Denotational proof languages

Denotational proof languages
Automated soundness proofs for dataflow analyses and transformations via local rules

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes our experience using the interactive theorem prover Athena for proving the correctness of abstract interpretation-based dataflow analyses. For each analysis, our methodology requires the analysis designer to formally specify the property lattice, the transfer functions, and the desired modeling relation between the concrete program states and the results computed by the analysis. The goal of the correctness proof is to prove that the desired modeling relation holds. The proof allows the analysis clients to rely on the modeling relation for their own correctness. To reduce the complexity of the proofs, we separate the proof of each dataflow analysis into two parts: a generic part, proven once, independent of any specific analysis; and several analysis-specific conditions proven in Athena.