83
Voted
IANDC
2007
15 years 17 days ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
84
Voted
IANDC
2007
15 years 17 days ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
109
click to vote
IANDC
2007
15 years 17 days ago
2007
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
102
Voted
IANDC
2007
15 years 17 days ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
49
Voted
IANDC
2007
15 years 17 days ago
2007
115
click to vote
IANDC
2007
15 years 17 days ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
80
Voted
IANDC
2007
15 years 17 days ago
2007
Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image ...
107
click to vote
IANDC
2007
15 years 17 days ago
2007
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
118
Voted
IANDC
2007
15 years 17 days ago
2007
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...