This paper describes how program-checking can be used to signiicantly reduce the amount of veriication work to establish the implementation correctness of software systems which may be partly generated by unveriied construction tools. We show the practicability of our approach with an application to the construction of veriied compiler back-ends. The basic idea of program-checking is to use an ...

The current paper reports on the first results of building a retargetable compiler for reconfigurable computing. The discussed research is part of a larger project whose main objective is to develop a semi-automatic tool platform for reconfigurable computing supporting a fully integrated design environment. It constitutes the first attempt to provide a workbench that will cover the entire desig...

We have been developing a declarative approach to writing parallel programs, in a language called Kanor, with the goal of addressing the productivity challenge in parallel programming. A guiding principle in the design of our approach has been to abstract away those details that a compiler can feasibly and effectively handle, while still affording the programmers the ability to optimize their p...

Formal methods are not used widely in industrial software development, because the overhead of formally proving program properties is generally not acceptable. In this paper we present an ongoing research project to make the construction of such proofs easier by embedding the proof system into a compiler. Using the introduced new programming language, the programmer writes formal specification ...

Current compilers fail to deliver satisfactory levels of performance on modern processors, due to rapidly evolving hardware, fixed and black-box optimization heuristics, simplistic hardware models, inability to fine-tune the application of transformations, and highly dynamic behavior of the system. This analysis suggests to revisit the structure and interactions of optimizing compilers. Buildin...

Type-preserving (or typed) compilation uses typing derivations to certify correctness properties of compilation. We have designed and implemented a type-preserving compiler for a simply-typed dialect of Prolog we call T-Prolog. The crux of our approach is a new certifying abstract machine which we call the TypedWarren Abstract Machine (TWAM). The TWAMhas a dependent type system strong enough to...

The MirvKit compiler framework provides a set of abstractions that includes a language for intermediate program representation, compilation methodology and an object model for the implementation. These aspects of the framework were developed concurrently, each influencing the others. A single design pattern emerged from this evolutionary process that forms the core of the compiler. This pattern...

This paper presents a real-time programming language, including concurrency, which could be used in the formal development of embedded systems. The semantics of the language is provided in the form of a time interval semantics and also a number of algebraic re nement laws. The laws allow convenient reasoning and transformation of programs. In particular, a compiler for a sequential subset of th...

We describe a C compiler tailored to save space in executables. It accepts an arbitrary C program and customizes for it a compact interpreter and interpretive code. In a typical application, the compiler halves its own size. We have written programs that collaborate to compile an arbitrary C program into a compact interpreter and interpretive code. It improves on prior efforts to automatically ...

In this paper, we present a novel compiler technique that provides the capability to guarantee a different memory consistency model for different variables within the same shared memory parallel program. Programmers need only focus on their parallel algorithm and which variables can tolerate the use of old values, while the compiler automatically guarantees sequential consistency for all remain...