Sciweavers

923 search results - page 25 / 185
» Proving the value of formal methods
Sort
View
WDAG
2007
Springer
63views Algorithms» more  WDAG 2007»
16 years 3 days ago
A Formal Analysis of the Deferred Update Technique
The deferred update technique is a widely used approach for building replicated database systems. Its fame stems from the fact that read-only transactions can execute locally to a...
Rodrigo Schmidt, Fernando Pedone
FMCAD
2006
Springer
15 years 9 months ago
Synchronous Elastic Networks
We formally define--at the stream transformer level--a class of synchronous circuits that tolerate any variability in the latency of their environment. We study behavioral properti...
Sava Krstic, Jordi Cortadella, Michael Kishinevsky...
ENTCS
2007
143views more  ENTCS 2007»
15 years 6 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
SAS
2001
Springer
121views Formal Methods» more  SAS 2001»
15 years 10 months ago
Embedding Chaos
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attra...
Natalia Sidorova, Martin Steffen
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 10 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil