Observational Completeness on Abstract Interpretation

Authors:
Gianluca Amato;Francesca Scozzari
Affiliations:
Dipartimento di Scienze, Università di Chieti-Pescara,;Dipartimento di Scienze, Università di Chieti-Pescara,
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

Citing 8
Cited 0

Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Types as abstract interpretations

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal abstract interpretation

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Comparing completeness properties of static analyses and their logics

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the theory of abstract interpretation, we introduce the observational completeness, which extends the common notion of completeness. A domain is complete when abstract computations are as precise as concrete computations. A domain is observationally complete for an observable *** when abstract computations are as precise as concrete computations, if we only look at properties in *** . We prove that continuity of state-transition functions ensures the existence of the least observationally complete domain. When state-transition functions are additive, the least observationally complete domain boils down to the complete shell.