434 search results - page 35 / 87 » Monadic Bounded Algebras |
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
ACTAC
2002
13 years 9 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
FSTTCS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...