4917 search results - page 754 / 984 » Software Engineering is Not Computer Science |
129
click to vote
FOSSACS
2010
Springer
16 years 1 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...
152
click to vote
FOSSACS
2009
Springer
16 years 1 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...
163
click to vote
FOSSACS
2009
Springer
16 years 1 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...
169
click to vote
FOSSACS
2009
Springer
16 years 1 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...
149
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...