BACK TO INDEX

Publications about 'abstract interpretation'
Articles in journal or book chapters
  1. G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning, 33 (3-4):341-383, 2004. [WWW ] Keyword(s): Term Rewriting, Reachability, Tree Automata, Approximations, Verification, Timbuk, Abstract Interpretation. [Abstract] [bibtex-entry]


  2. F. Spoto and T. Jensen. Class Analyses as Abstract Interpretations of Trace Semantics. ACM Transactions on Programming Languages and Systems (TOPLAS), 25(5):578--630, 2003. [bibtex-entry]


  3. D. Le Métayer, V.-A. Nicolas, and O. Ridoux. Programs, Properties, and Data: Exploring the Software Development Trilogy. IEEE Software, 15(6):75-81, November/December 1998. [WWW ] Keyword(s): Software engineering, testing, verification, program analysis, program learning. [Abstract] [bibtex-entry]


  4. T. Jensen. Disjunctive Program Analysis for Algebraic Data Types. ACM Transactions on Programming Languages and Systems, 19(5):752--804, 1997. [WWW ] [Abstract] [bibtex-entry]


  5. C.L. Hankin and D. Le Métayer. Lazy types and program analysis. Science of Computer Programming, 1995. [Abstract] [bibtex-entry]


  6. M. Ducassé and J. Noyé. Logic Programming Environments: Dynamic program analysis and debugging. The Journal of Logic Programming, 19/20:351-384, May/July 1994. Note: Anniversary issue: Ten years of Logic Programming. [WWW ] [Abstract] [bibtex-entry]


Conference articles
  1. F. Besson, T. Jensen, and D. Pichardie. A PCC Architecture based on Certified Abstract Interpretation. In Proc. of 1st International Workshop on Emerging Applications of Abstract Interpretation (EAAI'06), ENTCS, 2006. Springer-Verlag. [WWW ] [Abstract] [bibtex-entry]


  2. David Cachera, Thomas Jensen, David Pichardie, and Gerardo Schneider. Certified Memory Usage Analysis. In Proc of 13th International Symposium on Formal Methods (FM'05), Lecture Notes in Computer Science, 2005. Springer-Verlag. [Abstract] [bibtex-entry]


  3. T. Jensen and F. Spoto. Class analysis of object-oriented programs through abstract interpretation. In F. Honsell and M. Miculan, editors, Proc. of Foundations of Software Science and Computation Structures (FoSSaCS'01), pages 261--275, 2001. Springer LNCS vol .2030. [bibtex-entry]


  4. F. Besson, T. Jensen, and J.P. Talpin. Polyhedral Analysis for Synchronous Languages. In Gilberto Filé, editor, International Static Analysis Symposium, SAS'99, volume 1694 of Lecture Notes in Computer Science, September 1999. Springer-Verlag. Keyword(s): synchronous languages, abstract interpretation, reachability analysis, infinite state systems. [Abstract] [bibtex-entry]


  5. V. Gouranton. Deriving analysers by folding/unfolding of natural semantics and a case study: slicing. In International Static Analysis Symposium, SAS'98, number 1503 of Lecture Notes in Computer Science, Pise, Italie, pages 115-133, September 1998. Springer-Verlag. [WWW ] Keyword(s): systematic derivation, program transformation, natural semantics, proof tree, slicing analysis, logic programming language.. [Abstract] [bibtex-entry]


  6. C.L. Hankin and D. Le Métayer. Lazy type inference for the strictness analysis of lists. In Proc. 5th European Symposium on Programming, Springer Verlag, volume LNCS, pages 211-224, 1994. [WWW ] [Abstract] [bibtex-entry]


Internal reports
  1. F. Besson, T. Jensen, and D. Pichardie. A PCC Architecture based on Certified Abstract Interpretation. Research Report RR-5751, INRIA, November 2005. Note: Also Publication Interne IRISA PI-1764. [PDF ] [bibtex-entry]


  2. G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Technical report RR-4970, INRIA, 2003. [WWW ] Keyword(s): Term Rewriting, Reachability, Tree Automata, Approximations, Verification, Timbuk, Abstract Interpretation. [bibtex-entry]


  3. T. Genet and V. Viet Triem Tong. Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation. Technical report RR-4576, INRIA, 2002. [WWW ] Keyword(s): Equational theories, proof by induction, abstract interpretation, rewriting. [bibtex-entry]



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.




Last modified: Mon Feb 26 15:35:07 2007
Author: ferre.


This document was translated from BibTEX by bibtex2html