Approximating module semantics with constraints
暂无分享,去创建一个
[1] Patrick Cousot,et al. Abstract Interpretation Frameworks , 1992, J. Log. Comput..
[2] Luca Cardelli,et al. Program fragments, linking, and modularization , 1997, POPL '97.
[3] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.
[4] Patrick Cousot,et al. Modular Static Program Analysis , 2002, CC.
[5] Patrick Cousot,et al. Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract) , 1991, JTASPEFT/WSA.
[6] Barbara G. Ryder,et al. Relevant context inference , 1999, POPL '99.
[7] Ivar Jacobson,et al. The unified modeling language reference manual , 2010 .
[8] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.
[9] Francesco Logozzo,et al. Class-Level Modular Analysis for Object Oriented Languages , 2003, SAS.
[10] Antoine Miné,et al. The octagon abstract domain , 2001, High. Order Symb. Comput..
[11] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[12] Antoine Mid. The Octagon Abstract Domain , 2001 .
[13] Matthias Felleisen,et al. Componential set-based analysis , 1997, TOPL.
[14] Xavier Leroy,et al. A modular module system , 2000, J. Funct. Program..