Lukáš Holik

From MaRDI portal
Person:300409

Available identifiers

zbMath Open holik.lukasMaRDI QIDQ300409

List of research outcomes





PublicationDate of PublicationType
Reasoning About Regular Properties: A Comparative Study2024-04-26Paper
Succinct determinisation of counting automata via sphere construction2024-04-19Paper
Fast matching of regular patterns with synchronizing counting2023-11-24Paper
Word equations in synergy with regular constraints2023-08-17Paper
Simulation algorithms for symbolic automata2023-07-28Paper
Simplifying Alternating Automata for Emptiness Testing2023-03-29Paper
Solving Not-Substring Constraint withFlat Abstraction2023-03-29Paper
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure2021-11-24Paper
Abstraction refinement and antichains for trace inclusion of infinite state systems2021-02-08Paper
Lazy Automata Techniques for WS1S2020-08-05Paper
Chain-Free String Constraints2020-07-20Paper
From Shapes to Amortized Complexity2020-07-07Paper
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure2020-03-10Paper
Nested Antichains for WS1S2019-09-17Paper
Reduction of nondeterministic tree automata2019-09-17Paper
Nested antichains for WS1S2019-03-21Paper
Summaries for Context-Free Games2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q29702492017-03-29Paper
Counterexample Validation and Interpolation-Based Refinement for Forest Automata2017-02-21Paper
Verification of heap manipulating programs with ordered data by extended forest automata2016-06-28Paper
Pointer Race Freedom2016-03-23Paper
From Low-Level Pointers to High-Level Containers2016-03-23Paper
Mediator Synthesis in a Component Algebra with Data2015-11-04Paper
All for the Price of Few2014-11-03Paper
Mediating for reduction (on minimizing alternating Büchi automata)2014-09-10Paper
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata2014-07-23Paper
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata2014-07-08Paper
Forest automata for verification of heap manipulation2014-03-28Paper
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures2013-08-05Paper
Mediating for reduction (on minimizing alternating Büchi automata)2012-10-24Paper
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata2011-10-07Paper
Advanced Ramsey-Based Büchi Automata Inclusion Testing2011-09-02Paper
When Simulation Meets Antichains2010-04-27Paper
COMPOSED BISIMULATION FOR TREE AUTOMATA2009-08-21Paper
Composed Bisimulation for Tree Automata2009-02-12Paper
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata2009-02-12Paper
Computing Simulations over Tree Automata2008-04-11Paper

Research outcomes over time

This page was built for person: Lukáš Holik