Sciweavers

174 search results - page 10 / 35
» Exceptionally Safe Futures
Sort
View
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
13 years 11 months ago
Self-Stabilization of Wait-Free Shared Memory Objects
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
Jaap-Henk Hoepman, Marina Papatriantafilou, Philip...
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
Modular Checkpointing for Atomicity
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
Lukasz Ziarek, Philip Schatz, Suresh Jagannathan
FSR
2007
Springer
122views Robotics» more  FSR 2007»
14 years 1 months ago
Roving Faster Farther Cheaper
Current Mars rovers travel a few kilometers per year. Future rovers will need to travel a couple orders of magnitude faster than that in order to move from safe landing zones to a...
Matt Roman, David P. Miller, Zac White
SEFM
2008
IEEE
14 years 2 months ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto
TPHOL
2009
IEEE
14 years 2 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler