Sciweavers

691 search results - page 109 / 139
» Automatically Proving Linearizability
Sort
View
FAC
2008
139views more  FAC 2008»
13 years 10 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 10 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 10 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
JNW
2008
171views more  JNW 2008»
13 years 10 months ago
The Necessity of Semantic Technologies in Grid Discovery
Service discovery and its automation are some of the key features that a large scale, open distributed system must provide so that clients and users may take advantage of shared re...
Serena Pastore
ENTCS
2007
137views more  ENTCS 2007»
13 years 10 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...