Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
Specializing programs by partial evaluation is well defined extensionally, but in practice no intensional properties, such as what the specialized programs will look like or how ...
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
The task of mappingbetween source programs and machine code, once the code has been optimizedand transformed by a compiler is often di cult. Yet there are many instances, such as ...
A partial evaluator is said to be Jones-optimal if the result of specializing a self-interpreter with respect to a source program is textually identical to the source program, modu...
We present a pointer analysis algorithm designed for source-to-source transformations. Existing techniques for pointer analysis apply a collection of inference rules to a dismantl...
Marcio Buss, Stephen A. Edwards, Bin Yao, Dan G. W...
—By utilizing XML representations of source programs under test, a new approach is proposed to concisely implement some prototypes for TACCLE, a software testing methodology. The...
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...