B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux & X. Rival (2003):
A Static Analyzer for Large Safety-Critical Software.
In: Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation,
PLDI '03.
ACM,
New York, NY, USA,
pp. 196–207,
doi:10.1145/781131.781153.
Agostino Cortesi, Baudouin Le Charlier & Pascal Van Hentenryck (2000):
Combinations of abstract domains for logic programming: open product and generic pattern construction.
Science of Computer Programming 38(1-3),
pp. 27–71,
doi:10.1016/S0167-6423(99)00045-3.
Agostino Cortesi & Matteo Zanioli (2011):
Widening and narrowing operators for abstract interpretation.
Computer Languages, Systems & Structures 37(1),
pp. 24–42,
doi:10.1016/j.cl.2010.09.001.
P. Cousot & R. Cousot (1977):
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints.
In: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages,
POPL '77.
ACM,
New York, NY, USA,
pp. 238–252,
doi:10.1145/512950.512973.
P. Cousot & R. Cousot (1979):
Systematic design of program analysis frameworks.
In: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages,
POPL '79.
ACM,
New York, NY, USA,
pp. 269–282,
doi:10.1145/567752.567778.
P. Cousot & R. Cousot (1992):
Abstract Interpretation and Application to Logic Programs.
Journal of Logic Programming 13(2-3),
pp. 103–179,
doi:10.1016/0743-1066(92)90030-7.
P. Cousot & N. Halbwachs (1978):
Automatic discovery of linear restraints among variables of a program.
In: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages,
POPL '78.
ACM,
New York, NY, USA,
pp. 84–96,
doi:10.1145/512760.512770.
Patrick Cousot & Radhia Cousot (1994):
Higher-Order Abstract Interpretation (and Application to Comportment Analysis Generalizing Strictness, Termination, Projection and PER Analysis of Functional Languages), invited paper.
In: Proceedings of the 1994 International Conference on Computer Languages.
IEEE Computer Society Press, Los Alamitos, California,
Toulouse, France,
pp. 95–112.
Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux & Xavier Rival (2005):
The ASTREÉ Analyzer.
In: Proceedings of the 14th European conference on Programming Languages and Systems,
ESOP'05.
Springer-Verlag,
Berlin, Heidelberg,
pp. 21–30,
doi:10.1007/978-3-540-31987-0_3.
Patrick Cousot, Radhia Cousot & Francesco Logozzo (2011):
A parametric segmentation functor for fully automatic and scalable array content analysis.
In: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
ACM,
New York, NY, USA,
pp. 105–118,
doi:10.1145/1926385.1926399.
Gilberto Filé, Roberto Giacobazzi & Francesco Ranzato (1996):
A Unifying View of Abstract Domain Design.
ACM Computing Surveys (CSUR) 28(2),
pp. 333–336,
doi:10.1145/234528.234742.
Gilberto Filé & Francesco Ranzato (1999):
The Powerset Operator on Abstract Interpretations.
Theoretical Computer Science 222(1-2),
pp. 77–111,
doi:10.1016/S0304-3975(98)00007-3.
Roberto Giacobazzi & Francesco Ranzato (1997):
Refining and Compressing Abstract Domains.
In: Proceedings of the 24th International Colloquium on Automata, Languages and Programming,
ICALP '97.
Springer-Verlag,
London, UK, UK,
pp. 771–781,
doi:10.1007/3-540-63165-8_230.
Roberto Giacobazzi & Francesco Ranzato (1998):
Optimal Domains for Disjunctive Abstract Intepretation.
Science of Computer Programming - Special issue on the 6th European symposium on programming 32(1-3),
pp. 177–210,
doi:10.1016/S0167-6423(97)00034-8.
Roberto Giacobazzi & Francesco Ranzato (1999):
The Reduced Relative Power Operation on Abstract Domains.
Theoretical Computer Science 216(1-2),
pp. 159–211,
doi:10.1016/S0304-3975(98)00194-7.
Philippe Granger (1992):
Improving the Results of Static Analyses Programs by Local Decreasing Iteration.
In: Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science,
LNCS.
Springer-Verlag,
London, UK, UK,
pp. 68–79,
doi:10.1007/3-540-56287-7_95.
Thomas P. Jensen (1997):
Disjunctive Program Analysis for Algebraic Data Types.
ACM Transactions on Programming Languages and Systems (TOPLAS) 19(5),
pp. 751–803,
doi:10.1145/265943.265966.
F. Logozzo & M. Fähndrich (2008):
Pentagons: A weakly relational domain for the efficient validation of array accesses.
In: Proceedings of the 2008 ACM symposium on Applied computing,
SAC '08.
ACM,
New York, NY, USA,
pp. 184–188,
doi:10.1145/1363686.1363736.
L. Mauborgne & X. Rival (2005):
Trace Partitioning in Abstract Interpretation Based Static Analyzers.
In: Proceedings of the 14th European conference on Programming Languages and Systems,
ESOP'05.
Springer-Verlag,
Berlin, Heidelberg,
pp. 5–20,
doi:10.1007/978-3-540-31987-0_2.
eptcs@eptcs.org