Locality-based abstractions

Authors:
Javier Esparza;Pierre Ganty;Stefan Schwoon
Affiliations:
Institut für Formale Methoden der Informatik, Universität Stuttgart;Département d'Informatique, Université Libre de Bruxelles;Institut für Formale Methoden der Informatik, Universität Stuttgart
Venue:
SAS'05 Proceedings of the 12th international conference on Static Analysis
Year:
2005

Citing 15
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Fast planning through planning graph analysis

Artificial Intelligence
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Data flow analysis for checking properties of concurrent Java programs

Proceedings of the 21st international conference on Software engineering
An efficient algorithm for computing MHP information for concurrent Java programs

ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Making abstract interpretations complete

Journal of the ACM (JACM)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic Verification of Probabilistic Free Choice

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Making Abstract Model Checking Strongly Preserving

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Concurrency Relations and the Safety Problem for Petri Nets

Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Boolean and Cartesian Abstraction for Model Checking C Programs

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
Fast planning through planning graph analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems

RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Thread-modular counterexample-guided abstraction refinement

SAS'10 Proceedings of the 17th international conference on Static analysis
A complete abstract interpretation framework for coverability properties of WSTS

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Fixpoint-guided abstraction refinements

SAS'07 Proceedings of the 14th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

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.