Work

Bytecode Analysis for Proof Carrying Code

Year: 2005

Type: article

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.

Source: Electronic Notes in Theoretical Computer Science

DOI: 10.1016/j.entcs.2005.02.040

Authors: Martin Wildmoser, Amine Chaieb, Tobias Nipkow

Institution: Technical University of Munich

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2066946201

FWCI: 8.078

Cites: 16

Cited by: 26

Related to: 10