Travelled to:1 × Austria
1 × Cyprus
1 × Germany
1 × Hungary
1 × Russia
2 × Italy
2 × United Kingdom
3 × USA
Collaborated with:T.Vojnar P.A.Abdulla O.Lengál F.Haziza A.Bouajjani Y.Chen A.Rezine P.Rümmer L.Kaati A.Rogalewicz J.Simácek M.F.Atig P.Habermehl R.Mayr J.Stenman T.Fiedor V.Havlena B.Jonsson T.Touili Petr Janku A.W.Lin M.Hruska L.Clemente C.Hong Bui Phi Diep
Talks about:automata (9) tree (5) constraint (4) string (4) verif (4) antichain (3) analysi (3) forest (3) simul (3) base (3)
Person: Lukás Holík
DBLP: Hol=iacute=k:Luk=aacute=s
Contributed to:
2015
20152014
201420132013
2013201120102010
200820092008
2019
2017
2018Wrote 18 papers:
- CAV-2015-AbdullaACHRRS #constraints #named #smt #string
- Norn: An SMT Solver for String Constraints (PAA, MFA, YFC, LH, AR, PR, JS), pp. 462–469.
- TACAS-2015-FiedorHLV #anti
- Nested Antichains for WS1S (TF, LH, OL, TV), pp. 658–674.
- TACAS-2015-HolikHLRSV #analysis #automaton #contest #named #using
- Forester: Shape Analysis Using Tree Automata — (Competition Contribution) (LH, MH, OL, AR, JS, TV), pp. 432–435.
- CAV-2014-AbdullaACHRRS #constraints #string #verification
- String Constraints for Verification (PAA, MFA, YFC, LH, AR, PR, JS), pp. 150–166.
- SAS-2014-AbdullaHH #exclamation #verification
- Block Me If You Can! — Context-Sensitive Parameterized Verification (PAA, FH, LH), pp. 1–17.
- CAV-2013-HolikLRSV #analysis #automation #automaton
- Fully Automated Shape Analysis Based on Forest Automata (LH, OL, AR, JS, TV), pp. 740–755.
- TACAS-2013-AbdullaHHJR #concurrent #data type #specification #verification
- An Integrated Specification and Verification Technique for Highly Concurrent Data Structures (PAA, FH, LH, BJ, AR), pp. 324–338.
- VMCAI-2013-AbdullaHH
- All for the Price of Few (PAA, FH, LH), pp. 476–495.
- CAV-2011-HabermehlHRSV #automaton #verification
- Forest Automata for Verification of Heap Manipulation (PH, LH, AR, JS, TV), pp. 424–440.
- CAV-2010-AbdullaCCHHMV #automaton #simulation #testing
- Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.
- TACAS-2010-AbdullaCHMV #anti #simulation
- When Simulation Meets Antichains (PAA, YFC, LH, RM, TV), pp. 158–174.
- CIAA-2008-AbdullaBHKV #automaton #bisimulation
- Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.
- CIAA-2008-BouajjaniHHTV #automaton #finite #nondeterminism #testing
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (AB, PH, LH, TT, TV), pp. 57–67.
- CIAA-J-2008-AbdullaBHKV09 #automaton #bisimulation
- Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 685–700.
- TACAS-2008-AbdullaBHKV #automaton #simulation
- Computing Simulations over Tree Automata (PAA, AB, LH, LK, TV), pp. 93–108.
- CADE-2019-HavlenaHLV #automaton #lazy evaluation
- Automata Terms in a Lazy WSkS Decision Procedure (VH, LH, OL, TV), pp. 300–318.
- PLDI-2017-AbdullaACDHRR #analysis #constraints #framework #performance #string
- Flatten and conquer: a framework for efficient analysis of string constraints (PAA, MFA, YFC, BPD, LH, AR, PR), pp. 602–617.
- POPL-2018-HolikJLRV #constraints #string #transducer
- String constraints with concatenation and transducers solved efficiently (LH, PJ, AWL, PR, TV), p. 32.