Program Invariants (Invited Talk)

Ouaknine, Joël

doi:10.4230/LIPIcs.CONCUR.2019.3

Document

Program Invariants (Invited Talk)

Author Joël Ouaknine

Part of: Volume: 30th International Conference on Concurrency Theory (CONCUR 2019)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Concurrency Theory (CONCUR)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2019-08-20

PDF

File

PDF

LIPIcs.CONCUR.2019.3.pdf

Filesize: 177 kB
1 pages

Document Identifiers

DOI: 10.4230/LIPIcs.CONCUR.2019.3
URN: urn:nbn:de:0030-drops-109056

Subject Classification

ACM Subject Classification

Theory of computation → Invariants

Keywords

Automated invariant generation
program analysis and verification

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Joël Ouaknine. Program Invariants (Invited Talk). In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/LIPIcs.CONCUR.2019.3

Author Details

Joël Ouaknine

Max Planck Institute for Software Systems, Saarbrücken, Germany
Oxford University, UK

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail