Patrick Cousot

According to our database1, Patrick Cousot
  • authored at least 101 papers between 1977 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Ogre and Pythia: an invariance proof method for weak consistency models.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

2016
Concurrency with Weak Memory Models (Dagstuhl Seminar 16471).
Dagstuhl Reports, 2016

Syntax and semantics of the weak consistency model specification language cat.
CoRR, 2016

Syntax and analytic semantics of LISA.
CoRR, 2016

2015
Static Analysis and Verification of Aerospace Software by Abstract Interpretation.
Foundations and Trends in Programming Languages, 2015

Abstracting Induction by Extrapolation and Interpolation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

On Various Abstract Understandings of Abstract Interpretation.
Proceedings of the 2015 International Symposium on Theoretical Aspects of Software Engineering, 2015

A Binary Decision Tree Abstract Domain Functor.
Proceedings of the Static Analysis - 22nd International Symposium, 2015

Verification by abstract interpretation, soundness and abstract induction.
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015

2014
Next Generation Static Software Analysis Tools (Dagstuhl Seminar 14352).
Dagstuhl Reports, 2014

A Galois connection calculus for abstract interpretation.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Abstract interpretation: past, present and future.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Automatic Inference of Necessary Preconditions.
Proceedings of the Verification, 2013

Andromeda: Accurate and Scalable Security Analysis of Web Applications.
Proceedings of the Fundamental Approaches to Software Engineering, 2013

2012
Theories, solvers and static analysis by abstract interpretation.
J. ACM, 2012

An abstract interpretation framework for termination.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

A semantic integrated development environment.
Proceedings of the Conference on Systems, 2012

An abstract interpretation framework for refactoring with application to extract methods with contracts.
Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

Formal Verification by Abstract Interpretation.
Proceedings of the NASA Formal Methods, 2012

Probabilistic Abstract Interpretation.
Proceedings of the Programming Languages and Systems, 2012

2011
Grammar semantics, analysis and parsing by abstract interpretation.
Theor. Comput. Sci., 2011

Static analysis by abstract interpretation of embedded critical software.
ACM SIGSOFT Software Engineering Notes, 2011

Precondition Inference from Intermittent Assertions and Application to Contracts on Collections.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

A parametric segmentation functor for fully automatic and scalable array content analysis.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

The Reduced Product of Abstract Domains and the Combination of Decision Procedures.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Linear Absolute Value Relation Analysis.
Proceedings of the Programming Languages and Systems, 2011

2010
A gentle introduction to formal verification of computer systems by abstract interpretation.
Proceedings of the Logics and Languages for Reliability and Security, 2010

An Abstract Domain to Discover Interval Linear Equalities.
Proceedings of the Verification, 2010

Logical Abstract Domains and Interpretations.
Proceedings of the Future of Software Engineering., 2010

A Scalable Segmented Decision Tree Abstract Domain.
Proceedings of the Time for Verification, 2010

2009
Abstract interpretation of resolution-based semantics.
Theor. Comput. Sci., 2009

Astree: Nachweis der Abwesenheit von Laufzeit.
Softwaretechnik-Trends, 2009

Bi-inductive structural semantics.
Inf. Comput., 2009

Why does Astrée scale up?
Formal Methods in System Design, 2009

Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships.
Proceedings of the Static Analysis, 16th International Symposium, 2009

2008
Software engineering and formal methods.
Commun. ACM, 2008

A Sound Floating-Point Polyhedra Abstract Domain.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007
Bi-inductive Structural Semantics: (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2007

A Static Analyzer for Large Safety-Critical Software
CoRR, 2007

Varieties of Static Analyzers: A Comparison with ASTREE.
Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, 2007

The Rôle of Abstract Interpretation in Formal Methods.
Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), 2007

Fixpoint-Guided Abstraction Refinements.
Proceedings of the Static Analysis, 14th International Symposium, 2007

Avionic Software Verification by Abstract Interpretation.
Proceedings of the ISoLA 2007, 2007

Proving the absence of run-time errors in safety-critical avionics code.
Proceedings of the 7th ACM & IEEE International conference on Embedded software, 2007

2006
Grammar Analysis and Parsing by Abstract Interpretation.
Proceedings of the Program Analysis and Compilation, 2006

Combination of Abstractions in the ASTRÉE Static Analyzer.
Proceedings of the Advances in Computer Science, 2006

2005
The Verification Grand Challenge and Abstract Interpretation.
Proceedings of the Verified Software: Theories, 2005

Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming.
Proceedings of the Verification, 2005

The ASTREÉ Analyzer.
Proceedings of the Programming Languages and Systems, 2005

Integrating Physical Systems in the Static Analysis of Embedded Control Software.
Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2004
An abstract interpretation-based framework for software watermarking.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

Basic concepts of abstract interpretation.
Proceedings of the Building the Information Society, 2004

2003
Parsing as abstract interpretation of grammar semantics.
Theor. Comput. Sci., 2003

Automatic Verification by Abstract Interpretation.
Proceedings of the Verification, 2003

A static analyzer for large safety-critical software.
Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, 2003

Verification by Abstract Interpretation.
Proceedings of the Verification: Theory and Practice, 2003

2002
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation.
Theor. Comput. Sci., 2002

Abstract Interpretation: Theory and Practice.
Proceedings of the Model Checking of Software, 2002

Systematic design of program transformation frameworks by abstract interpretation.
Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

Modular Static Program Analysis.
Proceedings of the Compiler Construction, 11th International Conference, 2002

On Abstraction in Software Verification.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001
A Case Study in Abstract Interpretation Based Program Transformation: Blocking Command Elimination.
Electr. Notes Theor. Comput. Sci., 2001

Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations.
Proceedings of the Logic Programming, 17th International Conference, 2001

Verification of Embedded Software: Problems and Perspectives.
Proceedings of the Embedded Software, First International Workshop, 2001

Abstract Interpretation Based Formal Methods and Future Challenges.
Proceedings of the Informatics - 10 Years Back. 10 Years Ahead., 2001

2000
Partial Completeness of Abstract Fixpoint Checking.
Proceedings of the Abstraction, 2000

Temporal Abstract Interpretation.
Proceedings of the POPL 2000, 2000

1999
Directions for Research in Approximate System Analysis.
ACM Comput. Surv., 1999

Refining Model Checking by Abstract Interpretation.
Autom. Softw. Eng., 1999

1997
Program Analysis: The Abstract Interpretation Perspective.
SIGPLAN Notices, 1997

Constructive design of a hierarchy of semantics of a transition system by abstract interpretation.
Electr. Notes Theor. Comput. Sci., 1997

Abstract Interpretation Based Static Analysis Parameterized by Semantics.
Proceedings of the Static Analysis, 4th International Symposium, 1997

Types as Abstract Interpretations.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

Abstract Interpretation of Algebraic Polynomial Systems (Extended Abstract).
Proceedings of the Algebraic Methodology and Software Technology, 1997

1996
Program Analysis: The Abstract Interpretation Perspective.
ACM Comput. Surv., 1996

Abstract Interpretation.
ACM Comput. Surv., 1996

Logical and Operational Methods in the Analysis of Programs and Systems.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

1995
Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract Interpretation.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form.
Proceedings of the Computer Aided Verification, 1995

Completeness in Abstract Interpretation.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1994
Invited Talk: Higher Order Abstract Interpretation (and Application to Comportment Analysis Generalizing Strictness, Termination, Projection, and PER Analysis.
Proceedings of the IEEE Computer Society 1994 International Conference on Computer Languages, 1994

1993
"A la Burstall" Intermittent Assertions Induction Principles for Proving Inevitable Ability Properties of Programs.
Theor. Comput. Sci., 1993

Galois Connection Based Abstract Interpretations for Strictness Analysis (Invited Paper).
Proceedings of the Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28, 1993

1992
Abstract Interpretation Frameworks.
J. Log. Comput., 1992

Abstract Interpretation and Application to Logic Programs.
J. Log. Program., 1992

Inductive Definitions, Semantics and Abstract Interpretation.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation.
Proceedings of the Programming Language Implementation and Logic Programming, 1992

1991
Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation.
Proceedings of the Actes JTASPEFL'91 (Bordeaux), 1991

Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract).
Proceedings of the Actes JTASPEFL'91 (Bordeaux), 1991

Abstract Interpretation of Logic Programs.
Proceedings of the Logic Programming, 1991

1990
Methods and Logics for Proving Programs.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

1989
A Language Independent Proof of the Soundness and Completeness of Generalized Hoare Logic
Inf. Comput., February, 1989

1987
Sometime = Always + Recursion = Always on the Equivalence of the Intermittent and Invariant Assertions Methods for Proving Inevitability Properties of Programs.
Acta Inf., 1987

1980
Semantic Analysis of Communicating Sequential Processes (Shortened Version).
Proceedings of the Automata, 1980

1979
Systematic Design of Program Analysis Frameworks.
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

1978
Automatic Discovery of Linear Restraints Among Variables of a Program.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique des programmes.
, 1978

1977
Automatic synthesis of optimal invariant assertions: Mathematical foundations.
SIGART Newsletter, 1977

Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

Static Determination of Dynamic Properties of Generalized Type Unions.
Language Design for Reliable Software, 1977


  Loading...