Approximating module semantics with constraints

Authors:
Francesco Logozzo
Affiliations:
STIX - École Polytechnique, Palaiseau cedex (France)
Venue:
Proceedings of the 2004 ACM symposium on Applied computing
Year:
2004

Citing 10
Cited 2

Program fragments, linking, and modularization

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relevant context inference

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Unified Modeling Language reference manual

The Unified Modeling Language reference manual
Componential set-based analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Modular Static Program Analysis

CC '02 Proceedings of the 11th International Conference on Compiler Construction
A modular module system

Journal of Functional Programming
Class-level modular analysis for object oriented languages

SAS'03 Proceedings of the 10th international conference on Static analysis

Editorial message: special track on the programming languages

Proceedings of the 2004 ACM symposium on Applied computing
Loop invariants on demand

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a generic constraint domain for symbolic modular analysis. The idea is that the semantics of a module can be approximated by a set of relations symbolically linking the input, output and local variables. We show how this result is correct w.r.t. a trace semantics, and how it can be used to perform an (incremental) modular analysis. We claim that our construction generalizes existing modular analyses by showing how well-known modular analyses can be instantiated in our framework.