11 search results - page 2 / 3 » Semantic Foundations of Binding Time Analysis for Imperative... |
EMSOFT
2006
Springer
13 years 7 months ago
2006
Springer
Distributed real-time and embedded (DRE) systems have stringent constraints on timeliness and other properties whose assurance is crucial to correct system behavior. Formal tools ...
SAC
1996
ACM
13 years 10 months ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
LOPSTR
1992
Springer
13 years 9 months ago
1992
Springer
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
POPL
2004
ACM
14 years 6 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
SIGSOFT
2007
ACM
14 years 6 months ago
2007
ACM
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...