Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IANDC
2007
84views more  IANDC 2007»
10 years 1 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
IANDC
2007
126views more  IANDC 2007»
10 years 1 months ago
Alternating two-way AC-tree automata
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...
Kumar Neeraj Verma, Jean Goubault-Larrecq
IANDC
2007
132views more  IANDC 2007»
10 years 1 months ago
An automata-theoretic approach to constraint LTL
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...
Stéphane Demri, Deepak D'Souza
IANDC
2007
106views more  IANDC 2007»
10 years 1 months ago
Tyrolean termination tool: Techniques and features
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...
Nao Hirokawa, Aart Middeldorp
IANDC
2007
62views more  IANDC 2007»
10 years 1 months ago
Unfolding semantics of graph transformation
Paolo Baldan, Andrea Corradini, Ugo Montanari, Lei...
IANDC
2007
133views more  IANDC 2007»
10 years 1 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
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 ...
Alexander Rabinovich
IANDC
2007
106views more  IANDC 2007»
10 years 1 months ago
Extended visual cryptography schemes
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 ...
Andreas Klein, Markus Wessler
IANDC
2007
85views more  IANDC 2007»
10 years 1 months ago
Nominal rewriting
Maribel Fernández, Murdoch Gabbay
IANDC
2007
127views more  IANDC 2007»
10 years 1 months ago
Temporal logics with incommensurable distances are undecidable
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...
Alexander Rabinovich
IANDC
2007
96views more  IANDC 2007»
10 years 1 months ago
A general mathematics of names
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...
Murdoch Gabbay
books