Sciweavers

12519 search results - page 2289 / 2504
» Approximation Problems Categories
Sort
View
ICFP
2006
ACM
16 years 5 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
ICFP
2005
ACM
16 years 5 months ago
Continuations from generalized stack inspection
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
Greg Pettyjohn, John Clements, Joe Marshall, Shrir...
ICFP
2004
ACM
16 years 5 months ago
Slideshow: functional presentations
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
Robert Bruce Findler, Matthew Flatt
ICFP
2004
ACM
16 years 5 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao
ICFP
2003
ACM
16 years 5 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
« Prev « First page 2289 / 2504 Last » Next »