4 Search Results for "Cousot, Patrick"

Document
DOI: 10.4230/LIPIcs.CONCUR.2020.30
Decidability and Synthesis of Abstract Inductive Invariants

Authors: Francesco Ranzato

Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)

Abstract
Decidability and synthesis of inductive invariants ranging in a given domain play an important role in software verification. We consider here inductive invariants belonging to an abstract domain A as defined in abstract interpretation, namely, ensuring the existence of the best approximation in A of any system property. In this setting, we study the decidability of the existence of abstract inductive invariants in A of transition systems and their corresponding algorithmic synthesis. Our model relies on some general results which relate the existence of abstract inductive invariants with least fixed points of best correct approximations in A of the transfer functions of transition systems and their completeness properties. This approach allows us to derive decidability and synthesis results for abstract inductive invariants which are applied to the well-known Karr’s numerical abstract domain of affine equalities. Moreover, we show that a recent general algorithm for synthesizing inductive invariants in domains of logical formulae can be systematically derived from our results and generalized to a range of algorithms for computing abstract inductive invariants.
Cite as

Francesco Ranzato. Decidability and Synthesis of Abstract Inductive Invariants. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 30:1-30:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{ranzato:LIPIcs.CONCUR.2020.30,
  author =	{Ranzato, Francesco},
  title =	{{Decidability and Synthesis of Abstract Inductive Invariants}},
  booktitle =	{31st International Conference on Concurrency Theory (CONCUR 2020)},
  pages =	{30:1--30:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-160-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{171},
  editor =	{Konnov, Igor and Kov\'{a}cs, Laura},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.30},
  URN =		{urn:nbn:de:0030-drops-128429},
  doi =		{10.4230/LIPIcs.CONCUR.2020.30},
  annote =	{Keywords: Inductive invariant, program verification, abstract interpretation}
}
Document
DOI: 10.4230/DagRep.6.11.108
Concurrency with Weak Memory Models (Dagstuhl Seminar 16471)

Authors: Jade Alglave, Patrick Cousot, and Caterina Urban

Published in: Dagstuhl Reports, Volume 6, Issue 11 (2017)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 16471 "Concurrency with Weak Memory Models: Semantics, Languages, Compilation, Verification, Static Analysis, and Synthesis". The aim of the seminar was to bring together people from various horizons, including theoreticians and verification practitioners as well as hardware vendors, in order to set up a long-term research program to design formal methods and develop tools ensuring the correctness of concurrent programs on modern multi-processor architectures.
Cite as

Jade Alglave, Patrick Cousot, and Caterina Urban. Concurrency with Weak Memory Models (Dagstuhl Seminar 16471). In Dagstuhl Reports, Volume 6, Issue 11, pp. 108-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@Article{alglave_et_al:DagRep.6.11.108,
  author =	{Alglave, Jade and Cousot, Patrick and Urban, Caterina},
  title =	{{Concurrency with Weak Memory Models (Dagstuhl Seminar 16471)}},
  pages =	{108--128},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Alglave, Jade and Cousot, Patrick and Urban, Caterina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.11.108},
  URN =		{urn:nbn:de:0030-drops-70415},
  doi =		{10.4230/DagRep.6.11.108},
  annote =	{Keywords: Compilation, Computer Memory, Concurrency, Memory Barrier, Memory Ordering, Micro-Architecture, Multiprocessor, Out-of-Order Execution, Parallelism, Program Synthesis, Programming Language, Semantics, Static Analysis, Verification, Weak Memory Model}
}
Document
DOI: 10.4230/DagRep.4.8.107
Next Generation Static Software Analysis Tools (Dagstuhl Seminar 14352)

Authors: Patrick Cousot, Daniel Kroening, and Carsten Sinz

Published in: Dagstuhl Reports, Volume 4, Issue 8 (2015)

Abstract
There has been tremendous progress in static software analysis over the last years with, for example, refined abstract interpretation methods, the advent of fast decision procedures like SAT and SMT solvers, new approaches like software (bounded) model checking or CEGAR, or new problem encodings. We are now close to integrating these techniques into every programmer's toolbox. The aim of the seminar was to bring together developers of software analysis tools and algorithms, including researchers working on the underlying decision procedures (e.g., SMT solvers), and people who are interested in applying these techniques (e.g. in the automotive or avionics industry). The seminar offered the unique chance, by assembling the leading experts in these areas, to make a big step ahead towards new, more powerful tools for static software analysis. Current (academic) tools still suffer from some shortcomings: - Tools are not yet robust enough or support only a subset of a programming language's features. - Scalability to large software packages is not yet sufficient. - There is a lack of standardized property specification and environment modeling constructs, which makes exchange of analysis results more complicated than necessary. - Differing interpretations of programming language semantics by different tools lead to limited trust in analysis results. - Moreover, a comprehensive benchmark collection to compare and evaluate tools is missing. Besides these application-oriented questions, further, more fundamental questions have also been topics of the seminar: - What are the right logics for program verification, bug finding and software analysis? - How can we handle universal quantification? And how to model main memory and complex data structures? - Which decision procedures are most suitable for static software analysis? How can different procedures be combined? Which optimizations to general-purpose decision procedures (SAT/SMT/QBF) are possible in the context of software analysis?
Cite as

Patrick Cousot, Daniel Kroening, and Carsten Sinz. Next Generation Static Software Analysis Tools (Dagstuhl Seminar 14352). In Dagstuhl Reports, Volume 4, Issue 8, pp. 107-125, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{cousot_et_al:DagRep.4.8.107,
  author =	{Cousot, Patrick and Kroening, Daniel and Sinz, Carsten},
  title =	{{Next Generation Static Software Analysis Tools (Dagstuhl Seminar 14352)}},
  pages =	{107--125},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{8},
  editor =	{Cousot, Patrick and Kroening, Daniel and Sinz, Carsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.8.107},
  URN =		{urn:nbn:de:0030-drops-48203},
  doi =		{10.4230/DagRep.4.8.107},
  annote =	{Keywords: Software quality, Bug finding, Verification, Decision procedures, SMT/SAT solvers}
}
Document
DOI: 10.4230/DagSemRep.123
Abstract Interpretation (Dagstuhl Seminar 9535)

Authors: Patrick Cousot, Rhadia Cousot, and Alan Mycroft

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Patrick Cousot, Rhadia Cousot, and Alan Mycroft. Abstract Interpretation (Dagstuhl Seminar 9535). Dagstuhl Seminar Report 123, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1995)

Copy BibTex To Clipboard

@TechReport{cousot_et_al:DagSemRep.123,
  author =	{Cousot, Patrick and Cousot, Rhadia and Mycroft, Alan},
  title =	{{Abstract Interpretation (Dagstuhl Seminar 9535)}},
  pages =	{1--20},
  ISSN =	{1619-0203},
  year =	{1995},
  type = 	{Dagstuhl Seminar Report},
  number =	{123},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.123},
  URN =		{urn:nbn:de:0030-drops-150116},
  doi =		{10.4230/DagSemRep.123},
}
  • Refine by Author
  • 3 Cousot, Patrick
  • 1 Alglave, Jade
  • 1 Cousot, Rhadia
  • 1 Kroening, Daniel
  • 1 Mycroft, Alan
  • Show More...

  • Refine by Classification
  • 1 Theory of computation → Abstraction
  • 1 Theory of computation → Invariants

  • Refine by Keyword
  • 2 Verification
  • 1 Bug finding
  • 1 Compilation
  • 1 Computer Memory
  • 1 Concurrency
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 1 1995
  • 1 2014
  • 1 2017
  • 1 2020

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact