Francesco Logozzo
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.
- L. Cardelli. Program fragments, linking, and modularization. In POPL'97. ACM Press, 1997. Google Scholar
Digital Library
- R. Chatterjee, B. G. Ryder, and W. A. Landi. Relevant context inference. In POPL '99. ACM Press, 1999. Google ScholarDigital Library
- P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL'77. ACM Press, 1977. Google ScholarDigital Library
- P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL'79. ACM Press, 1979. Google ScholarDigital Library
- P. Cousot and R. Cousot. Relational abstract interpretation of higher-order functional programs. JTASPEFL'91. BIGRE, 74, 1991.Google Scholar
- P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4), 1992.Google ScholarCross Ref
- P. Cousot and R. Cousot. Modular static program analysis, invited paper. In CC 2002, volume 2304 of LNCS. Springer-Verlag, 2002. Google ScholarDigital Library
- P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78. ACM Press, 1978. Google ScholarDigital Library
- C. Flanagan and M. Felleisen. Componential set-based analysis. TOPLAS, 21(2), 1999. Google ScholarDigital Library
- F.Logozzo. Class-level modular analysis for object oriented languages. In SAS '03, volume 2694 of LNCS. Springer-Verlag, 2003. Google ScholarDigital Library
- X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000. Google ScholarDigital Library
- A. Miné. The octagon abstract domain. In AST 2001 in WCRE 2001. IEEE CS Press, 2001.Google ScholarCross Ref
- J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, 1999. Google ScholarDigital Library
- Approximating module semantics with constraints
Recommendations
Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
SAC '08: Proceedings of the 2008 ACM symposium on Applied computingWe introduce Pentagons (Pntg), a weakly relational numerical abstract domain useful for the validation of array accesses in byte-code and intermediate languages (IL). This abstract domain captures properties of the form of x ε [a, b]∧x < y. It is more ...
SubPolyhedra: a family of numerical abstract domains for the (more) scalable inference of linear inequalities
We introduce SubPolyhedra (SubPoly), a new family of numerical abstract domains to infer and propagate linear inequalities. The key insight is that the reduced product of linear equalities and intervals produces powerful yet scalable analyses. Abstract ...
Safer unsafe code for .NET
The .NET intermediate language (MSIL) allows expressing both statically verifiable memory and type safe code (typically called managed), as well as unsafe code using direct pointer manipulations. Unsafe code can be expressed in C# by marking regions of ...
Comments