Sciweavers

537 search results - page 22 / 108
» Compiling Exceptions Correctly
Sort
View
ENTCS
2006
137views more  ENTCS 2006»
13 years 7 months ago
Compiling Esterel into Static Discrete-Event Code
Executing concurrent specifications on sequential hardware is important for both simulation of systems that are eventually implemented on concurrent hardware and for those most co...
Stephen A. Edwards, Vimal Kapadia, Michael Halasz
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
13 years 12 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
EMSOFT
2005
Springer
14 years 1 months ago
HAIL: a language for easy and correct device access
It is difficult to write device drivers. One factor is that writing low-level code for accessing devices and manipulating their registers is tedious and error-prone. For many syst...
Jun Sun 0002, Wanghong Yuan, Mahesh Kallahalla, Na...
FM
1999
Springer
104views Formal Methods» more  FM 1999»
13 years 12 months ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
Markus Müller-Olm, Andreas Wolf