| 1975 |
Patrick Cousot & Radhia Cousot.
Fixed point approach to the approximate semantic analysis of programs
Unpublished manuscript, Laboratoire IMAG, Université scientifique
et médicale de Grenoble, Grenoble, France. June 1977, 48 p.
1976 1977 1978
Thèse És Sciences Mathématiques, Université Joseph Fourier, Grenoble, France, 21 March 1978.
1979
Patrick Cousot & Radhia Cousot.1980
Semantic analysis of communicating sequential processes.
Seventh International Colloquium on Automata, Languages
and Programming,
Noordwijerhout, The Netherlands, 14--18 July 1980,
Lecture Notes
in Computer Science 85,
pages 119—133. © Springer-Verlag, Berlin, Germany, 1980.
1981 1982 1984 1985
Principe des Méthodes
de Preuve de Propriétés
d'Invariance et de Fatalité des Programmes
Parallèles.
(Principle of invariance and inevitability proof methods of concurrent
programs.)
In « Parallélisme, communication et synchronisation »,
J.-P. Verjus et G. Roucairol (Eds.),
Éditions du CNRS,
Paris, pp. 129—149, 1985.
‘A la Floyd’
induction principles for proving
inevitability properties of programs.
In «Algebraic methods in semantics»,
M. Nivat & J. Reynolds (Eds.),
Cambridge University Press,
Cambridge, UK, pp. 277—312, December 1985.
1986 1987 1988
Patrick Cousot & Radhia Cousot.1989
A language independent proof of the soundness and completeness of generalized Hoare logic.
Information
and computation 80(2):165—191 (1989).
© 1989 Elsevier Science B.V. .
1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000
2001 2002
Systematic Design of Program Transformation Frameworks by Abstract Interpretation.
In
Conference Record of the 29th ACM
SIGACT-SIGMOD-SIGART Symposium on Principles of Programming Languages,
Portland, OR, USA, January 16-18, 2002. ACM Press, New York, U.S.A. pp. 178&—190.
Abstract Interpretation: Theory and Practice.
In
Proceedings of the 9th International SPIN Workshop,
Grenoble, France, Lecture Notes in
Computer Science 2318,
Dragan Bosnacki & Stephen Leue (Eds.),
Grenoble, France, April 11-13, 2002, pp. 2-5.
© Springer
Modular Static Program Analysis.
In
Proceedings of the Eleventh International Conference on Compiler Construction (CC 2002),
Grenoble, France, April 6 &— 14, 2002.
Lecture Notes
in Computer Science 2304, pp. 159&—178, ©
Springer.
Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation.
Theoretical Computer Science,, 277(1—2):47—103, 2002. © Elsevier Science.
On Abstraction in Software Verification.
In
Proceedings of the
14th
International Conference on Computer Aided Verification, CAV 2002,
Copenhagen, Denmark, July 2002
Copenhagen, Denmark, 27—31 July 2002.
Lecture Notes
in Computer Science 2404,
pp. 37—56, © Springer.
Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software.
In
The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, T. Mogensen, D.A. Schmidt & I.H. Sudborough (Editors).
Lecture Notes in Computer Science 2566, pp. 85—108, © Springer.
2003
Parsing as Abstract Interpretation of Grammar Semantics.
Theoretical Computer Science 290:531-544 (2003). © Elsevier Science.
Automatic Verification by Abstract Interpretation..
In VMCAI 2003 —
Fourth International Conference on
Verification, Model Checking and Abstract Interpretation,
L.D. Zuck, P.C. Attie, A. Cortesi, & S. Mukhopadhyay (Editors). Lecture Notes in Computer Science 2566, pp. 85—108, © Springer.
A Static Analyzer for Large Safety-Critical Software.
In PLDI 2003 —
ACM SIGPLAN SIGSOFT Conference on Programming Language Design and Implementation ,
2003 Federated Computing Research Conference,
June 7—14, 2003, San Diego, California, USA,
pp. 196—207, ©
ACM.
2004
An Abstract Interpretation-Based Framework for Software Watermarking.
In
Conference Record of the 31st ACM
SIGACT-SIGMOD-SIGART Symposium on Principles of Programming Languages,
Venice, Italy, January 14-16, 2004. ACM Press, New York, U.S.A. pp. 173—185.
&
copy;
ACM.
Verification by Abstract Interpretation.
In International
Symposium on Verification — Theory & Practice — Honoring Zohar
Manna's 64th Birthday
Basic Concepts of Abstract Interpretation.
In
Building the Information Society
,
René Jacquard (Ed.),
Kluwer Academic Publishers, pp. 359—366, 2004.
(IFIP WCC 2004 Toulouse, Topical Day on
Abstract Interpretation, Tuesday 24 August 2004).
2005
Proving Program Invariance and Termination by Parametric
Abstraction, Lagrangian Relaxation and Semidefinite Programming.
In
Sixth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05),
Paris, France, January 17—19, 2005. Lecture Notes in Computer Science 3385, ©
Springer, Berlin, pp. 1—24.
The ASTRÉE Analyzer.
ESOP 2005: The European Symposium on Programming, Edinburgh, Scotland, April 2—10, 2005. Lecture Notes in Computer Science 3444, ©
Springer, Berlin, pp. 21—30.
The Verification Grand Challenge and Abstract Interpretation.
Verified Software: Theories, Tools, Experiments (VSTTE), ETH Zürich, Switzerland, October 10th—13th, 2005.
Integrating Physical Systems in the Static
Analysis of Embedded Control Software.
The Third Asian Symposium on
Programming Languages and Systems (APLAS'05), Tsukuba, Japan, November 3—5, 2005. Lecture Notes in Computer
Science, volume 3780, ©
Springer, Berlin, pp. 135—138.
2006
Combination of Abstractions in the ASTRÉE
Static Analyzer.
In
11th Annual Asian Computing Science Conference
(ASIAN'06),
National Center of Sciences, Tokyo, Japan, December 6—8, 2006.
LNCS 4435, ©
Springer-Verlag, pp. 272—300.
Grammar Analysis and Parsing by Abstract Interpretation.
In Program Analysis and Compilation, Theory and Practice:
Essays dedicated to Reinhard Wilhelm, T. Reps,
M. Sagiv & J. Bauer (Eds.), Lecture
Notes in Computer Science 4444,
pp. 178—203, ©
Springer-Verlag, Berlin, December 2006.
2007
Varieties of Static Analyzers: A Comparison with ASTRÉE.
First IEEE & IFIP International Symposium on ``Theoretical Aspects of Software Engineering'',
TASE'07, Shanghai, China, 6—8 June 2007, pp. 3—17.
Fixpoint-Guided Abstraction Refinements.
In
14th Fourteenth International Symposium on Static Analysis,
(SAS'07),
The Technical University of Denmark, Kongens Lyngby, Denmark, August 22—24, 2006.
LNCS 4634, ©
Springer-Verlag, Berlin, pp. 333—348.
The Rôle of Abstract Interpretation in Formal Methods.
In
SEFM 2007, 5th IEEE International Conference on Software
Engineering and Formal Methods, Mike Hinchey & Tiziana Margaria
(Eds.),
London, UK, September 10—14, 2007, IEEE Press, pages 135—137.
Proving the Absence of Run-Time Errors in Safety-Critical Avionics Code.
In
Proceedings of the Seventh ACM & IEEE International Conference on Embedded Software (EMSOFT 2007), Embedded Systems Week,
Salzburg, Austria, September 30th—Oct. 3rd, 2007, pp
. 7—9,
ACM Press.
Bi-inductive Structural Semantics.
In
Structural Operational Semantics 2007,
Rob van Glabbeek & Matthew Hennessy (Eds),
July 9, 2007, Wroclaw, Poland.
ENTCS, Volume 192, Issue 1, 24 October 2007, pp.
29-44, ©
Elsevier, Amsterdam, The Netherlands.
The Verification Grand Challenge
and Abstract Interpretation.
In
Verified Software: Tools, Theories, Experiments,
Bertrand Meyer & Jim Woodcock (Eds),
LNCS 4171, ©
Springer-Verlag, Berlin, pp. 227—240, Dec. 2007.
2008
Commun. ACM 51(9): 54—59 (Sep. 2008).
A Sound Floating-Point Polyhedra Abstract Domain.
In Proc. of the 6th Asian Symposium on Programming Languages and Systems (APLAS 2008), volume 5356 of LNCS, pages 3—18, Springer, Bangalore, India, Dec 9—11, 2008.
2009
Bi-inductive Structural Semantics.
In
Information and computation 207(2):258—283, February 2009.
Space Software Validation using Abstract Interpretation.
In
Proc. of the Int. Space System Engineering Conf., Data Systems in Aerospace (DASIA 2009). Istambul, Turkey, May 2009, 7 pages. ESA.
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships.
In Proc. of the 16th International Static Analysis Symposium (SAS'09), volume 5673 of Lecture Notes in Computer Science, pages 309—325, Los Angeles, CA, USA, August 2009.
The abstract interpretation of resolution-based semantics.
In
Abstract Interpretation and Logic Programming: In honor of professor Giorgio Levi,
M. Falaschi, M. Gabbrielli, & C. Palamidessi (Eds),
Theoretical Computer Science,
Volume 410,
Issue 46,
1 November 2009,
Pages 4724—4746, Elsevier B.V.
2010
An Abstract Domain to Discover Interval Linear Equalities.
To appear in Proc. of the 11th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'10), Lecture Notes in Computer Science, © Springer, Madrid, Spain, 17—19 January 2010.
To appear
Why does Astrée scale up?
To appear in Formal Methods in System Design. © Springer. 45 pages.
A gentle introduction to formal verification of computer systems by abstract interpretation.
To appear in Logics and Languages for Reliability and Security, J. Esparza, O. Grumberg, & M. Broy (Eds), NATO Science Series III: Computer and Systems Sciences, IOS Press, 2010, 29 pages.
Copyright notices:
ACM,
Elsevier B.V.,
IOS Press,
Springer
Tuesday, 05-Jan-2010 11:24:32 CET