István Bozó

István Bozó

Auto-generated profile, based on publicly available information

István Bozó

Eötvös Loránd University

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

3 September 2014
Verified
Conference Paper
Open access
IBIstván Bozó
István Bozó
VFViktoria Fordós
Viktoria Fordós
ZHZoltán Horvath
Zoltán Horvath
MTMelinda Tóth
Melinda Tóth
DHDániel Horpácsi
Dániel Horpácsi
KHKevin Hammond
Kevin Hammond

1 February 2018 in Future Generation Computer Systems
Verified
Journal Article
Closed access
TKTamás Kozsik
Tamás Kozsik
MTMelinda Tóth
Melinda Tóth
IBIstván Bozó
István Bozó

1 January 2010
Verified
Book Chapter
Closed access
PDF file
MTMelinda Tóth
Melinda Tóth
IBIstván Bozó
István Bozó
ZHZoltán Horváth
Zoltán Horváth
LLLászló Lövei
László Lövei
MTMáté Tejfel
Máté Tejfel
TKTamás Kozsik
Tamás Kozsik

1 January 2014 in Procedia Computer Science
Verified
Journal Article
Open access
MTMelinda Tóth
Melinda Tóth
IBIstván Bozó
István Bozó
Static software analyser tools can help in program comprehension by detecting relations among program parts. Detecting relations among the concurrent program parts, e.g. relations between processes, is not straightforward. In case of dynamic languages only a (good) approximation of the real dependencies can be calculated. In this paper we present algorithms to build a process relation graph for Erlang programs. The graph contains direct relation through message passing and hidden relations represented by the ETS (Erlang Term Storage) tables

23 August 2020
Verified
Conference Paper
Open access
BPBoldizsár Poór
Boldizsár Poór
MTMelinda Tóth
Melinda Tóth
IBIstván Bozó
István Bozó
The programming style has an impact on the readability and comprehensibility of the source code, and it may also affect run-time performance. This statement also holds for functional languages when the functional style is mixed with imperative design. In this paper, we present a couple of methods that can refactor imperatively styled Erlang source-code into a more functionally styled one. This can be done by transforming unnecessary calls to length, hd and tl into pattern matching or by lifting particular nested expressions. The results of our investigations indicate that these refactorings can not only shorten the length of the source code but also affect the complexity/readability. In this paper, we present some refactorings; moreover, real-life examples and data for its validation.