Ing.
Martin Hruška
Ph.D.
FIT, VZ Automata@FIT – člen pracovní skupiny
+420 54114 1331
ihruska@fit.vut.cz
Publikace
2024
HOLÍK, L.; CHOCHOLATÝ, D.; FIEDOR, T.; HAVLENA, V.; HRUŠKA, M.; LENGÁL, O.; SÍČ, J. Mata: A Fast and Simple Finite Automata Library. Proceedings of TACAS'24. Lecture Notes in Computer Science. Luxembourgh: Springer Verlag, 2024.
s. 130-151. ISSN: 0302-9743.
Detail | WWW2023
HOLÍK, L.; HRUŠKA, M.; SÍČ, J.; VARGOVČÍK, P.; FIEDOR, T.; ROGALEWICZ, A. Reasoning about Regular Properties: A Comparative Study. In Automated Deduction - CADE 29. Lecture Notes in Computer Science. Cham: Springer Nature Switzerland AG, 2023.
s. 286-306. ISSN: 0302-9743.
DetailHRUŠKA, M.; FIEDOR, T.; SMRČKA, A. Orchestrating Digital Twins for Distributed Manufacturing Execution Systems. In Computer Aided Systems Theory - EUROCAST 2022. Lecture Notes in Computer Science. Zurich: Springer International Publishing, 2023.
s. 223-231. ISBN: 978-3-031-25311-9.
Detail | WWW2021
HOLÍK, L.; HRUŠKA, M. Towards Efficient Shape Analysis with Tree Automata. In Proceedings International Conference on Networked Systems. Lecture Notes in Computer Science. Lecture notes in Computer Science. Cham: Springer Verlag, 2021.
s. 206-214. ISSN: 0302-9743.
Detail2020
HRUŠKA, M.; CHALUPA, M.; JAŠEK, T.; STREJČEK, J.; ŠOKOVÁ, V.; VOJNAR, T.; AYAZIOVÁ, P.; TOMOVIČ, L. Symbiotic 7: Integration of Predator and More (Competition Contribution). In Proceedings of TACAS 2020 (2). Lecture Notes in Computer Science. Cham: Springer International Publishing, 2020.
s. 413-417. ISBN: 978-3-030-45236-0.
Detail | WWW2018
HRUŠKA, M.; MALÍK, V.; SCHRAMMEL, P.; VOJNAR, T. Template-Based Verification of Heap-Manipulating Programs. In Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design. Austin: FMCAD Inc., 2018.
s. 103-111. ISBN: 978-0-9835678-8-2.
Detail | WWW2017
HOLÍK, L.; HRUŠKA, M.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. In Proceedings of VMCAI'17. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Cham: Springer Verlag, 2017.
s. 288-309. ISBN: 978-3-319-52234-0. ISSN: 0302-9743.
Detail | WWWHRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T. Forester: From Heap Shapes to Automata Predicates. In Proceedings of TACAS'17. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2017.
s. 365-369. ISBN: 978-3-662-54580-5.
Detail | WWWHRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. Brno: Faculty of Information Technology BUT, 2017.
s. 1-23.
Detail2016
HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Run Forester, Run Backwards! (Competition Contribution). In Proceedings of TACAS'16. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2016.
s. 923-926. ISBN: 978-3-662-49673-2.
Detail | WWW2015
HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Forester: Shape Analysis Using Tree Automata (Competition Contribution). In Proceedings of TACAS'15. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2015.
s. 432-435. ISBN: 978-3-662-46680-3.
Detail | WWW
*) Citace publikací se generují jednou za 24 hodin.