Željko Kovačević

Dr. Željko Kovačević

Tehničko veleučilište u Zagrebu, Zagreb, Zagreb, Grad, Croatia
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
18 May 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
ŽKŽeljko Kovačević
Željko Kovačević
Marjan MernikMarjan Mernik
Marjan Mernik
MRMiha Ravber
Miha Ravber
Matej ČrepinšekMatej Črepinšek
Matej Črepinšek
This paper describes a research work on Semantic Inference, which can be regarded as an extension of Grammar Inference. The main task of Grammar Inference is to induce a grammatical structure from a set of positive samples (programs), which can sometimes also be accompanied by a set of negative samples. Successfully applying Grammar Inference can result only in identifying the correct syntax of a language. With the Semantic Inference a further step is realised, namely, towards inducing language semantics. When syntax and semantics can be inferred, a complete compiler/interpreter can be generated solely from samples. In this work Evolutionary Computation was employed to explore and exploit the enormous search space that appears in Semantic Inference. For the purpose of this research work the tool LISA.SI has been developed on the top of the compiler/interpreter generator tool LISA. The first results are encouraging, since we were able to infer the semantics only from samples and their associated meanings for several simple languages, including the Robot language.

1 March 2021 in Applied Soft Computing
Verified
Journal Article
Closed access
MRMiha Ravber
Miha Ravber
ŽKŽeljko Kovačević
Željko Kovačević
Matej ČrepinšekMatej Črepinšek
Matej Črepinšek
Marjan MernikMarjan Mernik
Marjan Mernik


24 March 2022 in Journal of Computer Languages
Verified
Journal Article
Closed access
ŽKŽeljko Kovačević
Željko Kovačević
MRMiha Ravber
Miha Ravber
SLShih-Hsi Liu
Shih-Hsi Liu
Matej ČrepinšekMatej Črepinšek
Matej Črepinšek

31 August 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
TKTomaz Kosar
Tomaz Kosar
ŽKŽeljko Kovačević
Željko Kovačević
Marjan MernikMarjan Mernik
Marjan Mernik
BSBoštjan Slivnik
Boštjan Slivnik
Our previous study showed that automatically generated attribute grammars were harder to comprehend than manually written attribute grammars, mostly due to unexpected solutions. This study is an internally differentiated replication of the previous experiment, but, unlike the previous one, it focused on testing the influence of code bloat on comprehension correctness and efficiency. While the experiment’s context, design, and measurements were kept mostly the same as in the original experiment, more realistic code bloat examples were introduced. The replicated experiment was conducted with undergraduate students from two universities, showing statistically significant differences in comprehension correctness and efficiency between attribute grammars without code bloat and attribute grammars with code bloat, although the participants perceived attribute grammars with code bloat as simple as attribute grammars without code bloat. On the other hand, there was no statistically significant difference in comprehension correctness and efficiency between automatically generated attribute grammars with possible unexpected solutions and attribute grammars with code bloat, although there was a statistically significant difference in participants’ perspective of simplicity between automatically generated attribute grammars with possible unexpected solutions and attribute grammars with code bloat. The participants perceived attribute grammars with code bloat as significantly simpler than automatically generated attribute grammars.

18 September 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
BSBoštjan Slivnik
Boštjan Slivnik
ŽKŽeljko Kovačević
Željko Kovačević
Marjan MernikMarjan Mernik
Marjan Mernik
TKTomaz Kosar
Tomaz Kosar
Applied to the problem of automatic program generation, Genetic Programming often produces code bloat, or unexpected solutions that are, according to common belief, difficult to comprehend. To study the comprehensibility of the code produced by Genetic Programming, attribute grammars obtained by Genetic Programming-based semantic inference were compared to manually written ones. According to the established procedure, the research was carried out as a controlled classroom experiment that involved two groups of students from two universities, and consisted of a background questionnaire, two tests and a feedback questionnaire after each test. The tasks included in the tests required the identification of various properties of attributes and grammars, the identification of the correct attribute grammar from a list of choices, or correcting a semantic rule in an attribute grammar. It was established that solutions automatically generated by Genetic Programming in the field of semantic inference, in this study attribute grammars, are indeed significantly harder to comprehend than manually written ones. This finding holds, regardless of whether comprehension correctness, i.e., how many attribute grammars were correctly comprehended, or comprehension efficiency is considered, i.e., how quickly attribute grammars were correctly comprehended.