Author of the publication

LTL to Büchi Automata Translation: Fast and More Deterministic.

, , , and . TACAS, volume 7214 of Lecture Notes in Computer Science, page 95-109. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Symbolic Memory with Pointers., and . ATVA, volume 8837 of Lecture Notes in Computer Science, page 380-395. Springer, (2014)Fast Computation of Strong Control Dependencies., , , and . CoRR, (2020)Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes? (Experimental Paper)., and . LPAR, volume 57 of EPiC Series in Computing, page 488-497. EasyChair, (2018)ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata., , , , and . ATVA, volume 11781 of Lecture Notes in Computer Science, page 357-365. Springer, (2019)Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation - (Competition Contribution)., and . TACAS (2), volume 13994 of Lecture Notes in Computer Science, page 523-528. Springer, (2023)Decidable Race Condition and Open Coregions in HMSC., , , and . ECEASST, (2010)Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization., , and . CAV (2), volume 12225 of Lecture Notes in Computer Science, page 15-27. Springer, (2020)Joint Forces for Memory Safety Checking., , and . SPIN, volume 10869 of Lecture Notes in Computer Science, page 115-132. Springer, (2018)Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution - (Competition Contribution)., , and . TACAS, volume 7795 of Lecture Notes in Computer Science, page 630-632. Springer, (2013)On Refinement of Büchi Automata for Explicit Model Checking., , , and . SPIN, volume 9232 of Lecture Notes in Computer Science, page 66-83. Springer, (2015)