We describe the development of a Java bytecode optimisation algorithm by the methodology of program extraction. We develop the algorithm as a collection of proofs and definitions in the Coq proof assistant, and then use Coq’s extraction mechanism to automatically generate a program in OCaml. The extraction methodology guarantees that this program is correct. We discuss the feasibility of the methodology and suggest some improvements that could be made
AbstractThe Java Card language is a trimmed down dialect of Java aimed at programming smart cards. J...
We address in this paper the problem of statically determining whether a JavaCard applet may produce...
This paper presents a novel profiling approach, which is entirely based on program transformation te...
We present a formalisation of the bytecode optimisation of Sun's Java Card language from the class f...
AbstractThis article presents a formalisation of the bytecode optimisation of Sun's Java Card langua...
Subroutines seem to be more a problem than a solution for the Byte Code Verifier's world, especially...
In this paper we propose an strategy for the design of compilers correct by construction for object-...
In this paper, we describe the application of the interactive theorem prover Coq to the security ana...
Bytecode verification is one of the key security functions of several architectures for mobile and e...
This paper concentrates on optimizations which rely on the knowledge of the target architecture, so ...
. The term "Java" is used to denote two different concepts: the language itself and the re...
This paper deals with the Java bytecode size optimization. It describes the Java Virtual Machine and...
This dissertation focuses on runtime optimization of Java programs, based on the application of code...
AbstractJava Cards are a new generation of smart cards that use the Java programming language. As sm...
This paper presents Soot, a framework for optimizing Java bytecode. The framework is implemented ...
AbstractThe Java Card language is a trimmed down dialect of Java aimed at programming smart cards. J...
We address in this paper the problem of statically determining whether a JavaCard applet may produce...
This paper presents a novel profiling approach, which is entirely based on program transformation te...
We present a formalisation of the bytecode optimisation of Sun's Java Card language from the class f...
AbstractThis article presents a formalisation of the bytecode optimisation of Sun's Java Card langua...
Subroutines seem to be more a problem than a solution for the Byte Code Verifier's world, especially...
In this paper we propose an strategy for the design of compilers correct by construction for object-...
In this paper, we describe the application of the interactive theorem prover Coq to the security ana...
Bytecode verification is one of the key security functions of several architectures for mobile and e...
This paper concentrates on optimizations which rely on the knowledge of the target architecture, so ...
. The term "Java" is used to denote two different concepts: the language itself and the re...
This paper deals with the Java bytecode size optimization. It describes the Java Virtual Machine and...
This dissertation focuses on runtime optimization of Java programs, based on the application of code...
AbstractJava Cards are a new generation of smart cards that use the Java programming language. As sm...
This paper presents Soot, a framework for optimizing Java bytecode. The framework is implemented ...
AbstractThe Java Card language is a trimmed down dialect of Java aimed at programming smart cards. J...
We address in this paper the problem of statically determining whether a JavaCard applet may produce...
This paper presents a novel profiling approach, which is entirely based on program transformation te...