Proof-producing program analysis

Authors:
Amine Chaieb
Affiliations:
Institut für Informatik, Technische Universität München
Venue:
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Year:
2006

Citing 8
Cited 5

Introduction to algorithms

Introduction to algorithms
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Autarkic Computations in Formal Proofs

Journal of Automated Reasoning
A machine-checked model for a Java-like language, virtual machine, and compiler

ACM Transactions on Programming Languages and Systems (TOPLAS)
Bytecode Analysis for Proof Carrying Code

Electronic Notes in Theoretical Computer Science (ENTCS)
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Proof optimization for partial redundancy elimination

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Certificate translation in abstract interpretation

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Combining a verification condition generator for a bytecode language with static analyses

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Certificate translation for the verification of concurrent programs

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
An Abstract Model of Certificate Translation

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proof-producing program analysis augments the invariants inferred by an abstract interpreter with their correctness proofs. If these invariants are precise enough to guarantee safety, this method is an automatic verification tool. We present proof-synthesis algorithms for a simple flow chart language and domains ${\mathcal{V}}\to{\mathbb{V}}$ mapping variables to abstract values and discuss some benefits for proof carrying code systems. Our work has been carried out in Isabelle/HOL and incorporated within a verified proof carrying code system.