@InProceedings{brunner_et_al:LIPIcs.ITP.2019.11,
author = {Brunner, Julian and Seidl, Benedikt and Sickert, Salomon},
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 = {Harrison, John and O'Leary, John and Tolmach, Andrew},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.11},
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}
}