@inproceedings{MTMT:37312907,
	title = {Towards evaluating trustworthy modeling assistants},
	url = {https://m2.mtmt.hu/api/publication/37312907},
	author = {Bilicki, Vilmos and Elekes, Márton and Marussy, Kristóf and Vörös, András},
	booktitle = {Second Workshop on Large Language Models For Generative Software Engineering (LLM4SE 2026)},
	unique-id = {37312907},
	year = {2026},
	pages = {1-11},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X; Marussy, Kristóf/0000-0002-9135-8256}
}

@mastersthesis{MTMT:37351028,
	title = {Assessing the quality of graph-based models and modelling languages},
	url = {https://m2.mtmt.hu/api/publication/37351028},
	author = {Elekes, Márton},
	publisher = {Budapest University of Technology and Economics},
	unique-id = {37351028},
	year = {2025},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X}
}

@article{MTMT:35133148,
	title = {To Do or Not to Do: Semantics and Patterns for Do Activities in UML PSSM State Machines},
	url = {https://m2.mtmt.hu/api/publication/35133148},
	author = {Elekes, Márton and Molnár, Vince and Micskei, Zoltán Imre},
	doi = {10.1109/TSE.2024.3422845},
	journal-iso = {IEEE T SOFTWARE ENG},
	journal = {IEEE TRANSACTIONS ON SOFTWARE ENGINEERING},
	volume = {50},
	unique-id = {35133148},
	issn = {0098-5589},
	abstract = {State machines are used in engineering many types of software-intensive systems. UML State Machines extend simple finite state machines with powerful constructs. Among the many extensions, there is one seemingly simple and innocent language construct that fundamentally changes state machines' reactive model of computation: doActivity behaviors. DoActivity behaviors describe behavior that is executed independently from the state machine once entered in a given state, typically modeling complex computation or communication as background tasks. However, the UML specification or textbooks are vague about how the doActivity behavior construct should be appropriately used. This lack of guidance is a severe issue as, when improperly used, doActivities can cause concurrent, non-deterministic bugs that are especially challenging to find and could ruin a seemingly correct software design. The Precise Semantics of UML State Machines (PSSM) specification introduced detailed operational semantics for state machines. To the best of our knowledge, there is no rigorous review yet of doActivity's semantics as specified in PSSM. We analyzed the semantics by collecting evidence from cross-checking the text of the specification, its semantic model and executable test cases, and the simulators supporting PSSM. We synthesized insights about subtle details and emergent behaviors relevant to tool developers and advanced modelers. We reported inconsistencies and missing clarifications in more than 20 issues to the standardization committee. Based on these insights, we studied 11 patterns for doActivities detailing the consequences of using a doActivity in a given situation and discussing countermeasures or alternative design choices. We hope that our analysis of the semantics and the patterns help vendors develop conformant simulators or verification tools and engineers design better state machine models.},
	keywords = {PATTERN; PATTERN; Computation theory; Semantics; Semantics; Semantics; Software design; Temperature measurement; Temperature measurement; Specifications; Unified Modeling Language; Unified Modeling Language; Analytical models; State-machine; Computational modeling; UML; UML; Concurrency; Concurrency; Program debugging; Current measurement; Computational modelling; Concurrent computing; Concurrent computing; PSSM; State machine; Machine state; Simple++; Precise semantic of UML state machine; UML state machine},
	year = {2024},
	eissn = {1939-3520},
	pages = {2124-2141},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X; Molnár, Vince/0000-0002-8204-7595; Micskei, Zoltán Imre/0000-0003-1846-261X}
}

@article{MTMT:33677595,
	title = {Assessing the specification of modelling language semantics: a study on UML PSSM},
	url = {https://m2.mtmt.hu/api/publication/33677595},
	author = {Elekes, Márton and Molnár, Vince and Micskei, Zoltán Imre},
	doi = {10.1007/s11219-023-09617-5},
	journal-iso = {SOFTWARE QUAL J},
	journal = {SOFTWARE QUALITY JOURNAL},
	volume = {31},
	unique-id = {33677595},
	issn = {0963-9314},
	abstract = {Modelling languages play a central role in developing complex, critical systems. A precise, comprehensible, and high-quality modelling language specification is essential to all stakeholders using, implementing, or extending the language. Many good practices can be found that improve the understandability or consistency of the languages’ semantics. However, designing a modelling language intended for a large audience is still challenging. In this paper, we investigate the challenges and typical issues with assessing the specifications of behavioural modelling language semantics. Our key insight is that the various stakeholder’s understandings of the language’s semantics are often misaligned, and the semantics defined in various artefacts (simulators, test suites) are inconsistent. Therefore assessment of semantics should focus on identifying and resolving these inconsistencies. To illustrate these challenges and techniques, we assessed parts of a state-of-the-art specification for a general-purpose modelling language, the Precise Semantics of UML State Machines (PSSM). We reviewed the text of the specification, analysed and executed PSSM’s conformance test suite, and categorised our experiences according to questions generally relevant to modelling languages. Finally, we made recommendations for improving the development of future modelling languages by representing the semantic domain and traces more explicitly, applying diverse test design techniques to obtain conformance test suites, and using various tools to support early-phase language design.},
	year = {2023},
	eissn = {1573-1367},
	pages = {575-617},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X; Molnár, Vince/0000-0002-8204-7595; Micskei, Zoltán Imre/0000-0003-1846-261X}
}

@article{MTMT:32538562,
	title = {A cross-technology benchmark for incremental graph queries},
	url = {https://m2.mtmt.hu/api/publication/32538562},
	author = {Hinkel, Georg and Garcia-Dominguez, Antonio and Schöne, René and Boronat, Artur and Tisi, Massimo and Le Calvar, Théo and Jouault, Frederic and Marton, József and Nyíri, Tamás and Antal, János Benjamin and Elekes, Márton and Szárnyas, Gábor},
	doi = {10.1007/s10270-021-00927-5},
	journal-iso = {SOFTW SYST MODEL},
	journal = {SOFTWARE AND SYSTEMS MODELING},
	volume = {21},
	unique-id = {32538562},
	issn = {1619-1366},
	abstract = {To cope with the increased complexity of systems, models are used to capture what is considered the essence of a system. Such models are typically represented as a graph, which is queried to gain insight into the modelled system. Often, the results of these queries need to be adjusted according to updated requirements and are therefore a subject of maintenance activities. It is thus necessary to support writing model queries with adequate languages. However, in order to stay meaningful, the analysis results need to be refreshed as soon as the underlying models change. Therefore, a good execution speed is mandatory in order to cope with frequent model changes. In this paper, we propose a benchmark to assess model query technologies in the presence of model change sequences in the domain of social media. We present solutions to this benchmark in a variety of 11 different tools and compare them with respect to explicitness of incrementalization, asymptotic complexity and performance.},
	year = {2022},
	eissn = {1619-1374},
	pages = {755-804},
	orcid-numbers = {Marton, József/0000-0003-4752-4234; Elekes, Márton/0000-0002-3558-147X}
}

@inproceedings{MTMT:32616888,
	title = {Towards Testing the UML PSSM Test Suite},
	url = {https://m2.mtmt.hu/api/publication/32616888},
	author = {Elekes, Márton and Micskei, Zoltán Imre},
	booktitle = {2021 10th Latin-American Symposium on Dependable Computing (LADC)},
	doi = {10.1109/LADC53747.2021.9672570},
	unique-id = {32616888},
	year = {2021},
	pages = {1-4},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X; Micskei, Zoltán Imre/0000-0003-1846-261X}
}

@inproceedings{MTMT:31861479,
	title = {A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS},
	url = {https://m2.mtmt.hu/api/publication/31861479},
	author = {Elekes, Márton and Nagy, Attila and Sándor, Dávid and Antal, János Benjamin and Davis, Timothy A. and Szárnyas, Gábor},
	booktitle = {2020 IEEE High Performance Extreme Computing Conference (HPEC)},
	doi = {10.1109/HPEC43674.2020.9286186},
	unique-id = {31861479},
	year = {2020},
	pages = {1-7},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X}
}

@inproceedings{MTMT:31340549,
	title = {Incremental view maintenance in graph databases: A case study in Neo4j},
	url = {https://m2.mtmt.hu/api/publication/31340549},
	author = {Elekes, Márton and Szárnyas, Gábor},
	booktitle = {Proceedings of the 27th PhD Mini-Symposium},
	unique-id = {31340549},
	abstract = {With the increasing amount of densely connected data sets, graph analysis has become an integral part of data processing pipelines. Therefore, the last decade saw the emergence of numerous dedicated graph analytical systems along with specialized graph database management systems. Traditionally, graph analytical tools targeted global fixed-point computations, while graph databases focused on simpler transactional read operations such as retrieving the neighbours of a node. However, recent applications of graph processing (such as financial fraud detection and serving personalized recommendations) often necessitate a mix of the two workload profiles. Following this trend, the 2018 Transformation Tool Contest (an annual competition for graph transformation tools) presented a case study that requires participants to compute complex graph queries defined on a continuously changing social network graph. The solutions are assessed based on their scalability and query reevaluation time, therefore, solutions are encouraged to incrementalize their implementations. This paper demonstrates a solution in the popular Neo4j graph database using several incrementalization techniques and compares them against the reference implementation of the case study.},
	year = {2020},
	pages = {33-36},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X}
}

@inproceedings{MTMT:31340716,
	title = {An incremental GraphBLAS solution for the 2018 TTC Social Media case study},
	url = {https://m2.mtmt.hu/api/publication/31340716},
	author = {Elekes, Márton and Szárnyas, Gábor},
	booktitle = {2020 IEEE 34th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2020},
	doi = {10.1109/IPDPSW50202.2020.00045},
	unique-id = {31340716},
	abstract = {Graphs are increasingly important for modelling and analysing connected data sets. Traditionally, graph analytical tools targeted global fixed-point computations, while graph databases focused on simpler transactional read operations such as retrieving the neighbours of a node. However, recent applications of graph processing (such as financial fraud detection and serving personalized recommendations) often necessitate a mix of the two workload profiles. A potential approach to tackle these complex workloads is to formulate graph algorithms in the language of linear algebra. To this end, the recent GraphBLAS standard defines a linear algebraic graph computational model and an API for implementing such algorithms. To investigate its usability and efficiency, we have implemented a GraphBLAS solution for the "Social Media" case study of the 2018 Transformation Tool Contest. This paper presents our solution along with an incrementalized variant to improve its runtime for repeated evaluations. Preliminary results show that the GraphBLAS-based solution is competitive but implementing it requires significant development efforts.},
	year = {2020},
	pages = {203-206},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X}
}

@inproceedings{MTMT:3206283,
	title = {Towards Model-Based Support for Regression Testing},
	url = {https://m2.mtmt.hu/api/publication/3206283},
	author = {Gujgiczer, Anna and Elekes, Márton and Oszkár, Semeráth and Vörös, András},
	booktitle = {Proceedings of the 24th PhD Mini-Symposium (MINISY@DMIS 2017)},
	unique-id = {3206283},
	year = {2017},
	pages = {26-29},
	orcid-numbers = {Elekes, Márton/0000-0002-3558-147X}
}