Sciweavers

103 search results - page 5 / 21
» Code Generation via Higher-Order Rewrite Systems
Sort
View
TISSEC
2002
75views more  TISSEC 2002»
13 years 9 months ago
Termination in language-based systems
Language runtime systems are increasingly being embedded in systems to support runtime extensibility via mobile code. Such systems raise a number of concerns when the code running...
Algis Rudys, Dan S. Wallach
TACAS
2007
Springer
108views Algorithms» more  TACAS 2007»
14 years 3 months ago
State of the Union: Type Inference Via Craig Interpolation
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
PPDP
2005
Springer
14 years 3 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
KBSE
1997
IEEE
14 years 2 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
OSDI
1996
ACM
13 years 11 months ago
Online Data-Race Detection via Coherency Guarantees
We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We ...
Dejan Perkovic, Peter J. Keleher