License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2019.3
URN: urn:nbn:de:0030-drops-109056
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10905/
Go to the corresponding LIPIcs Volume Portal


Ouaknine, JoŽl

Program Invariants (Invited Talk)

pdf-format:
LIPIcs-CONCUR-2019-3.pdf (0.2 MB)


Abstract

Automated invariant generation is a fundamental challenge in program analysis and verification, going back many decades, and remains a topic of active research. In this talk I'll present a select overview and survey of work on this problem, and discuss unexpected connections to other fields including algebraic geometry, group theory, and quantum computing. (No previous knowledge of these topics will be assumed.) This is joint work with Ehud Hrushovski, Amaury Pouly, and James Worrell.

BibTeX - Entry

@InProceedings{ouaknine:LIPIcs:2019:10905,
  author =	{Jo{\"e}l Ouaknine},
  title =	{{Program Invariants (Invited Talk)}},
  booktitle =	{30th International Conference on Concurrency Theory (CONCUR 2019)},
  pages =	{3:1--3:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-121-4},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{140},
  editor =	{Wan Fokkink and Rob van Glabbeek},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10905},
  URN =		{urn:nbn:de:0030-drops-109056},
  doi =		{10.4230/LIPIcs.CONCUR.2019.3},
  annote =	{Keywords: Automated invariant generation, program analysis and verification}
}

Keywords: Automated invariant generation, program analysis and verification
Seminar: 30th International Conference on Concurrency Theory (CONCUR 2019)
Issue Date: 2019
Date of publication: 26.08.2019


DROPS-Home | Imprint | Privacy Published by LZI