The semantics of program dependence
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A rewriting semantics for program dependence graphs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Algebraic properties of program integration
ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
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
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
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
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
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
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
Program Specialization via Program Slicing
Selected Papers from the Internaltional Seminar on Partial Evaluation
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
Heterogeneous fixed points with application to points-to analysis
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
| Hi-index | 0.00 |
In this paper we study the connection between the structure of relational abstract domains for program analysis and compositionality of the underlying semantics. Both can be systematically designed as solution of the same abstract domain equation involving the same domain refinement: the reduced power operation. We prove that most well-known compositional semantics of imperative programs, such as the standard denotational and weakest precondition semantics can be systematically derived as solutions of simple abstract domain equations. This provides an equational presentation of both semantics and abstract domains for program analysis in a unique formal setting. Moreover both finite and transfinite compositional semantics share the same structure, and this allows us to provide consistent models for program manipulation.