Travelled to:1 × Estonia
1 × Russia
1 × United Kingdom
Collaborated with:T.Vojnar L.Holík J.Simácek A.Rogalewicz T.Fiedor V.Havlena M.Hruska Y.Chen M.Heizmann Yong Li 0031 M.Tsai A.Turrini L.Z.0001
Talks about:automata (5) analysi (2) forest (2) shape (2) tree (2) base (2) determinist (1) contribut (1) antichain (1) algorithm (1)
Person: Ondrej Lengál
DBLP: Leng=aacute=l:Ondrej
Contributed to:
2015
20132012
2019
2018Wrote 6 papers:
- 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-2013-HolikLRSV #analysis #automation #automaton
- Fully Automated Shape Analysis Based on Forest Automata (LH, OL, AR, JS, TV), pp. 740–755.
- TACAS-2012-LengalSV #automaton #library #named #nondeterminism #performance
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (OL, JS, TV), pp. 79–94.
- CADE-2019-HavlenaHLV #automaton #lazy evaluation
- Automata Terms in a Lazy WSkS Decision Procedure (VH, LH, OL, TV), pp. 300–318.
- PLDI-2018-ChenHLLTTZ #algorithm #termination
- Advanced automata-based algorithms for program termination checking (YFC, MH, OL, YL0, MHT, AT, LZ0), pp. 135–150.