Lukás Holík - RankMe

118 papers A* 7A 12B 24C 2Misc 1Journal 50Unranked 20

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Parameterized Verification of Quantum Circuits. Proc. ACM Program. Lang. Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hecko, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Ramanathan S. Thinniyam
2025	J	`jnl`	A Uniform Framework for Handling Position Constraints in String Solving (Technical Report). CoRR Yu-Fang Chen, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
2025	J	`jnl`	A Uniform Framework for Handling Position Constraints in String Solving. Proc. ACM Program. Lang. Yu-Fang Chen, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
2025	—	`conf`	Automata Size Reduction by Procedure Finding. NFM Michal Sedý, Lukás Holík
2025	B	`conf`	Negated String Containment Is Decidable. MFCS Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
2025	J	`jnl`	Negated String Containment is Decidable (Technical Report). CoRR Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
2025	B	`conf`	On Complementation of Nondeterministic Finite Automata Without Full Determinization. FCT Lukás Holík, Ondrej Lengál, Juraj Major, Adéla Stepková, Jan Strejcek
2025	J	`jnl`	On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report). CoRR Lukás Holík, Ondrej Lengál, Juraj Major, Adéla Stepková, Jan Strejcek
2025	—	`conf`	On the Verification of Quantum Circuits (Research Challenges and Opportunities). Principles of Formal Quantitative Analysis Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen, Kai-Min Chung, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Fang-Yi Lo, Wei-Lun Tsai
2025	J	`jnl`	Parameterized Verification of Quantum Circuits (Technical Report). CoRR Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hecko, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Ramanathan S. Thinniyam
2025	—	`conf`	Quantum Circuit Verification - A Potential Roadmap (Invited Talk). FSTTCS Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hecko, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Ramanathan Thinniyam Srinivasan
2025	J	`jnl`	Verifying Quantum Circuits with Level-Synchronized Tree Automata. Proc. ACM Program. Lang. Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Fang-Yi Lo, Wei-Lun Tsai
2025	J	`jnl`	Word equations in synergy with regular constraints (extended version). Constraints An Int. J. Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
2025	—	`conf`	Z3-Noodler 1.3: Shepherding Decision Procedures for Strings with Model Generation. TACAS (2) David Chocholatý, Vojtech Havlena, Lukás Holík, Jan Hranicka, Ondrej Lengál, Juraj Síc
2024	—	`conf`	Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) Peter Habermehl, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
2024	J	`jnl`	Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CoRR Peter Habermehl, Michal Hecko, Vojtech Havlena, Lukás Holík, Ondrej Lengál
2024	A	`conf`	Antichain with SAT and Tries. SAT Lukás Holík, Pavol Vargovcík
2024	J	`jnl`	Automata Size Reduction by Procedure Finding. CoRR Michal Sedý, Lukás Holík
2024	A	`conf`	Cooking String-Integer Conversions with Noodles. SAT Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
2024	—	`conf`	Mata: A Fast and Simple Finite Automata Library. TACAS (2) David Chocholatý, Tomás Fiedor, Vojtech Havlena, Lukás Holík, Martin Hruska, Ondrej Lengál, Juraj Síc
2024	J	`jnl`	Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report). CoRR Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Fang-Yi Lo, Wei-Lun Tsai
2024	—	`conf`	Z3-Noodler: An Automata-based String Solver. TACAS (1) Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
2023	J	`jnl`	Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication. IEEE Trans. Smart Grid Vojtech Havlena, Petr Matousek, Ondrej Rysavý, Lukás Holík
2023	J	`jnl`	Chain-Free String Constraints (Technical Report). CoRR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku
2023	J	`jnl`	Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). CoRR Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar
2023	B	`conf`	Fast Matching of Regular Patterns with Synchronizing Counting. FoSSaCS Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar
2023	J	`jnl`	Mata, a Fast and Simple Finite Automata Library (Technical Report). CoRR David Chocholatý, Tomás Fiedor, Vojtech Havlena, Lukás Holík, Martin Hruska, Ondrej Lengál, Juraj Síc
2023	J	`jnl`	Optimizing an LTS-Simulation Algorithm (Technical Report). CoRR Lukás Holík, Jirí Simácek
2023	A	`conf`	Reasoning About Regular Properties: A Comparative Study. CADE Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
2023	J	`jnl`	Reasoning about Regular Properties: A Comparative Study. CoRR Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
2023	J	`jnl`	Solving String Constraints with Lengths by Stabilization. Proc. ACM Program. Lang. Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
2023	B	`conf`	Word Equations in Synergy with Regular Constraints. FM Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
2023	J	`jnl`	Z3-Noodler: An Automata-based String Solver (Technical Report). CoRR Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
2022	B	`ed.`	Automated Technology for Verification and Analysis - 20th International Symposium, ATVA 2022, Virtual Event, October 25-28, 2022, Proceedings ATVA Ahmed Bouajjani, Lukás Holík, Zhilin Wu
2022	A*	`conf`	Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. USENIX Security Symposium Lenka Turonová, Lukás Holík, Ivan Homoliak, Ondrej Lengál, Margus Veanes, Tomás Vojnar
2022	J	`jnl`	Low-Level Bi-Abduction (Artifact). Dagstuhl Artifacts Ser. Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
2022	A	`conf`	Low-Level Bi-Abduction. ECOOP Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
2022	J	`jnl`	Low-Level Bi-Abduction. CoRR Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
2022	J	`jnl`	Word Equations in Synergy with Regular Constraints (Technical Report). CoRR Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
2021	J	`jnl`	Automata Terms in a Lazy WSkS Decision Procedure. J. Autom. Reason. Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2021	J	`jnl`	Correction to: An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
2021	B	`conf`	Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata. IM Petr Matousek, Vojtech Havlena, Lukás Holík
2021	B	`conf`	Simplifying Alternating Automata for Emptiness Testing. APLAS Pavol Vargovcík, Lukás Holík
2021	B	`conf`	Solving Not-Substring Constraint withFlat Abstraction. APLAS Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Denghang Hu, Wei-Lun Tsai, Zhilin Wu, Di-De Yen
2021	—	`conf`	Towards Efficient Shape Analysis with Tree Automata. NETYS Martin Hruska, Lukás Holík
2020	J	`jnl`	Abstraction refinement and antichains for trace inclusion of infinite state systems. Formal Methods Syst. Des. Lukás Holík, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2020	B	`conf`	Antiprenexing for WSkS: A Little Goes a Long Way. LPAR Vojtech Havlena, Lukás Holík, Ondrej Lengál, Ondrej Vales, Tomás Vojnar
2020	J	`jnl`	Approximate reduction of finite automata for high-speed network intrusion detection. Int. J. Softw. Tools Technol. Transf. Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2020	A*	`conf`	Efficient handling of string-number conversion. PLDI Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Julian Dolby, Petr Janku, Hsin-hung Lin, Lukás Holík, Wei-Cheng Wu
2020	J	`jnl`	Regex matching with counting-set automata. Proc. ACM Program. Lang. Lenka Turonová, Lukás Holík, Ondrej Lengál, Olli Saarikivi, Margus Veanes, Tomás Vojnar
2020	J	`jnl`	String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report). CoRR Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, Tomás Vojnar
2019	J	`jnl`	Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). CoRR Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2019	A	`conf`	Automata Terms in a Lazy WSkS Decision Procedure. CADE Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2019	B	`conf`	Chain-Free String Constraints. ATVA Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku
2019	Misc	`conf`	Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. FCCM Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar
2019	J	`jnl`	Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. CoRR Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar
2019	B	`conf`	J-ReCoVer: Java Reducer Commutativity Verifier. APLAS Yu-Fang Chen, Chang-Yi Chiang, Lukás Holík, Wei-Tsung Kao, Hsin-hung Lin, Tomás Vojnar, Yean-Fu Wen, Wei-Cheng Wu
2019	J	`jnl`	Nested antichains for WS1S. Acta Informatica Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2019	J	`jnl`	Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). CoRR Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar
2019	B	`conf`	Succinct Determinisation of Counting Automata via Sphere Construction. APLAS Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar
2018	—	`conf`	Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. TACAS (2) Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2018	B	`conf`	From Shapes to Amortized Complexity. VMCAI Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger
2018	J	`jnl`	Simulation Algorithms for Symbolic Automata (Technical Report). CoRR Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar
2018	B	`conf`	Simulation Algorithms for Symbolic Automata. ATVA Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar
2018	J	`jnl`	String constraints with concatenation and transducers solved efficiently. Proc. ACM Program. Lang. Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, Tomás Vojnar
2018	B	`conf`	Trau: SMT solver for string constraints. FMCAD Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer
2017	J	`jnl`	An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
2017	J	`jnl`	Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. CoRR Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2017	B	`conf`	Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Tomás Vojnar
2017	B	`conf`	Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic. SAS Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff
2017	J	`jnl`	Effect Summaries for Thread-Modular Analysis. CoRR Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff
2017	A*	`conf`	Flatten and conquer: a framework for efficient analysis of string constraints. PLDI Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer
2017	—	`conf`	Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2017	—	`conf`	Lazy Automata Techniques for WS1S. TACAS (1) Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar
2017	J	`jnl`	Lazy Automata Techniques for WS1S. CoRR Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar
2017	J	`jnl`	Simulations and Antichains for Efficient Handling of Finite Automata. CoRR Lukás Holík
2017	—	`conf`	Towards Smaller Invariants for Proving Coverability. EUROCAST (2) Lenka Turonová, Lukás Holík
2016	J	`jnl`	Antichains for Inclusion Games. CoRR Lukás Holík, Roland Meyer, Sebastian Muskalla
2016	B	`conf`	From Low-Level Pointers to High-Level Containers. VMCAI Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar
2016	J	`jnl`	Parameterized verification through view abstraction. Int. J. Softw. Tools Technol. Transf. Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
2016	B	`conf`	Pointer Race Freedom. VMCAI Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff
2016	—	`conf`	Predator Shape Analysis Tool Suite. Haifa Verification Conference Lukás Holík, Michal Kotoun, Petr Peringer, Veronika Soková, Marek Trtík, Tomás Vojnar
2016	—	`ed.`	Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2016, Telč, Czech Republic, 21st-23rd October 2016. MEMICS Jan Bouda, Lukás Holík, Jan Kofron, Jan Strejcek, Adam Rambousek
2016	A	`conf`	Reduction of Nondeterministic Tree Automata. TACAS Ricardo Almeida, Lukás Holík, Richard Mayr
2016	A	`conf`	Run Forester, Run Backwards! - (Competition Contribution). TACAS Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2016	—	`conf`	Summaries for Context-Free Games. FSTTCS Lukás Holík, Roland Meyer, Sebastian Muskalla
2016	J	`jnl`	Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
2015	—	`conf`	Antichains for the Verification of Recursive Programs. NETYS Lukás Holík, Roland Meyer
2015	A	`conf`	Forester: Shape Analysis Using Tree Automata - (Competition Contribution). TACAS Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2015	J	`jnl`	From Low-Level Pointers to High-Level Containers. CoRR Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar
2015	—	`conf`	Mediator Synthesis in a Component Algebra with Data. Correct System Design Lukás Holík, Malte Isberner, Bengt Jonsson
2015	A	`conf`	Nested Antichains for WS1S. TACAS Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2015	J	`jnl`	Nested Antichains for WS1S. CoRR Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
2015	—	`conf`	Norn: An SMT Solver for String Constraints. CAV (1) Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukás Holík, Ahmed Rezine, Philipp Rümmer, Jari Stenman
2015	J	`jnl`	Pointer Race Freedom. CoRR Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff
2015	J	`jnl`	Reduction of Nondeterministic Tree Automata. CoRR Ricardo Almeida, Lukás Holík, Richard Mayr
2015	—	`conf`	View Abstraction - A Tutorial (Invited Paper). SynCoP Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
2014	B	`conf`	Block Me If You Can! - Context-Sensitive Parameterized Verification. SAS Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
2014	J	`jnl`	Mediating for reduction (on minimizing alternating Büchi automata). Theor. Comput. Sci. Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar
2014	—	`ed.`	Proceedings 15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013, Hanoi, Vietnam, 14th October 2013. INFINITY Lukás Holík, Lorenzo Clemente
2014	A*	`conf`	String Constraints for Verification. CAV Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukás Holík, Ahmed Rezine, Philipp Rümmer, Jari Stenman
2013	B	`conf`	All for the Price of Few. VMCAI Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
2013	A	`conf`	An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. TACAS Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
2013	J	`jnl`	Fully Automated Shape Analysis Based on Forest Automata CoRR Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2013	A*	`conf`	Fully Automated Shape Analysis Based on Forest Automata. CAV Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2013	B	`conf`	Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
2012	J	`jnl`	Forest automata for verification of heap manipulation. Formal Methods Syst. Des. Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2011	B	`conf`	Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
2011	B	`conf`	Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata. ATVA Lukás Holík, Ondrej Lengál, Jirí Simácek, Tomás Vojnar
2011	A*	`conf`	Forest Automata for Verification of Heap Manipulation. CAV Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2010	A*	`conf`	Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
2010	A	`conf`	When Simulation Meets Antichains. TACAS Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar
2009	J	`jnl`	Composed Bisimulation for Tree Automata. Int. J. Found. Comput. Sci. Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar
2009	—	`conf`	Mediating for Reduction (on Minimizing Alternating Büchi Automata). FSTTCS Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar
2008	—	`conf`	A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. MEMICS Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, Tomás Vojnar
2008	C	`conf`	Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. CIAA Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar
2008	C	`conf`	Composed Bisimulation for Tree Automata. CIAA Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar
2008	A	`conf`	Computing Simulations over Tree Automata. TACAS Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar