A compiler is fully-abstract if the compilation from source language programs to target language programs reflects and preserves behavioural equivalence. Such compilers have important security benefits, as they limit the power of an attacker interacting with the program in the target language to that of an attacker interacting with the program in the source language. Proving compiler full-abstr...

The optimization phase of a compiler is responsible for transforming an intermediate representation (IR) program into more efficient form. Modern optimizers, such as that used in the GraalVM compiler, use IR consisting sophisticated graph data structure combines flow and control one structure. As part wider project on verification passes GraalVM, this paper describes semantics its within Isabel...

As a part of the PREPARE High Performance Fortran compiler, a component has been designed and implemented which transforms an abstract, high-level internal representation of For-tran90/HPF programs to a medium-level internal form. Normalizations and pre-optimizations are applied to simplify the task of the subsequent compiler phases. This paper describes a selection of translation techniques fo...

Array-based languages, such as MATLAB and Python’s NumPy library, usually share some common features. For example, both MATLAB and Python have matrix multiplication built-in to the language and offer support for array slicing operators. Details of the exact semantics of some array operators may vary slightly, but the basic ideas are substantially similar. Languages like MATLAB and especially Py...

In this paper we apply temporal logic and model checking to analyze the structure of a source program represented as a process graph. The nodes of this graph are sequential processes whose computations are speciied as transition systems; the edges are dependence ((ow and control) relations between the computations at the nodes. This process graph is used as an intermediate source program repres...

Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, and can lead to miscompilation: the production of wrong executable code from a correct source program. Miscompilation is documented in the literature and a concern for high-assurance software, as it endangers the guarantees obtained by source-level formal verification of programs. Compiler verifi...

This paper sketches our approach to rigorously prove the correctness of a compiler executable down to its binary machine code implementation. We will emphasize the central r^ ole of partial program correctness and its preservation, which capture the intuitive correctness requirements for transformational programs and in particular for compilers on realistic machines. Vertical and horizontal com...

We have developed a veriied application proved to be both eeective and eecient. The application generates moves in the puzzle-game Nim and is coded in Piton, a language with a formal semantics and a compiler veriied to preserve its semantics on the underlying machine. The Piton compiler is targeted to the FM9001, a recently fabricated veriied microprocessor. The Nim program correctness proof ma...

Traditionally, compilers perform a dual task: they transform a program from the source code (such as C or C++) to machine code, and also optimize the program to make it run faster. Common optimizations include constant propagation and folding, method inlining, dead code elimination, and many others. Java compliers are different from C or C++ compilers: most Java compliers transform Java source ...