36 search results - page 4 / 8 » concur 2010 |
106
click to vote
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
101
click to vote
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are ...
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
We consider a calculus for multiparty sessions with delegation, enriched with security levels for session participants and data. We propose a type system that guarantees both sessi...