Sciweavers

6 search results - page 1 / 2
» An automatically generated and provably correct compiler for...
Sort
View
ICCL
1992
IEEE
13 years 7 months ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg
FAC
2010
259views more  FAC 2010»
13 years 2 months ago
An algebraic approach to the design of compilers for object-oriented languages
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...
Adolfo Duran, Ana Cavalcanti, Augusto Sampaio
ENTCS
2006
176views more  ENTCS 2006»
13 years 3 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
ASM
2004
ASM
13 years 9 months ago
The Cryptographic Abstract Machine
tographic Abstract Machine Dean Rosenzweig and Davor Runje University of Zagreb The Cryptographic Abstract Machine is an executional model of cryptographic actions, independent of ...
Dean Rosenzweig, Davor Runje
PLDI
2011
ACM
12 years 6 months ago
Finding and understanding bugs in C compilers
Compilers should be correct. To improve the quality of C compilers, we created Csmith, a randomized test-case generation tool, and spent three years using it to find compiler bug...
Xuejun Yang, Yang Chen, Eric Eide, John Regehr