Sciweavers

1137 search results - page 165 / 228
» Partial Program Admission
Sort
View
ICALP
1994
Springer
15 years 10 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
POPL
1993
ACM
15 years 10 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
POS
1994
Springer
15 years 10 months ago
Changing Persistent Applications
During the lifetime of an application, the objects and bindings in a persistent store may require modification in order to fix bugs or incorporate changes. Two mechanisms, Octopus...
Alex Farkas, Alan Dearle
ICFEM
2007
Springer
15 years 10 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
DATE
2004
IEEE
136views Hardware» more  DATE 2004»
15 years 10 months ago
Compact Binaries with Code Compression in a Software Dynamic Translator
Embedded software is becoming more flexible and adaptable, which presents new challenges for management of highly constrained system resources. Software dynamic translation is a t...
Stacey Shogan, Bruce R. Childers