TY - CHAP AU - Bilicki, Vilmos AU - Elekes, Márton AU - Marussy, Kristóf AU - Vörös, András TI - Towards evaluating trustworthy modeling assistants T2 - Second Workshop on Large Language Models For Generative Software Engineering (LLM4SE 2026) PB - CEUR Workshop Proceedings CY - Amsterdam T3 - CEUR Workshop Proceedings, ISSN 1613-0073 PY - 2026 SP - 1 EP - 11 PG - 11 UR - https://m2.mtmt.hu/api/publication/37312907 ID - 37312907 LA - English DB - MTMT ER - TY - THES AU - Elekes, Márton TI - Assessing the quality of graph-based models and modelling languages PB - Budapesti Műszaki és Gazdaságtudományi Egyetem PY - 2025 SP - 132 UR - https://m2.mtmt.hu/api/publication/37351028 ID - 37351028 LA - English DB - MTMT ER - TY - JOUR AU - Elekes, Márton AU - Molnár, Vince AU - Micskei, Zoltán Imre TI - To Do or Not to Do: Semantics and Patterns for Do Activities in UML PSSM State Machines JF - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING J2 - IEEE T SOFTWARE ENG VL - 50 PY - 2024 IS - 8 SP - 2124 EP - 2141 PG - 18 SN - 0098-5589 DO - 10.1109/TSE.2024.3422845 UR - https://m2.mtmt.hu/api/publication/35133148 ID - 35133148 N1 - Export Date: 15 July 2024 CODEN: IESED Funding text 1: This work was supported by project no. 2019-1.3.1-KK-2019-00004 under the 2019-1.3.1-KK funding scheme, project no. 2022-1.2.4-EUREKA-2023-00013 under the 2022-1.2.4-EUREKA funding scheme, and the \\u00DANKP-23-3-II-BME-362 New National Excellence Program of the Ministry for Culture and Innovation from the source of the National Research, Development and Innovation Fund of Hungary. AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Elekes, Márton AU - Molnár, Vince AU - Micskei, Zoltán Imre TI - Assessing the specification of modelling language semantics: a study on UML PSSM JF - SOFTWARE QUALITY JOURNAL J2 - SOFTWARE QUAL J VL - 31 PY - 2023 IS - 2 SP - 575 EP - 617 PG - 43 SN - 0963-9314 DO - 10.1007/s11219-023-09617-5 UR - https://m2.mtmt.hu/api/publication/33677595 ID - 33677595 N1 - Correspondence Address: Micskei, Z.; Department of Measurement and Information Systems, Müegyetem rkp. 3., Hungary; email: micskeiz@mit.bme.hu AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Hinkel, Georg AU - Garcia-Dominguez, Antonio AU - Schöne, René AU - Boronat, Artur AU - Tisi, Massimo AU - Le Calvar, Théo AU - Jouault, Frederic AU - Marton, József AU - Nyíri, Tamás AU - Antal, János Benjamin AU - Elekes, Márton AU - Szárnyas, Gábor TI - A cross-technology benchmark for incremental graph queries JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 21 PY - 2022 IS - 2 SP - 755 EP - 804 PG - 50 SN - 1619-1366 DO - 10.1007/s10270-021-00927-5 UR - https://m2.mtmt.hu/api/publication/32538562 ID - 32538562 N1 - Wiesbaden, Germany Aston University, Birmingham, United Kingdom Technische Universität Dresden, Software Technology Group, Dresden, Germany School of Informatics, University of Leicester, Leicester, United Kingdom IMT Atlantique, LS2N (UMR CNRS 6004), Nantes, France DIRO, Université de Montréal, Montreal, Canada ERIS, ESEO-TECH, Angers, France Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary CWI, Amsterdam, Netherlands Export Date: 29 April 2022 Correspondence Address: Elekes, M.; Department of Measurement and Information Systems, Hungary; email: elekes@mit.bme.hu AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Elekes, Márton AU - Micskei, Zoltán Imre ED - Andrey, Brito ED - Fernando, Pedone TI - Towards Testing the UML PSSM Test Suite T2 - 2021 10th Latin-American Symposium on Dependable Computing (LADC) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - Piscataway (NJ) SN - 9781665478311 PY - 2021 SP - 1 EP - 4 PG - 4 DO - 10.1109/LADC53747.2021.9672570 UR - https://m2.mtmt.hu/api/publication/32616888 ID - 32616888 N1 - Export Date: 2 May 2022 LA - English DB - MTMT ER - TY - CHAP AU - Elekes, Márton AU - Nagy, Attila AU - Sándor, Dávid AU - Antal, János Benjamin AU - Davis, Timothy A. AU - Szárnyas, Gábor ED - IEEE, null TI - A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS T2 - 2020 IEEE High Performance Extreme Computing Conference (HPEC) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - Piscataway (NJ) SN - 9781728192192 PY - 2020 SP - 1 EP - 7 PG - 7 DO - 10.1109/HPEC43674.2020.9286186 UR - https://m2.mtmt.hu/api/publication/31861479 ID - 31861479 LA - English DB - MTMT ER - TY - CHAP AU - Elekes, Márton AU - Szárnyas, Gábor ED - Renczes, Balázs TI - Incremental view maintenance in graph databases: A case study in Neo4j T2 - Proceedings of the 27th PhD Mini-Symposium PB - Budapest University of Technology and Economics, Department of Measurement and Information Systems CY - Budapest SN - 9789634218074 PY - 2020 SP - 33 EP - 36 PG - 4 UR - https://m2.mtmt.hu/api/publication/31340549 ID - 31340549 AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Elekes, Márton AU - Szárnyas, Gábor ED - Anu, G. Bourgeois ED - Ramachandran, Vaidyanathan TI - An incremental GraphBLAS solution for the 2018 TTC Social Media case study T2 - 2020 IEEE 34th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2020 PB - Institute of Electrical and Electronics Engineers (IEEE) CY - Piscataway (NJ) SN - 9781728174457 PY - 2020 SP - 203 EP - 206 PG - 4 DO - 10.1109/IPDPSW50202.2020.00045 UR - https://m2.mtmt.hu/api/publication/31340716 ID - 31340716 N1 - Cited By :1 Export Date: 16 June 2022 AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Gujgiczer, Anna AU - Elekes, Márton AU - Oszkár, Semeráth AU - Vörös, András ED - Pataki, Béla TI - Towards Model-Based Support for Regression Testing T2 - Proceedings of the 24th PhD Mini-Symposium (MINISY@DMIS 2017) PB - BME Méréstechnika és Információs Rendszerek Tanszék CY - Budapest SN - 9789633132432 PY - 2017 SP - 26 EP - 29 PG - 4 UR - https://m2.mtmt.hu/api/publication/3206283 ID - 3206283 LA - English DB - MTMT ER -