Abstract. We present locality-based abstractions, in which a set of states of a distributed system is abstracted to the collection of views that some observers have of the states. Special cases of locality-abstractions have been used in different contexts (planning, analysis of concurrent programs, concurrency theory). In this paper we give a general definition in the context of abstract interpretation, show that arbitrary locality-based abstractions are hard to compute in general, and provide two solutions to this problem. The solutions are evaluated in several case studies.
We address the problem of automatically analysing systems that vary dynam-ically in size and topolog...
this paper, we apply the locality concept to the communication patterns of parallel programs operat...
We propose to search for common abstractions for different concurrency models to enable high-level l...
We define a set of overhead functions that capture the salient artifacts representing the interactio...
A new semantics for process description languages that discriminates according to the distribution i...
We study re nement in the setting of local reasoning. In particular, we explore general translations...
In this thesis we give a type-based analysis for an ML-like distributed language that detects refere...
We study refinement in the setting of local reasoning. In particular, we explore general translation...
Abstract. This work studies the notion of locality in the context of process specication. It relates...
When analyzing, testing or debugging a distributed program, an important question one has to answer ...
What does it mean to say that one program is "more abstract" than another? What is "abstract" about ...
In practice, distributed systems are quite often composed by an arbitrarily large but finite number ...
We study abstract local reasoning for concurrent libraries. There are two main approaches: provide a...
We describe a new scheme for the abstract interpretation of logic programs. The scheme was developed...
© 2014 The Authors.We study abstract local reasoning for concurrent libraries. There are two main ap...
We address the problem of automatically analysing systems that vary dynam-ically in size and topolog...
this paper, we apply the locality concept to the communication patterns of parallel programs operat...
We propose to search for common abstractions for different concurrency models to enable high-level l...
We define a set of overhead functions that capture the salient artifacts representing the interactio...
A new semantics for process description languages that discriminates according to the distribution i...
We study re nement in the setting of local reasoning. In particular, we explore general translations...
In this thesis we give a type-based analysis for an ML-like distributed language that detects refere...
We study refinement in the setting of local reasoning. In particular, we explore general translation...
Abstract. This work studies the notion of locality in the context of process specication. It relates...
When analyzing, testing or debugging a distributed program, an important question one has to answer ...
What does it mean to say that one program is "more abstract" than another? What is "abstract" about ...
In practice, distributed systems are quite often composed by an arbitrarily large but finite number ...
We study abstract local reasoning for concurrent libraries. There are two main approaches: provide a...
We describe a new scheme for the abstract interpretation of logic programs. The scheme was developed...
© 2014 The Authors.We study abstract local reasoning for concurrent libraries. There are two main ap...
We address the problem of automatically analysing systems that vary dynam-ically in size and topolog...
this paper, we apply the locality concept to the communication patterns of parallel programs operat...
We propose to search for common abstractions for different concurrency models to enable high-level l...