Verified Bytecode Verifiers

Nipkow, Tobias

doi:10.1007/3-540-45315-6_23

Cited by 35 publications

(19 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…this representation that we prove the local generic solver RLD correct. Related formal correctness proofs have been provided for variants of Kildall's algorithm for dataflow analysis [2,4,11,13] This fixpoint algorithm is neither generic nor local. It also exploits variable dependences which, however, are explicitly given through the control-flow graph.…”

Section: Introductionmentioning

confidence: 99%

Verifying a Local Generic Solver in Coq

Hofmann¹,

Karbyshev

Seidl

2010

Static Analysis

View full text Add to dashboard Cite

Abstract. Fixpoint engines are the core components of program analysis tools and compilers. If these tools are to be trusted, special attention should be paid also to the correctness of such solvers. In this paper we consider the local generic fixpoint solver RLD which can be applied to constraint systems x fx, x ∈ V , over some lattice D where the right-hand sides fx are given as arbitrary functions implemented in some specification language. The verification of this algorithm is challenging, because it uses higher-order functions and relies on side effects to track variable dependences as they are encountered dynamically during fixpoint iterations. Here, we present a correctness proof of this algorithm which has been formalized by means of the interactive proof assistant Coq.

show abstract

Section: Introductionmentioning

confidence: 99%

Verifying a Local Generic Solver in Coq

Hofmann¹,

Karbyshev

Seidl

2010

Static Analysis

View full text Add to dashboard Cite

show abstract

“…In [6,11] a large part of the JVM and of the verifier has been modelled within the theorem prover Isabelle/HOL. Then the soundness of the verifier has been formally proved by the tool.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

An Abstract Interpretation Approach for Enhancing the Java Bytecode Verifier

Barbuti¹,

Francesco²,

Tesei³

2009

The Computer Journal

View full text Add to dashboard Cite

The Java virtual machine embodies a verifier that performs a set of checks on Java bytecode programs before their execution. The verifier carries out an efficient data-flow analysis applied to a typelevel abstract interpretation of the code. The implementations of the bytecode verifier presented a significant problem with programs compiled with the Sun Java compiler (until version 1.4.1): there were legal Java programs which were correctly compiled into a bytecode that was rejected by the verifier. The problem was fixed by removing, in version 1.4.2 and following, some interesting features in the compilation of the try-finally Java construct. Because removing such features has a cost in terms of memory space, in this paper we propose to enhance the bytecode verifier to accept such programs, maintaining the space efficiency of the previous versions of the compiler. We define an abstract interpretation framework in which we model the enhanced version of the verifier. The defined abstract interpretation framework can be considered a good basis for other static analyses of bytecode programs.

show abstract

“…Challenged by the lack of precision in the reference publications of Sun's verifier [9,31,14], many researchers have published rational reconstructions, formalizations, and formal proofs of correctness of various subsets of Sun's verifier [6,22,21,23,7,18,25]. (See Hartel and Moreau's survey [12] for a more detailed description.)…”

Section: Formalizations Of Sun's Verifiermentioning

confidence: 99%

Bytecode verification on Java smart cards

Leroy

2002

Softw Pract Exp

View full text Add to dashboard Cite

This article presents a novel approach to the problem of bytecode verification for Java Card applets. By relying on prior off-card bytecode transformations, we simplify the bytecode verifier and reduce its memory requirements to the point where it can be embedded on a smart card, thus increasing significantly the security of post-issuance downloading of applets on Java Cards. This article describes the on-card verification algorithm and the off-card code transformations, and evaluates experimentally their impact on applet code size.

show abstract

Verified Bytecode Verifiers

Cited by 35 publications

References 13 publications

Verifying a Local Generic Solver in Coq

Verifying a Local Generic Solver in Coq

An Abstract Interpretation Approach for Enhancing the Java Bytecode Verifier

Bytecode verification on Java smart cards

Contact Info

Product

Resources

About