156
Voted
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
120
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
132
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory o...
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
130
Voted
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
Tree automata with one memory have been introduced in
152
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
121
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...