var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fnagilooh.github.io%2Fpublications.bib&jsonp=1&theme=side&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fnagilooh.github.io%2Fpublications.bib&jsonp=1&theme=side\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fnagilooh.github.io%2Fpublications.bib&jsonp=1&theme=side\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2026\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n From Constraints to Commands: Graph Pattern Differentiation in 4-Valued First-Order Logic.\n \n \n \n \n\n\n \n Ficsor, A.; Papp, I. A.; Marussy, K.; and Semeráth, O.\n\n\n \n\n\n\n JOURNAL OF OBJECT TECHNOLOGY,1-14. 2026.\n \n\n\n\n
\n\n\n\n \n \n \"From mtmt\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{MTMT:37312880,\n\ttitle = {From Constraints to Commands: Graph Pattern Differentiation in 4-Valued First-Order Logic},\n\turl_mtmt = {https://m2.mtmt.hu/api/publication/37312880},\n\tauthor = {Ficsor, Attila and Papp, Inez Anna and Marussy, Kristóf and Semeráth, Oszkár},\n\tjournal-iso = {J OBJECT TECHNOL},\n\tjournal = {JOURNAL OF OBJECT TECHNOLOGY},\n\tunique-id = {37312880},\n\tissn = {1660-1769},\n\tyear = {2026},\n\tpages = {1-14},\n\torcid-numbers = {Ficsor, Attila/0000-0002-0541-4590; Marussy, Kristóf/0000-0002-9135-8256; Semeráth, Oszkár/0000-0002-3592-5105}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automated and logically exhaustive generation of traffic scenarios at road junctions using a multi-level danger definition.\n \n \n \n \n\n\n \n Babikian, A. A.; Ficsor, A.; Semeráth, O.; Mussbacher, G.; and Varró, D.\n\n\n \n\n\n\n SOFTWARE AND SYSTEMS MODELING. 2026.\n \n\n\n\n
\n\n\n\n \n \n \"Automated mtmt\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{MTMT:37253633,\n\ttitle = {Automated and logically exhaustive generation of traffic scenarios at road junctions using a multi-level danger definition},\n\turl_mtmt = {https://m2.mtmt.hu/api/publication/37253633},\n\tauthor = {Babikian, Aren A. and Ficsor, Attila and Semeráth, Oszkár and Mussbacher, Gunter and Varró, Dániel},\n\tdoi = {10.1007/s10270-026-01372-y},\n\tjournal-iso = {SOFTW SYST MODEL},\n\tjournal = {SOFTWARE AND SYSTEMS MODELING},\n\tunique-id = {37253633},\n\tissn = {1619-1366},\n\tabstract = {To ensure their safe use, autonomous driving systems (ADSs) must meet rigorous safety assurance criteria that involve executing maneuvers safely within arbitrary scenarios where other actors perform their intended maneuvers. For that purpose, existing scenario generation approaches optimize search to derive scenarios with high probability of dangerous interactions. In this paper, we hypothesize that at road junctions, potential danger predominantly arises from overlapping paths of individual actors carrying out their designated high-level (abstract) maneuvers. As a step toward ADS safety assurance, we propose an approach to derive an exhaustive set of potentially dangerous logical scenarios at any given road junction, i.e., all permutations of overlapping maneuvers assigned to actors, including the ADS, for a given set of possible maneuvers. From these logical scenarios, we derive concrete-level exact paths that actors must follow to guide simulation-based testing toward potential collisions. We conduct extensive experiments over two realistic road junctions with increasing number of external actors to (1) compare our scenario generation approach to the state-of-the-art Scenic tool and to (2) evaluate the behavior of a state-of-the-art learning-based ADS controller. Results show that (1) our approach outperforms Scenic both in terms of achieved coverage and runtime, and (2) that the ADS-under-test is involved in increasing percentages of unsafe behaviors in simulation, which vary according to abstract scenario properties.},\n\tyear = {2026},\n\teissn = {1619-1374},\n\torcid-numbers = {Ficsor, Attila/0000-0002-0541-4590; Semeráth, Oszkár/0000-0002-3592-5105; Varró, Dániel/0000-0002-8790-252X}\n}\n\n
\n
\n\n\n
\n To ensure their safe use, autonomous driving systems (ADSs) must meet rigorous safety assurance criteria that involve executing maneuvers safely within arbitrary scenarios where other actors perform their intended maneuvers. For that purpose, existing scenario generation approaches optimize search to derive scenarios with high probability of dangerous interactions. In this paper, we hypothesize that at road junctions, potential danger predominantly arises from overlapping paths of individual actors carrying out their designated high-level (abstract) maneuvers. As a step toward ADS safety assurance, we propose an approach to derive an exhaustive set of potentially dangerous logical scenarios at any given road junction, i.e., all permutations of overlapping maneuvers assigned to actors, including the ADS, for a given set of possible maneuvers. From these logical scenarios, we derive concrete-level exact paths that actors must follow to guide simulation-based testing toward potential collisions. We conduct extensive experiments over two realistic road junctions with increasing number of external actors to (1) compare our scenario generation approach to the state-of-the-art Scenic tool and to (2) evaluate the behavior of a state-of-the-art learning-based ADS controller. Results show that (1) our approach outperforms Scenic both in terms of achieved coverage and runtime, and (2) that the ADS-under-test is involved in increasing percentages of unsafe behaviors in simulation, which vary according to abstract scenario properties.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2024\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Refinery: Graph Solver as a Service: Refinement-based Generation and Analysis of Consistent Models.\n \n \n \n \n\n\n \n Marussy, K.; Ficsor, A.; Semeráth, O.; and Varró, D.\n\n\n \n\n\n\n In ICSE-Companion '24: Proceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings, pages 64-68, 2024. \n \n\n\n\n
\n\n\n\n \n \n \"Refinery: pdf\n  \n \n \n \"Refinery: mtmt\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{MTMT:34872599,\n\ttitle = {Refinery: Graph Solver as a Service: Refinement-based Generation and Analysis of Consistent Models},\n\tauthor = {Marussy, Kristóf and Ficsor, Attila and Semeráth, Oszkár and Varró, Dániel},\n\tbooktitle = {ICSE-Companion '24: Proceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings},\n\tdoi = {10.1145/3639478.3640045},\n\tunique-id = {34872599},\n\tyear = {2024},\n\tpages = {64-68},\n\torcid-numbers = {Marussy, Kristóf/0000-0002-9135-8256; Ficsor, Attila/0000-0002-0541-4590; Semeráth, Oszkár/0000-0002-3592-5105; Varró, Dániel/0000-0002-8790-252X},\n\n\turl_pdf = {publications/icse24.pdf}, \n\turl_mtmt = {https://m2.mtmt.hu/api/publication/34872599},\n\tabstract = {Various software and systems engineering scenarios rely on the systematic construction of consistent graph models. However, automatically generating a diverse set of consistent graph models for complex domain specifications is challenging. First, the graph generation problem must be specified with mathematical precision. Moreover, graph generation is a computationally complex task, which necessitates specialized logic solvers. Refinery is a novel open-source software framework to automatically synthesize a diverse set of consistent domain-specific graph models. The framework offers an expressive high-level specification language using partial models to succinctly formulate a wide range of graph generation challenges. Moreover, it provides a modern cloud-based architecture for a scalable graph solver as a service, which uses logic reasoning rules to efficiently synthesize a diverse set of solutions to graph generation problems by partial model refinement. Applications include system-level architecture synthesis, test generation for modeling tools or traffic scenario synthesis for autonomous vehicles. Video demonstration: https://youtu.be/Qy-3udNsWsM. Continuously deployed at: https://refinery.services/. © 2024 IEEE Computer Society. All rights reserved.},\n}\n\n
\n
\n\n\n
\n Various software and systems engineering scenarios rely on the systematic construction of consistent graph models. However, automatically generating a diverse set of consistent graph models for complex domain specifications is challenging. First, the graph generation problem must be specified with mathematical precision. Moreover, graph generation is a computationally complex task, which necessitates specialized logic solvers. Refinery is a novel open-source software framework to automatically synthesize a diverse set of consistent domain-specific graph models. The framework offers an expressive high-level specification language using partial models to succinctly formulate a wide range of graph generation challenges. Moreover, it provides a modern cloud-based architecture for a scalable graph solver as a service, which uses logic reasoning rules to efficiently synthesize a diverse set of solutions to graph generation problems by partial model refinement. Applications include system-level architecture synthesis, test generation for modeling tools or traffic scenario synthesis for autonomous vehicles. Video demonstration: https://youtu.be/Qy-3udNsWsM. Continuously deployed at: https://refinery.services/. © 2024 IEEE Computer Society. All rights reserved.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Initial Performance Analysis of Graph Predicate Evaluation over Partial Models.\n \n \n \n \n\n\n \n Ficsor, A.; and Semeráth, O.\n\n\n \n\n\n\n In Proceedings of the 29th Minisymposium of the Department of Measurement and Information Systems Budapest University of Technology and Economics, pages 1-4, 2022. \n \n\n\n\n
\n\n\n\n \n \n \"An pdf\n  \n \n \n \"An mtmt\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{MTMT:33283704,\n\ttitle = {An Initial Performance Analysis of Graph Predicate Evaluation over Partial Models},\n\tisbn = {9789634218722},\n\tauthor = {Ficsor, Attila and Semeráth, Oszkár},\n\tbooktitle = {Proceedings of the 29th Minisymposium of the Department of Measurement and Information Systems Budapest University of Technology and Economics},\n\tdoi = {10.3311/MINISY2022-001},\n\tunique-id = {33283704},\n\tyear = {2022},\n\tpages = {1-4},\n\torcid-numbers = {Ficsor, Attila/0000-0002-0541-4590; Semeráth, Oszkár/0000-0002-3592-5105},\n\n\turl_pdf = {publications/minisy22.pdf}, \n\turl_mtmt = {https://m2.mtmt.hu/api/publication/33283704},\n\tabstract = {Graph-based modeling tools are widely used during the design, analysis and verification of complex critical systems. Those tools enables the automation of several design steps (e.g., by model transformation), and the early analysis of system designs (e.g. by test generation). The evaluation of complex graph predicates (or graph pattern matching) is a core technique in modeling and model transformation, and essential in scalable graph generation. This motivated the integration of industrial graph pattern matching tools directly to advanced data structures used in model checking and logic reasoning algorithms. In this paper we provide a report of a preliminary performance benchmark combining the incremental graph pattern matching algorithm of the Viatra framework with hash tries used for state space exploration on partial models.},\n}\n\n
\n
\n\n\n
\n Graph-based modeling tools are widely used during the design, analysis and verification of complex critical systems. Those tools enables the automation of several design steps (e.g., by model transformation), and the early analysis of system designs (e.g. by test generation). The evaluation of complex graph predicates (or graph pattern matching) is a core technique in modeling and model transformation, and essential in scalable graph generation. This motivated the integration of industrial graph pattern matching tools directly to advanced data structures used in model checking and logic reasoning algorithms. In this paper we provide a report of a preliminary performance benchmark combining the incremental graph pattern matching algorithm of the Viatra framework with hash tries used for state space exploration on partial models.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Toolchain for the Construction of Realistic Simulated Urban Environments.\n \n \n \n \n\n\n \n Ficsor, A.; and Pintér, B.\n\n\n \n\n\n\n 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Toolchain pdf\n  \n \n \n \"Toolchain mtmt\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@CONFERENCE{MTMT:33283785,\n\ttitle = {Toolchain for the Construction of Realistic Simulated Urban Environments},\n\tauthor = {Ficsor, Attila and Pintér, Balázs},\n\tbooktitle = {The 13th Conference of PhD Students in Computer Science : June 29 – July 1, 2022 Szeged, Hungary},\n\tunique-id = {33283785},\n\tyear = {2022},\n\tpages = {40-44},\n\torcid-numbers = {Ficsor, Attila/0000-0002-0541-4590},\n\n\turl_pdf = {publications/cscs22_2.pdf}, \n\turl_mtmt = {https://m2.mtmt.hu/api/publication/33283785},\n\tabstract = {Testing safety-critical autonomous vehicles (cars, trains, or trams) is an incredibly challenging task: those systems need to interact with an immensely complex and continuously changing environment, making systematic testing unfeasible. Moreover, physical test drives are highly costly, making simulator-based testing a favorable alternative. However, synthetic simulations may fail to provide realistic sensor input, thus hindering the effectiveness of the testing process. This paper proposes a toolchain for the semi-automated construction of realistic road networks using real-world maps. Therefore, better quality simulations can be implemented with higher productivity.},\n}\n\n
\n
\n\n\n
\n Testing safety-critical autonomous vehicles (cars, trains, or trams) is an incredibly challenging task: those systems need to interact with an immensely complex and continuously changing environment, making systematic testing unfeasible. Moreover, physical test drives are highly costly, making simulator-based testing a favorable alternative. However, synthetic simulations may fail to provide realistic sensor input, thus hindering the effectiveness of the testing process. This paper proposes a toolchain for the semi-automated construction of realistic road networks using real-world maps. Therefore, better quality simulations can be implemented with higher productivity.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Semantic Robustness Testing for Vision-Based Machine Learning Components of Autonomous Cyber-Physical Systems.\n \n \n \n \n\n\n \n Ficsor, A.\n\n\n \n\n\n\n 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Semantic pdf\n  \n \n \n \"Semantic mtmt\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@CONFERENCE{MTMT:33283734,\n\ttitle = {Semantic Robustness Testing for Vision-Based Machine Learning Components of Autonomous Cyber-Physical Systems},\n\tauthor = {Ficsor, Attila},\n\tbooktitle = {The 13th Conference of PhD Students in Computer Science : June 29 – July 1, 2022 Szeged, Hungary},\n\tunique-id = {33283734},\n\tyear = {2022},\n\tpages = {35-39},\n\torcid-numbers = {Ficsor, Attila/0000-0002-0541-4590},\n\n\turl_pdf = {publications/cscs22_1.pdf}, \n\turl_mtmt = {https://m2.mtmt.hu/api/publication/33283734},\n\tabstract = {Autonomous cyber-physical systems often utilize vision-based machine learning components. They are frequently part of a safety critical system, requiring special attention during testing. However, testing these systems is an incredibly challenging task, as they need to interact with an immensely complex and continuously changing environment. This makes systematic testing and other safety engineering best practices unfeasible. While some approaches aim to test vision-based machine learning components, these cannot guarantee robustness. In this paper I present a research roadmap of addressing this challenge by (1) proposing a semantic-based robustness testing suite generation approach, (2) determining the minimum level of detail necessary for testing in a simulator, and (3) finding the aspects of the simulation affecting the results. I illustrate my proposed approach on an industrial case study.},\n}
\n
\n\n\n
\n Autonomous cyber-physical systems often utilize vision-based machine learning components. They are frequently part of a safety critical system, requiring special attention during testing. However, testing these systems is an incredibly challenging task, as they need to interact with an immensely complex and continuously changing environment. This makes systematic testing and other safety engineering best practices unfeasible. While some approaches aim to test vision-based machine learning components, these cannot guarantee robustness. In this paper I present a research roadmap of addressing this challenge by (1) proposing a semantic-based robustness testing suite generation approach, (2) determining the minimum level of detail necessary for testing in a simulator, and (3) finding the aspects of the simulation affecting the results. I illustrate my proposed approach on an industrial case study.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);