23 search results - page 1 / 5 » More Advice on Proving a Compiler Correct: Improve a Correct... |
PHOENIX
1991
13 years 8 months ago
1991
ESOP
1992
Springer
13 years 9 months ago
1992
Springer
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
EUROPAR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...