Sciweavers

2335 search results - page 404 / 467
» Functional Differentiation of Computer Programs
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
13 years 9 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
JOT
2007
124views more  JOT 2007»
13 years 9 months ago
Displaying Updated Stock Quotes
This paper describes how to extract stock quote data and display it with a dynamic update (using free, but delayed data streams). As a part of the architecture of the program, we ...
Douglas Lyon
CALCO
2009
Springer
138views Mathematics» more  CALCO 2009»
14 years 4 months ago
Kleene Monads: Handling Iteration in a Framework of Generic Effects
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
Sergey Goncharov, Lutz Schröder, Till Mossako...
PPOPP
2012
ACM
12 years 5 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
EMSOFT
2004
Springer
14 years 3 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross