Lukáš Holík

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Reasoning About Regular Properties: A Comparative Study	2024-04-26	Paper
Fast matching of regular patterns with synchronizing counting	2023-11-24	Paper
Word equations in synergy with regular constraints	2023-08-17	Paper
Simulation algorithms for symbolic automata	2023-07-28	Paper
Simplifying Alternating Automata for Emptiness Testing	2023-03-29	Paper
Solving Not-Substring Constraint withFlat Abstraction	2023-03-29	Paper
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure	2021-11-24	Paper
Abstraction refinement and antichains for trace inclusion of infinite state systems	2021-02-08	Paper
Lazy Automata Techniques for WS1S	2020-08-05	Paper
Chain-Free String Constraints	2020-07-20	Paper
From Shapes to Amortized Complexity	2020-07-07	Paper
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure	2020-03-10	Paper
Reduction of nondeterministic tree automata	2019-09-17	Paper
Nested Antichains for WS1S	2019-09-17	Paper
Nested antichains for WS1S	2019-03-21	Paper
Summaries for Context-Free Games	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q2970249	2017-03-29	Paper
Counterexample Validation and Interpolation-Based Refinement for Forest Automata	2017-02-21	Paper
Verification of heap manipulating programs with ordered data by extended forest automata	2016-06-28	Paper
Pointer Race Freedom	2016-03-23	Paper
From Low-Level Pointers to High-Level Containers	2016-03-23	Paper
Mediator Synthesis in a Component Algebra with Data	2015-11-04	Paper
All for the Price of Few	2014-11-03	Paper
Mediating for reduction (on minimizing alternating Büchi automata)	2014-09-10	Paper
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata	2014-07-23	Paper
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata	2014-07-08	Paper
Forest automata for verification of heap manipulation	2014-03-28	Paper
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures	2013-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q2920108	2012-10-24	Paper
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata	2011-10-07	Paper
Advanced Ramsey-Based Büchi Automata Inclusion Testing	2011-09-02	Paper
When Simulation Meets Antichains	2010-04-27	Paper
COMPOSED BISIMULATION FOR TREE AUTOMATA	2009-08-21	Paper
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata	2009-02-12	Paper
Composed Bisimulation for Tree Automata	2009-02-12	Paper
Computing Simulations over Tree Automata	2008-04-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Lukáš Holík