Martin Hruška
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Martin Hruška has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Lukáš Holík
Brno University of Technology
5 shared publications - Tomáš Fiedor
Brno University of Technology
5 shared publications - Juraj Síč
Brno University of Technology
4 shared publications - Ondřej Lengál
Brno University of Technology, Faculty of Information Technology, Brno, Czech Republic
3 shared publications Adam Rogalewicz
Brno University of Technology
2 shared publications- David Chocholatý
Brno University of Technology
2 shared publications
Latest Publications
- Open Access
- 5 April 2024
- Published by Springer Nature
- p. 130-151
Mata: A Fast and Simple Finite Automata Library
Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library also implements a Python binding.The library comes with a large benchmark of automata problems collected from relevant applications such as string constraint solving, regular model checking, and reasoning about regular expressions. We show that Mata is on this benchmark significantly faster than all libraries from a wide range of automata libraries we collected. Its usefulness in string constraint solving is demonstrated by the string solver Z3-Noodler, which is based on Mata and outperforms the state of the art in string constraint solving on many standard benchmarks.
- 5 April 2024
- Published by Springer Nature
- p. 130-151
Open AccessMata: A Fast and Simple Finite Automata Library
Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library also implements a Python binding.The library comes with a large benchmark of automata problems collected from relevant applications such as string constraint solving, regular model checking, and reasoning about regular expressions. We show that Mata is on this benchmark significantly faster than all libraries from a wide range of automata libraries we collected. Its usefulness in string constraint solving is demonstrated by the string solver Z3-Noodler, which is based on Mata and outperforms the state of the art in string constraint solving on many standard benchmarks.
- Open Access
Mata, a Fast and Simple Finite Automata Library (Technical Report)
Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a~reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library also implements a Python binding. The library comes with a large benchmark of automata problems collected from relevant applications such as string constraint solving, regular model checking, and reasoning about regular expressions. We show that Mata is on this benchmark significantly faster than all libraries from a wide range of automata libraries we collected. Its usefulness in string constraint solving is demonstrated by the string solver Z3-Noodler, which is based on Mata and outperforms the state of the art in string constraint solving on many standard benchmarks.
Open AccessMata, a Fast and Simple Finite Automata Library (Technical Report)
Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a~reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library also implements a Python binding. The library comes with a large benchmark of automata problems collected from relevant applications such as string constraint solving, regular model checking, and reasoning about regular expressions. We show that Mata is on this benchmark significantly faster than all libraries from a wide range of automata libraries we collected. Its usefulness in string constraint solving is demonstrated by the string solver Z3-Noodler, which is based on Mata and outperforms the state of the art in string constraint solving on many standard benchmarks.
- Open Access
- 2 September 2023
- Published by Springer Nature
- p. 286-306
Reasoning About Regular Properties: A Comparative Study
Several new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata have been proposed recently, especially in the context of analysing regular expressions and in string constraint solving. The new algorithms demonstrated a significant potential, but they have never been systematically compared, neither among each other nor with the state-of-the art implementations of existing (non)deterministic automata-based methods. In this paper, we provide such comparison as well as an overview of the existing algorithms and their implementations. We collect a diverse benchmark mostly originating in or related to practical problems from string constraint solving, analysing LTL properties, and regular model checking, and evaluate collected implementations on it. The results reveal the best tools and hint on what the best algorithms and implementation techniques are. Roughly, although some advanced algorithms are fast, such as antichain algorithms and reductions to IC3/PDR, they are not as overwhelmingly dominant as sometimes presented and there is no clear winner. The simplest NFA-based technology may sometimes be a better choice, depending on the problem source and the implementation style. We believe that our findings are relevant for development of automata techniques as well as for related fields such as string constraint solving.
- 2 September 2023
- Published by Springer Nature
- p. 286-306
Open AccessReasoning About Regular Properties: A Comparative Study
Several new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata have been proposed recently, especially in the context of analysing regular expressions and in string constraint solving. The new algorithms demonstrated a significant potential, but they have never been systematically compared, neither among each other nor with the state-of-the art implementations of existing (non)deterministic automata-based methods. In this paper, we provide such comparison as well as an overview of the existing algorithms and their implementations. We collect a diverse benchmark mostly originating in or related to practical problems from string constraint solving, analysing LTL properties, and regular model checking, and evaluate collected implementations on it. The results reveal the best tools and hint on what the best algorithms and implementation techniques are. Roughly, although some advanced algorithms are fast, such as antichain algorithms and reductions to IC3/PDR, they are not as overwhelmingly dominant as sometimes presented and there is no clear winner. The simplest NFA-based technology may sometimes be a better choice, depending on the problem source and the implementation style. We believe that our findings are relevant for development of automata techniques as well as for related fields such as string constraint solving.
- Open Access
Reasoning about Regular Properties: A Comparative Study
Several new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata (AFA) have been proposed recently, especially in the context of analysing regular expressions and in string constraint solving. The new algorithms demonstrated a significant potential, but they have never been systematically compared, neither among each other nor with the state-of-the art implementations of existing (non)deterministic automata-based methods. In this paper, we provide the first such comparison as well as an overview of the existing algorithms and their implementations. We collect a diverse benchmark mostly originating in or related to practical problems from string constraint solving, analysing LTL properties, and regular model checking, and evaluate collected implementations on it. The results reveal the best tools and hint on what the best algorithms and implementation techniques are. Roughly, although some advanced algorithms are fast, such as antichain algorithms and reductions to IC3/PDR, they are not as overwhelmingly dominant as sometimes presented and there is no clear winner. The simplest NFA-based technology may be actually the best choice, depending on the problem source and implementation style. Our findings should be highly relevant for development of these techniques as well as for related fields such as string constraint solving.
Open AccessReasoning about Regular Properties: A Comparative Study
Several new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata (AFA) have been proposed recently, especially in the context of analysing regular expressions and in string constraint solving. The new algorithms demonstrated a significant potential, but they have never been systematically compared, neither among each other nor with the state-of-the art implementations of existing (non)deterministic automata-based methods. In this paper, we provide the first such comparison as well as an overview of the existing algorithms and their implementations. We collect a diverse benchmark mostly originating in or related to practical problems from string constraint solving, analysing LTL properties, and regular model checking, and evaluate collected implementations on it. The results reveal the best tools and hint on what the best algorithms and implementation techniques are. Roughly, although some advanced algorithms are fast, such as antichain algorithms and reductions to IC3/PDR, they are not as overwhelmingly dominant as sometimes presented and there is no clear winner. The simplest NFA-based technology may be actually the best choice, depending on the problem source and implementation style. Our findings should be highly relevant for development of these techniques as well as for related fields such as string constraint solving.
- 1 January 2022
- Published by Springer Nature
- p. 223-231
Orchestrating Digital Twins for Distributed Manufacturing Execution Systems
- 1 January 2022
- Published by Springer Nature
- p. 223-231
Orchestrating Digital Twins for Distributed Manufacturing Execution Systems
- 2 December 2021
- Published by Springer Nature
- p. 206-214
Towards Efficient Shape Analysis with Tree Automata
- 2 December 2021
- Published by Springer Nature
- p. 206-214
Towards Efficient Shape Analysis with Tree Automata
- 31 March 2017
- Published by Springer Nature
- p. 365-369
Forester: From Heap Shapes to Automata Predicates
- 31 March 2017
- Published by Springer Nature
- p. 365-369
Forester: From Heap Shapes to Automata Predicates
- 1 January 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1798, 030008
Theory versus practice at implementation of inquiry-based approaches into physics education
At present a lot of ideas for student inquiry-based activities accompanied with methodical remarks and instructions for teachers exist and can be used at physics lessons at lower and upper secondary levels. A need of the use of the teaching methods that support an independent student work as well as active learning approaches has been reflected also in the Slovak state educational program at various educational levels. Experiences of teachers who have used inquiry-based approaches in the classrooms are often in the contrary with expectations of these didactical trends. The paper aims to compare the theory and the practice of the implementation of inquiry-based activities in physics teaching. Practical experience was gained implementing activities for science education developed within the Chain Reaction project running at Matej Bel University Banska Bystrica. Opinions of teachers were investigated with the help of questionnaires, evaluation meetings and structured interviews. Their analysis identified many problems that the teachers had met during the implementation of the inquiry-based approaches in their teaching, as well as benefits of those activities for development of student competences.
- 1 January 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1798, 030008
Theory versus practice at implementation of inquiry-based approaches into physics education
At present a lot of ideas for student inquiry-based activities accompanied with methodical remarks and instructions for teachers exist and can be used at physics lessons at lower and upper secondary levels. A need of the use of the teaching methods that support an independent student work as well as active learning approaches has been reflected also in the Slovak state educational program at various educational levels. Experiences of teachers who have used inquiry-based approaches in the classrooms are often in the contrary with expectations of these didactical trends. The paper aims to compare the theory and the practice of the implementation of inquiry-based activities in physics teaching. Practical experience was gained implementing activities for science education developed within the Chain Reaction project running at Matej Bel University Banska Bystrica. Opinions of teachers were investigated with the help of questionnaires, evaluation meetings and structured interviews. Their analysis identified many problems that the teachers had met during the implementation of the inquiry-based approaches in their teaching, as well as benefits of those activities for development of student competences.