TY - JOUR AU - Poór, Artúr AU - Kozsik, Tamás AU - Tóth, Melinda AU - Bozó, István TI - Compiler Front End Fusion. Undo Desugaring in Language Processing Tools A. Poor TS - Undo Desugaring in Language Processing Tools A. Poor JF - STUDIA UNIVERSITATIS BABES-BOLYAI SERIES INFORMATICA J2 - STUD UNIV BABES-BOLYAI SER INFO VL - 63 PY - 2018 IS - 2 SP - 5 EP - 20 PG - 16 SN - 1224-869X DO - 10.24193/subbi.2018.2.01 UR - https://m2.mtmt.hu/api/publication/3389262 ID - 3389262 N1 - 3in(EFOP-3.6.2-16-2017-00013) Támogató: EFOP Innovatív Informatikai és Infokommunikációs Megoldásokat Megalapozó Tematikus Kutatási Együttműködések LA - English DB - MTMT ER - TY - JOUR AU - Mátyás, Komáromi AU - Bozó, István AU - Tóth, Melinda TI - AN EFFICIENT GRAPH VISUALISATION FRAMEWORK FOR REFACTORERL JF - STUDIA UNIVERSITATIS BABES-BOLYAI SERIES INFORMATICA J2 - STUD UNIV BABES-BOLYAI SER INFO VL - 63 PY - 2018 IS - 2 SP - 21 EP - 36 PG - 15 SN - 1224-869X DO - 10.24193/subbi.2018.2.02 UR - https://m2.mtmt.hu/api/publication/3389340 ID - 3389340 LA - English DB - MTMT ER - TY - CHAP AU - Bozó, István AU - Tóth, Melinda ED - Theodore, Simos ED - Charalambos, Tsitouras TI - Analysing and visualising Erlang behaviours T2 - International Conference of Numerical Analysis and Applied Mathematics PB - AIP Publishing CY - Melville (NY) SN - 9780735413924 T3 - AIP Conference Proceedings, ISSN 0094-243X ; 1738. PY - 2016 SP - 240004 UR - https://m2.mtmt.hu/api/publication/26124683 ID - 26124683 LA - English DB - MTMT ER - TY - JOUR AU - Bozó, István AU - Bence, János Szabó AU - Tóth, Melinda TI - Analysing the hierarchical structure of Erlang applications JF - CEUR WORKSHOP PROCEEDINGS J2 - CEUR WORKSHOP PROC VL - 2046 PY - 2016 SP - 42 EP - 55 PG - 14 SN - 1613-0073 UR - https://m2.mtmt.hu/api/publication/3317207 ID - 3317207 N1 - A4 LA - English DB - MTMT ER - TY - JOUR AU - Lukács, Dániel AU - Tóth, Melinda AU - Bozó, István TI - Transforming Erlang finite state machines JF - CEUR WORKSHOP PROCEEDINGS J2 - CEUR WORKSHOP PROC VL - 2046 PY - 2016 SP - 197 EP - 218 PG - 22 SN - 1613-0073 UR - https://m2.mtmt.hu/api/publication/3317214 ID - 3317214 LA - English DB - MTMT ER - TY - JOUR AU - Tóth, Melinda AU - Attila, Páter-Részeg AU - Gordana, Rakic TI - Introducing Support for Erlang into SSQSA framework JF - AIP CONFERENCE PROCEEDINGS J2 - AIP CONF PROC VL - 1648 PY - 2015 PG - 4 SN - 0094-243X DO - 10.1063/1.4912565 UR - https://m2.mtmt.hu/api/publication/2906560 ID - 2906560 LA - English DB - MTMT ER - TY - JOUR AU - András, Németh AU - Tóth, Melinda TI - Erlang-Like Dynamic Typing in C++ JF - STUDIA UNIVERSITATIS BABES-BOLYAI SERIES INFORMATICA J2 - STUD UNIV BABES-BOLYAI SER INFO VL - 59 PY - 2014 IS - Special Issue 1 SP - 185 EP - 200 PG - 16 SN - 1224-869X UR - https://m2.mtmt.hu/api/publication/2760340 ID - 2760340 LA - English DB - MTMT ER - TY - CHAP AU - Bozó, István AU - Tóth, Melinda ED - Csörnyei, Zoltán TI - Erlang folyamatok és a köztük lévő kapcsolatok felderítése T2 - Tízéves az ELTE Eötvös József Collegium Informatikai Műhelye PB - ELTE Eötvös József Collegium CY - Budapest SN - 9786155371301 PY - 2014 SP - 79 EP - 92 PG - 14 UR - https://m2.mtmt.hu/api/publication/2760435 ID - 2760435 LA - Hungarian DB - MTMT ER - TY - JOUR AU - Tóth, Melinda AU - Bozó, István TI - Detecting and Visualising Process Relationships in Erlang JF - PROCEDIA COMPUTER SCIENCE J2 - PROC COMPUTER SCI VL - 29 PY - 2014 SP - 1525 EP - 1534 PG - 10 SN - 1877-0509 UR - https://m2.mtmt.hu/api/publication/26124676 ID - 26124676 LA - English DB - MTMT ER - TY - JOUR AU - Horváth, Zoltán AU - Bozó, István AU - Tóth, Melinda TI - Reduction of Regression Tests for Erlang Based on Impact Analysis JF - STUDIA UNIVERSITATIS BABES-BOLYAI SERIES INFORMATICA J2 - STUD UNIV BABES-BOLYAI SER INFO VL - 59 PY - 2014 IS - Special Issue 1 SP - 31 EP - 46 PG - 16 SN - 1224-869X UR - https://m2.mtmt.hu/api/publication/2703474 ID - 2703474 LA - English DB - MTMT ER - TY - JOUR AU - Horpácsi, Dániel AU - Horpácsiné Kőszegi, Judit TI - Static analysis of function calls in Erlang. Refining the static function call graph with dynamic call information by using data-flow analysis TS - Refining the static function call graph with dynamic call information by using data-flow analysis JF - E-INFORMATICA: SOFTWARE ENGINEERING JOURNAL J2 - E-INFO: SOFTWARE ENG J VL - 7 PY - 2013 SP - 65 EP - 76 PG - 12 SN - 1897-7979 DO - 10.5277/e-Inf130107 UR - https://m2.mtmt.hu/api/publication/2193997 ID - 2193997 AB - Functions and their relations can affect numerous properties and metrics of a functional program. To identify and represent the functions and their calling connections, software analysers commonly apply semantic function analysis, which derives the static call graph of the program, based on its source code. Function calls however may be dynamic and complex, making it difficult to statically identify the callee. Dynamic calls are determined just at run-time, static analysis therefore cannot be expected to fully identify every call. Nevertheless, by utilising the results of a properly performed data-flow analysis as well as taking ambiguous references into account, numerous dynamic calls are discoverable and representable. We consider cases where the identifiers of the callee are statically determined, but they flow into the call expression from a different program point, and also, we manage to handle function calls whose identifiers are not fully identifiable at compile-time. By utilising the improved reference analysis, we extend the static call graph with various information about dynamic function calls. We investigate such a function call analysis in the programming language Erlang. LA - English DB - MTMT ER - TY - THES AU - Király, Roland TI - Transformations of Erlang programs based on complexity metrics PY - 2013 UR - https://m2.mtmt.hu/api/publication/26135521 ID - 26135521 LA - English DB - MTMT ER - TY - JOUR AU - Tejfel, Máté AU - Tóth, Melinda AU - Bozó, István AU - Horpácsi, Dániel AU - Horváth, Zoltán TI - Improving quality of software analyser and transformer tools using specification based testing JF - ANNALES UNIVERSITATIS SCIENTIARUM BUDAPESTINENSIS DE ROLANDO EOTVOS NOMINATAE SECTIO COMPUTATORICA J2 - ANN UNIV SCI BP R EÖTVÖS NOM SECT COMPUT VL - 37 PY - 2012 SP - 355 EP - 368 PG - 14 SN - 0138-9491 UR - https://m2.mtmt.hu/api/publication/1983933 ID - 1983933 LA - English DB - MTMT ER - TY - CHAP AU - Bozó, István AU - Tóth, Melinda ED - Simos, BE TI - Selecting Erlang test cases using impact analysis T2 - International Conference on Numerical Analysis and Applied Mathematics PB - American Institute of Physics (AIP) CY - Melville (NY) SN - 0735409595 T3 - AIP Conference Proceedings, ISSN 0094-243X ; 1389. PY - 2011 SP - 802 EP - 805 PG - 4 DO - 10.1063/1.3636854 UR - https://m2.mtmt.hu/api/publication/3083583 ID - 3083583 N1 - A4 European Society of Computational Methods; in Sciences and Engineering (ESCMSE); The R. M. Santilli Foundation AB - Refactoring is a commonly used technology in the software development and maintenance process. However refactorings preserve the original behaviour of the system, developers want to be convinced about that, thus they retest the software after some modifications. Software testing is said to be the most expensive part of the lifecycle of software systems. Therefore our research focuses on selecting test cases affected by refactorings and have to be retested after the transformation. We describe the used mechanism in case of a dynamically typed functional programming language, Erlang. © 2011 American Institute of Physics. LA - English DB - MTMT ER - TY - JOUR AU - Bozó, István AU - Tóth, Melinda AU - Tejfel, Máté AU - Horpácsi, Dániel AU - Kitlei, Róbert AU - Horpácsiné Kőszegi, Judit AU - Horváth, Zoltán TI - Using impact analysis based knowledge for validating refactoring steps JF - STUDIA UNIVERSITATIS BABES-BOLYAI SERIES INFORMATICA J2 - STUD UNIV BABES-BOLYAI SER INFO VL - 56 PY - 2011 IS - 3 SP - 57 EP - 64 PG - 8 SN - 1224-869X UR - https://m2.mtmt.hu/api/publication/1983924 ID - 1983924 N1 - idéző Cím: USING IMPACT ANALYSIS BASED KNOWLEDGE FOR VALIDATING REFACTORING STEPS idéző Folyóirat/Könyv cím/Szabadalmi szám: UNIVERSITATIS BABEŞ-BOLYAI INFORMATICA idéző Megjelenés éve: 2011 idéző Sorozat cím: UNIVERSITATIS BABEŞ-BOLYAI INFORMATICA LA - English DB - MTMT ER - TY - CHAP AU - Karácsonyi, Mátyás AU - Tóth, Melinda ED - Novitzká, Valerie ED - Hudák, Štefan TI - Analysing Erlang BEAM files T2 - Proceedings of the Eleventh International Conference on Informatics PB - Technical University of Kosice CY - Kosice SN - 9788089284948 PB - Technical University of Kosice PY - 2011 SP - 90 EP - 95 PG - 6 UR - https://m2.mtmt.hu/api/publication/26124697 ID - 26124697 LA - English DB - MTMT ER - TY - JOUR AU - Szűgyi, Zalán AU - Forgács, István AU - Porkoláb, Zoltán TI - 4D Ariadne the Static Debugger of Java Programs JF - PERIODICA POLYTECHNICA-ELECTRICAL ENGINEERING J2 - PERIOD POLYTECH ELECTR ENG VL - 55 PY - 2011 IS - 3-4 SP - 127 EP - 132 PG - 6 SN - 0324-6000 DO - 10.3311/pp.ee.2011-3-4.05 UR - https://m2.mtmt.hu/api/publication/2471984 ID - 2471984 AB - Development environments support the programmer in numerous ways from syntax highlighting to different refactoring and code generating methods. However, there are cases where these tools are limited or not usable, such as getting familiar with large and complex source codes written by a third person; finding the complexities of huge projects or finding semantic errors. In this paper we present our static analyzer tool, called 4D Ariadne, which concentrates on these problems. 4D Ariadne is a static debugger of Object Oriented applications written in Java programming language. It calculates data dependencies of objects being able to compute them both forward and backward. As 4D Ariadne provides only the direct influences to the user, it can be considered as an alternative of traditional debuggers, without executing the code. 4D Ariadne also provides dynamic call graphs representing polymorphic properties of objects. LA - English DB - MTMT ER - TY - JOUR AU - Tóth, Melinda AU - Bozó, István TI - Building dependency graph for slicing erlang programs JF - PERIODICA POLYTECHNICA-ELECTRICAL ENGINEERING J2 - PERIOD POLYTECH ELECTR ENG VL - 55 PY - 2011 IS - 3-4 SP - 133 EP - 138 PG - 6 SN - 0324-6000 DO - 10.3311/pp.ee.2011-3-4.06 UR - https://m2.mtmt.hu/api/publication/3083582 ID - 3083582 AB - Program slicing is a well-known technique that utilizes dependency graphs and static program analysis. Our goal is to perform impact analysis of Erlang programs based on the resulted program slices, that is we want to measure the impact of any change made on the source code: especially we want to select a subset of test cases which must be rerun after the modification. However impact analyzer tools exist for object oriented languages, the used dependency graphs heavily depend on the syntax and semantics of the used programming language, thus we introduce dependency graphs for a dynamically typed functional programming language, Erlang. © Periodica Polytechnica 2011. LA - English DB - MTMT ER - TY - CONF AU - Tóth, Melinda AU - Bozó, István AU - Horváth, Zoltán AU - Erdődi, Attila ED - Vivek, Sarkar ED - Vasco, T Vasconcelos TI - Static analysis and refactoring towards Erlang multicore programming T2 - Pre-Proceedings of the Fourth Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, PLACES'11, PY - 2011 SP - 43 EP - 50 PG - 8 UR - https://m2.mtmt.hu/api/publication/2760423 ID - 2760423 LA - English DB - MTMT ER - TY - JOUR AU - Tóth, Melinda AU - Bozó, István AU - Koszegi, Judit AU - Horváth, Zoltán TI - Static Analysis Based Support for Program Comprehension in Erlang JF - ACTA ELECTROTECHNICA ET INFORMATICA J2 - ACTA ELECTROTECH INF VL - 11 PY - 2011 IS - 3 SP - 3 EP - 10 PG - 8 SN - 1335-8243 UR - https://m2.mtmt.hu/api/publication/26124641 ID - 26124641 LA - English DB - MTMT ER - TY - CHAP AU - Hajós, Lilla AU - Tóth, Melinda AU - Lövei, László ED - Egri-Nagy, Attila ED - Kovács, Emőd ED - Kovásznai, Gergely ED - Kusper, Gábor ED - Tómács, Tibor TI - Erlang Semantic Query Language T2 - Proceedings of the 8th International Conference on Applied Informatics, ICAI 2010 PB - Eszterházy Károly College CY - Eger SN - 9789639894723 PY - 2010 SP - 165 EP - 172 PG - 8 UR - https://m2.mtmt.hu/api/publication/2760514 ID - 2760514 LA - English DB - MTMT ER - TY - CHAP AU - Kitlei, Róbert AU - Bozó, István AU - Kozsik, Tamás AU - Tejfel, Máté AU - Tóth, Melinda ED - Scott, Lystig Fritchie ED - Konstantinos, F Sagonas TI - Analysis of preprocessor constructs in Erlang T2 - Proceedings of the 9th ACM SIGPLAN workshop on Erlang PB - ACM Press CY - New York, New York SN - 9781450302531 PY - 2010 SP - 45 EP - 56 PG - 11 DO - 10.1145/1863509.1863517 UR - https://m2.mtmt.hu/api/publication/1949027 ID - 1949027 AB - Program analysis and transformation tools work on source code, which - as in the case of Erlang - may contain macros and other preprocessor directives. Such preprocessor constructs have to be treated in an utterly different way than lexical and syntactical constructs. This paper presents an approach to treat preprocessor constructs in a non-invasive way that is reasonably efficient and supports code transformations and analyses in an Erlang specific framework. Copyright © 2010 ACM. LA - English DB - MTMT ER - TY - JOUR AU - Tóth, Melinda AU - Bozó, István AU - Horváth, Zoltán AU - Lövei, László AU - Tejfel, Máté AU - Kozsik, Tamás TI - Impact analysis of Erlang programs using behaviour dependency graphs JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LNCS VL - 6299 PY - 2010 SP - 372 EP - 390 PG - 19 SN - 0302-9743 DO - 10.1007/978-3-642-17685-2_11 UR - https://m2.mtmt.hu/api/publication/2395306 ID - 2395306 N1 - T3 3rd Central European Functional Programming School, CEFP 2009 Y2 25 May 2009 through 30 May 2009 CY Komarno AB - During the lifetime of a software product certain changes could be performed on its source code. After those changes a regression test should be performed, which is the most expensive part of the software development cycle. This paper focuses on programs written in a dynamic functional programming language Erlang, and discusses a mechanism that could select those test cases, which are affected by a change, i.e. altering the program on some point may have impact on the result/behaviour of those test cases. In the result of that analysis it is possible to reduce the number of necessary test cases, and after modifying the source code, just a subset of the test cases should be retested. The discussed approach introduces a behaviour dependency graph for Erlang programs to represent the dependencies in the source code. The impact of a change can be calculated by traversing the graph. © 2010 Springer-Verlag. LA - English DB - MTMT ER -