Follow
Ondřej Lengál
Title
Cited by
Cited by
Year
Fully automated shape analysis based on forest automata
L Holík, O Lengál, A Rogalewicz, J Šimáček, T Vojnar
International Conference on Computer Aided Verification, 740-755, 2013
602013
VATA: A Library for Efficient Manipulation of Non-Deterministic Tree Automata⋆
O Lengál, J Šimáček, T Vojnar
532012
Compositional entailment checking for a fragment of separation logic
C Enea, O Lengál, M Sighireanu, T Vojnar
Asian Symposium on Programming Languages and Systems, 314-333, 2014
502014
Advanced automata-based algorithms for program termination checking
YF Chen, M Heizmann, O Lengál, Y Li, MH Tsai, A Turrini, L Zhang
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language …, 2018
462018
Verification of heap manipulating programs with ordered data by extended forest automata
PA Abdulla, L Holík, B Jonsson, O Lengál, CQ Trinh, T Vojnar
Acta Informatica, 1-29, 2015
342015
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection
M Češka, V Havlena, L Holík, O Lengál, T Vojnar
International Conference on Tools and Algorithms for the Construction and …, 2018
312018
PAC learning-based verification and model synthesis
YF Chen, C Hsieh, O Lengál, TJ Lii, MH Tsai, BY Wang, F Wang
Proceedings of the 38th International Conference on Software Engineering …, 2016
282016
Regex matching with counting-set automata
L Turoňová, L Holík, O Lengál, O Saarikivi, M Veanes, T Vojnar
Proceedings of the ACM on Programming Languages 4 (OOPSLA), 1-30, 2020
262020
Fair Termination for Parameterized Probabilistic Concurrent Systems
O Lengál, AW Lin, R Majumdar, P Rümmer
International Conference on Tools and Algorithms for the Construction and …, 2017
252017
An executable sequential specification for Spark aggregation
YF Chen, CD Hong, O Lengál, SC Mu, N Sinha, BY Wang
International Conference on Networked Systems, 421-438, 2017
232017
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata
M Ceška, V Havlena, L Holík, J Korenek, O Lengál, D Matoušek, ...
2019 IEEE 27th Annual International Symposium on Field-Programmable Custom …, 2019
222019
Register automata with linear arithmetic
YF Chen, O Lengál, T Tan, Z Wu
Logic in Computer Science (LICS), 2017 32nd Annual ACM/IEEE Symposium on, 1-12, 2017
192017
Efficient inclusion checking on explicit and semi-symbolic tree automata
L Holík, O Lengál, J Šimáček, T Vojnar
9th International Symposium on Automated Technology for Verification and …, 2011
182011
Lazy automata techniques for WS1S
T Fiedor, L Holík, P Janků, O Lengál, T Vojnar
International Conference on Tools and Algorithms for the Construction and …, 2017
162017
Succinct Determinisation of Counting Automata via Sphere Construction
L Holík, O Lengál, O Saarikivi, L Turoňová, M Veanes, T Vojnar
Asian Symposium on Programming Languages and Systems, 468-489, 2019
142019
Towards formal relaxed equivalence checking in approximate computing methodology
L Holık, O Lengál, A Rogalewicz, L Sekanina, Z Vašıcek, T Vojnar
2nd Workshop on Approximate Computing (WAPCO’16), 48, 2016
142016
Nested antichains for WS1S
T Fiedor, L Holík, O Lengál, T Vojnar
International Conference on Tools and Algorithms for the Construction and …, 2015
142015
Methodology for fast pattern matching by deterministic finite automaton with perfect hashing
J Kaštil, J Kořenek, O Lengál
12th Euromicro Conference on Digital System Design, Architectures, Methods …, 2009
142009
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
V Havlena, O Lengál
32nd International Conference on Concurrency Theory (CONCUR 2021), 2021
11*2021
Simulations in Rank-Based Büchi Automata Complementation
YF Chen, V Havlena, O Lengál
Asian Symposium on Programming Languages and Systems, 447-467, 2019
112019
The system can't perform the operation now. Try again later.
Articles 1–20