Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Advanced Ramsey-Based Büchi Automata Inclusion Testing.

P. Abdulla, Y. Chen, L. Clemente, L. Holík, C. Hong, R. Mayr, and T. Vojnar. CONCUR, volume 6901 of Lecture Notes in Computer Science, page 187-202. Springer, (2011)

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.

Nina Lukashina University of Stuttgart

Lukas Hauser University of Stuttgart

Lukas Münch University of Stuttgart

Lukas Reiner University of Stuttgart

Lukas Schmelzeisen University of Stuttgart

Other publications of authors with the same name

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.P. Abdulla, Y. Chen, L. Clemente, L. Holík, C. Hong, R. Mayr, and T. Vojnar. CAV, volume 6174 of Lecture Notes in Computer Science, page 132-147. Springer, (2010)Automata Terms in a Lazy WSkS Decision Procedure (Technical Report).V. Havlena, L. Holík, O. Lengál, and T. Vojnar. CoRR, (2019)Effect Summaries for Thread-Modular Analysis.L. Holík, R. Meyer, T. Vojnar, and S. Wolff. CoRR, (2017)Simulations and Antichains for Efficient Handling of Finite Automata.L. Holík. CoRR, (2017)Computing Simulations over Tree Automata.P. Abdulla, A. Bouajjani, L. Holík, L. Kaati, and T. Vojnar. TACAS, volume 4963 of Lecture Notes in Computer Science, page 93-108. Springer, (2008)Nested Antichains for WS1S.T. Fiedor, L. Holík, O. Lengál, and T. Vojnar. TACAS, volume 9035 of Lecture Notes in Computer Science, page 658-674. Springer, (2015)Flatten and conquer: a framework for efficient analysis of string constraints.P. Abdulla, M. Atig, Y. Chen, B. Diep, L. Holík, A. Rezine, and P. Rümmer. PLDI, page 602-617. ACM, (2017)Pointer Race Freedom.F. Haziza, L. Holík, R. Meyer, and S. Wolff. VMCAI, volume 9583 of Lecture Notes in Computer Science, page 393-412. Springer, (2016)Summaries for Context-Free Games.L. Holík, R. Meyer, and S. Muskalla. FSTTCS, volume 65 of LIPIcs, page 41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection.M. Ceska, V. Havlena, L. Holík, O. Lengál, and T. Vojnar. TACAS (2), volume 10806 of Lecture Notes in Computer Science, page 155-175. Springer, (2018)