Bytecode Analysis for Proof Carrying Code

Authors:
Martin Wildmoser;Amine Chaieb;Tobias Nipkow
Affiliations:
Institut für Informatik, Technische Universität München;Institut für Informatik, Technische Universität München;Institut für Informatik, Technische Universität München
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 11

From system F to typed assembly language

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

Principles of Program Analysis
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Compiling with proofs

Compiling with proofs
The open verifier framework for foundational verifiers

TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
Asserting bytecode safety

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Certificate translation for optimizing compilers

ACM Transactions on Programming Languages and Systems (TOPLAS)
A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Certified result checking for polyhedral analysis of bytecode programs

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
A provably correct stackless intermediate representation for Java bytecode

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
An Abstract Model of Certificate Translation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Certificate translation for optimizing compilers

SAS'06 Proceedings of the 13th international conference on Static Analysis
An incremental approach to abstraction-carrying code

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proof-producing program analysis

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Asserting bytecode safety

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Out of annotated programs proof carrying code systems construct and prove verification conditions that guarantee a given safety policy. The annotations may come from various program analyzers and must not be trusted as they need to be verified. A generic verification condition generator can be utilized such that a combination of annotations is verified incrementally. New annotations may be verified by using previously verified ones as trusted facts. We show how results from a trusted type analyzer may be combined with untrusted interval analysis to automatically verify that bytecode programs do not overflow. All trusted components are formalized and verified in Isabelle/HOL.