Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Locality-Based Abstractions


Javier Esparza, Pierre Ganty, and Stefan Schwoon. Locality-based abstractions. In Chris Hankin and Igor Siveroni, editors, Proceedings of the 12th International Static Analysis Symposium (SAS), volume 3672 of Lecture Notes in Computer Science, pages 118–134, London, UK, September 2005. Springer.


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.

Suggested BibTeX entry:

    address = {London, UK},
    author = {Javier Esparza and Pierre Ganty and Stefan Schwoon},
    booktitle = {Proceedings of the 12th International Static Analysis Symposium (SAS)},
    editor = {Chris Hankin and Igor Siveroni},
    month = {September},
    pages = {118--134},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Locality-Based Abstractions},
    volume = {3672},
    year = {2005}

PDF (256 kB)