pdf-format: |
|
@InProceedings{guneau_et_al:LIPIcs:2019:11073, author = {Arma{\"e}l Gu{\'e}neau and Jacques-Henri Jourdan and Arthur Chargu{\'e}raud and Fran{\c{c}}ois Pottier}, title = {{Formal Proof and Analysis of an Incremental Cycle Detection Algorithm}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {18:1--18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {John Harrison and John O'Leary and Andrew Tolmach}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11073}, URN = {urn:nbn:de:0030-drops-110739}, doi = {10.4230/LIPIcs.ITP.2019.18}, annote = {Keywords: interactive deductive program verification, complexity analysis} }
Keywords: | interactive deductive program verification, complexity analysis | |
Seminar: | 10th International Conference on Interactive Theorem Proving (ITP 2019) | |
Issue date: | 2019 | |
Date of publication: | 05.09.2019 | |
Supplementary Material: | The Coq development is accessible at https://gitlab.inria.fr/agueneau/incremental-cycles, and the mechanized metatheory of Separation Logic with Time Credits is available at https://gitlab.inria.fr/charguer/cfml2. |