pdf-format: |
|
@InProceedings{brunner_et_al:LIPIcs:2019:11066, author = {Julian Brunner and Benedikt Seidl and Salomon Sickert}, title = {{A Verified and Compositional Translation of LTL to Deterministic Rabin Automata}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {11:1--11:19}, 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/11066}, URN = {urn:nbn:de:0030-drops-110664}, doi = {10.4230/LIPIcs.ITP.2019.11}, annote = {Keywords: Automata Theory, Automata over Infinite Words, Deterministic Automata, Linear Temporal Logic, Model Checking, Verified Algorithms} }
Keywords: | Automata Theory, Automata over Infinite Words, Deterministic Automata, Linear Temporal Logic, Model Checking, Verified Algorithms | |
Seminar: | 10th International Conference on Interactive Theorem Proving (ITP 2019) | |
Issue date: | 2019 | |
Date of publication: | 05.09.2019 | |
Supplementary Material: | The described Isabelle/HOL development is archived in the "Archive of Formal Proofs" and is split into the entries [Julian Brunner, 2017] and [Benedikt Seidl and Salomon Sickert, 2019]. |