7118 search results - page 884 / 1424 » Electrical and Computer Engineering |
106
click to vote
FOSSACS
2010
Springer
15 years 12 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
118
click to vote
TEI
2009
ACM
15 years 12 months ago
2009
ACM
Surfaces capable of modulating permeability have long been used in architecture for environmental control, but have remained largely unexplored as information displays. The advent...
132
Voted
FOSSACS
2009
Springer
15 years 12 months ago
2009
Springer
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
138
click to vote
FOSSACS
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
139
Voted
FOSSACS
2009
Springer
15 years 12 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...