Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation and application to logic programs
Journal of Logic Programming
Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent constraint programming
Concurrent constraint programming
Proving concurrent constraint programs correct
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A compositional semantics for logic programs
FGCS'921 Selected papers of the conference on Fifth generation computer systems
An algebraic theory of observables
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Handbook of logic in computer science (vol. 3)
ACM Computing Surveys (CSUR)
A unifying view of abstract domain design
ACM Computing Surveys (CSUR)
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
The reduced relative power operation on abstract domains
Theoretical Computer Science
A characterization of symmetric semantics by domain complementation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Discipline of Programming
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Refining and Compressing Abstract Domains
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Logical Optimality of Groundness Analysis
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Complementing Logic Program Semantics
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Non-Standard Semantics for Program Slicing
Higher-Order and Symbolic Computation
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
| Hi-index | 5.23 |
In 1997, Cousot introduced a hierarchy where semantics are related with each other by abstract interpretation. In this field we consider the standard abstract domain transformers, devoted to refine abstract domains in order to include attribute independent and relational information, respectively the reduced product and power of abstract domains, as domain operations to systematically design and compare semantics of programming languages by abstract interpretation. We first prove that natural semantics can be decomposed in terms of complementary attribute independent observables, leading to an algebraic characterization of the symmetric structure of the hierarchy. Moreover, we characterize some structural property of semantics, such as their compositionality, in terms of simple abstract domain equations. This provides an equational presentation of most well known semantics, which is parametric on the observable and structural property of the semantics, making it possible to systematically derive abstract semantics, e.g. for program analysis, as solutions of abstract domain equations.