Automata@FIT

2024

HAVLENA Vojtěch, HOLÍK Lukáš, CHEN Yu-Fang, CHOCHOLATÝ David, LENGÁL Ondřej and SÍČ Juraj. Z3-Noodler: An Automata-based String Solver. In: Proceedings of TACAS'24. Lecture Notes. Luxembourgh: Springer Verlag, 2024, pp. 24-33. ISSN 0302-9743.
Detail

FIEDOR Tomáš, HAVLENA Vojtěch, HOLÍK Lukáš, HRUŠKA Martin, CHOCHOLATÝ David, LENGÁL Ondřej and SÍČ Juraj. Mata: A Fast and Simple Finite Automata Library. In: Proceedings of TACAS'24. Luxembourgh: Springer Verlag, 2024, pp. 130-151. ISSN 0302-9743.
Detail

HABERMEHL Peter, HAVLENA Vojtěch, HEČKO Michal, HOLÍK Lukáš and LENGÁL Ondřej. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. In: Proceedings of CAV'24. Montreal: Springer Verlag, 2024, pp. 42-67. ISSN 0302-9743.
Detail

CHEN Tian-fu, CHEN Yu-Fang, JIANG Jie-hong, JOBRANOVÁ Sára and LENGÁL Ondřej. Accelerating Quantum Circuit Simulation with Symbolic Execution and Loop Summarization. In: IEEE/ACM International Conference on Computer-Aided Design (ICCAD '24), October 27--31, 2024, New York, NY, USA. Association for Computing Machinery, 2024. ISBN 979-8-4007-1077-3.
Detail

HAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej and SÍČ Juraj. Cooking String-Integer Conversions with Noodles. In: Proceedings of SAT'24. Leibniz International Proceedings in Informatics (LIPIcs). Pune: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2024, pp. 1-19. ISSN 1868-8969.
Detail

2023

HAVLENA Vojtěch, LENGÁL Ondřej, LI Yong, ŠMAHLÍKOVÁ Barbora and TURRINI Andrea. Modular Mix-and-Match Complementation of Büchi Automata. In: Proceedings of TACAS'23. Paris: Springer Verlag, 2023, pp. 249-270. ISSN 0302-9743.
Detail

HOLÍK Lukáš, HOLÍKOVÁ Lenka, SÍČ Juraj and VOJNAR Tomáš. Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). Ithaca, 2023.
Detail

HAVLENA Vojtěch, LENGÁL Ondřej, LI Yong, ŠMAHLÍKOVÁ Barbora and TURRINI Andrea. Modular Mix-and-Match Complementation of Büchi Automata (Technical Report). Ithaca: Cornell University Library, 2023.
Detail

BLAHOUDEK František, HAVLENA Vojtěch, HOLÍK Lukáš, CHEN Yu-Fang, CHOCHOLATÝ David, LENGÁL Ondřej and SÍČ Juraj. Word Equations in Synergy with Regular Constraints. In: Proceedings of FM'23. Lübeck: Springer Verlag, 2023, pp. 403-423. ISSN 0302-9743.
Detail

HAVLENA Vojtěch, HAVLENA Vojtěch, CHEN Yu-Fang, CHEN Yu-Fang, LENGÁL Ondřej, LENGÁL Ondřej, TURRINI Andrea and TURRINI Andrea. A symbolic algorithm for the case-split rule in solving word constraints with extensions. Journal of Systems and Software, vol. 201, no. 201, 2023, pp. 111673-111693. ISSN 0164-1212.
Detail

HOLÍKOVÁ Lenka, HORKÝ Michal and SÍČ Juraj. Automata with Bounded Repetition in RE2. In: Computer Aided Systems Theory - EUROCAST 2022. Heidelberg: Springer Verlag, 2023, pp. 232-239. ISSN 0302-9743.
Detail

HOLÍK Lukáš, HOLÍKOVÁ Lenka, SÍČ Juraj and VOJNAR Tomáš. Fast Matching of Regular Patterns with Synchronizing Counting. In: Foundations of Software Science and Computation Structures. Heidelberg: Springer Verlag, 2023, pp. 392-412. ISSN 0302-9743.
Detail

CHEN Yu-Fang, CHEN Yu-Fang, CHUNG Kai-Min, CHUNG Kai-Min, LENGÁL Ondřej, LENGÁL Ondřej, LIN Jyun-ao, LIN Jyun-ao, TSAI Wei-lun, TSAI Wei-lun, YEN Di-de and YEN Di-de. An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits. Proceedings of the ACM on Programming Languages, vol. 7, no. 6, 2023, pp. 1218-1243. ISSN 2475-1421.
Detail

CHEN Yu-Fang, CHUNG Kai-Min, LENGÁL Ondřej, LIN Jyun-ao and TSAI Wei-lun. AutoQ: An Automata-based Quantum Circuit Verifier. In: Proceedings of 35th International Conference on Computer Aided Verification. Cham: Springer Verlag, 2023, pp. 139-153. ISSN 0302-9743.
Detail

FIEDOR Tomáš, FIEDOR Tomáš, HOLÍK Lukáš, HOLÍK Lukáš, HRUŠKA Martin, HRUŠKA Martin, ROGALEWICZ Adam, ROGALEWICZ Adam, SÍČ Juraj, SÍČ Juraj, VARGOVČÍK Pavol and VARGOVČÍK Pavol. Reasoning about Regular Properties: A Comparative Study. In: Automated Deduction - CADE 29. Cham: Springer Nature Switzerland AG, 2023, pp. 286-306. ISSN 0302-9743.
Detail

CHEN Yu-Fang, CHOCHOLATÝ David, HAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej and SÍČ Juraj. Solving String Constraints with Lengths by Stabilization. Proceedings of the ACM on Programming Languages, vol. 7, no. 10, 2023, pp. 2112-2141. ISSN 2475-1421.
Detail

HOLÍK Lukáš and ŠEDÝ Michal. Utilization of Repeating Substructures for Efficient Representation of Automata (Technical Report). Brno, 2023.
Detail

2022

HAVLENA Vojtěch, LENGÁL Ondřej and ŠMAHLÍKOVÁ Barbora. Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Buchi Automata Complementation. In: Proceedings of TACAS'22. Munich: Springer Verlag, 2022, pp. 118-136. ISBN 978-3-030-99526-3. ISSN 0302-9743.
Detail

HAVLENA Vojtěch, LENGÁL Ondřej and ŠMAHLÍKOVÁ Barbora. Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Buchi Automata Complementation (Technical Report). Ithaca, 2022.
Detail

HOLÍKOVÁ Lenka, HOLÍK Lukáš, HOMOLIAK Ivan, LENGÁL Ondřej, VEANES Margus and VOJNAR Tomáš. Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. In: Proceedings of the 31st USENIX Security Symposium. Boston, MA: USENIX, 2022, pp. 4165-4182. ISBN 978-1-939133-31-1.
Detail

HAVLENA Vojtěch, LENGÁL Ondřej and ŠMAHLÍKOVÁ Barbora. Complementing Büchi Automata with Ranker. In: Proceedings of the 34th International Conference on Computer Aided Verification. Haifa: Springer Verlag, 2022, pp. 188-201. ISBN 978-3-031-13187-5. ISSN 0302-9743.
Detail

HAVLENA Vojtěch, LENGÁL Ondřej and ŠMAHLÍKOVÁ Barbora. Complementing Büchi Automata with Ranker (Technical Report). Ithaca: Cornell University Library, 2022.
Detail

GE-ERNST Aile, SCHOLL Christoph, SÍČ Juraj and WIMMER Ralf. Solving dependency quantified Boolean formulas using quantifier localization. Theoretical Computer Science, vol. 2022, no. 925, pp. 1-24. ISSN 0304-3975.
Detail

2021

SÍČ Juraj and STREJČEK Jan. DQBDD: An Efficient BDD-Based DQBF Solver. In: Proc. of the 24th International Conference on Theory and Applications of Satisfiability Testing. Heidelberg: Springer Verlag, 2021, pp. 535-544. ISSN 0302-9743.
Detail