Sciweavers

Share
ACTA
2005
96views more  ACTA 2005»
9 years 9 months ago
Families of automata characterizing context-sensitive languages
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
Christophe Morvan, Chloe Rispal
ACTA
2005
94views more  ACTA 2005»
9 years 9 months ago
The stuttering principle revisited
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
Antonín Kucera, Jan Strejcek
ACTA
2005
101views more  ACTA 2005»
9 years 9 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
ACTA
2005
92views more  ACTA 2005»
9 years 9 months ago
Type-based information flow analysis for the pi-calculus
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
Naoki Kobayashi
ACTA
2005
104views more  ACTA 2005»
9 years 9 months ago
Optimal recovery schemes in fault tolerant distributed computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
Kamilla Klonowska, Håkan Lennerstad, Lars Lu...
ACTA
2005
104views more  ACTA 2005»
9 years 9 months ago
Subtyping for session types in the pi calculus
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...
Simon J. Gay, Malcolm Hole
ACTA
2005
110views more  ACTA 2005»
9 years 9 months ago
Online square and cube packing
In online square packing, squares of different sizes arrive online and need to be packed into unit squares which are called bins. The goal is to minimize the number of bins used. ...
Leah Epstein, Rob van Stee
ACTA
2005
87views more  ACTA 2005»
9 years 9 months ago
Hybrid networks of evolutionary processors are computationally complete
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...
Erzsébet Csuhaj-Varjú, Carlos Mart&i...
ACTA
2005
62views more  ACTA 2005»
9 years 9 months ago
Fast allocation and deallocation with an improved buddy system
Gerth Stølting Brodal, Erik D. Demaine, J. ...
ACTA
2005
90views more  ACTA 2005»
9 years 9 months ago
MOMI: a calculus for mobile mixins
MoMi (Mobile Mixins) is a coordination language for mobile processes that communicate and exchange object-oriented code in a distributed context. MoMi's key idea is structuri...
Lorenzo Bettini, Betti Venneri, Viviana Bono
books