CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
CONCUR
2010
Springer
13 years 6 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
13 years 6 months ago
2010
Springer
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
ned Monotonic Abstraction: a CEGAR for Parameterized Verification Parosh Aziz Abdulla1 , Yu-Fang Chen2 , Giorgio Delzanno3 , Fr
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper we introduce a real-time extension of the concurrent object modeling language Creol which is based on duration statements indicating best and worst case exe...
CONCUR
2010
Springer
13 years 6 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...
CONCUR
2010
Springer
13 years 6 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...