Ábel Hegedüs

Ábel Hegedüs

Auto-generated profile, based on publicly available information

Ábel Hegedüs

Budapest University of Technology and Economics

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
1 February 2015 in Science of Computer Programming
Verified
Journal Article
Closed access
ZUZoltán Ujhelyi
Zoltán Ujhelyi
GBGábor Bergmann
Gábor Bergmann
ÁHÁbel Hegedüs
Ábel Hegedüs
ÁHÁkos Horváth
Ákos Horváth
BIBenedek Izsó
Benedek Izsó
DVDániel Varró
Dániel Varró

15 September 2014
Verified
Conference Paper
Open access
HAHani Abdeen
Hani Abdeen
DVDániel Varró
Dániel Varró
HSHouari Sahraoui
Houari Sahraoui
ANAndrás Szabolcs Nagy
András Szabolcs Nagy
CDCsaba Debreceni
Csaba Debreceni
ÁHÁkos Horváth
Ákos Horváth
Design space exploration (DSE) aims to find optimal design candidates of a domain with respect to different objectives where design candidates are constrained by complex structural and numerical restrictions. Rule-based DSE aims to find such candidates that are reachable from an initial model by applying a sequence of exploration rules. Solving a rule-based DSE problem is a difficult challenge due to the inherently dynamic nature of the problem. In the current paper, we propose to integrate multi-objective optimization techniques by using Non-dominated Sorting Genetic Algorithms (NSGA) to drive rule-based design space exploration. For this purpose, finite populations of the most promising design candidates are maintained wrt. different optimization criteria. In our context, individuals of a generation are defined as a sequence of rule applications leading from an initial model to a candidate model. Populations evolve by mutation and crossover operations which manipulate (change, extend or combine) rule execution sequences to yield new individuals. Our multi-objective optimization approach for rule-based DSE is domain independent and it is automated by tooling built on the Eclipse framework. The main added value is to seamlessly lift multi-objective optimization techniques to the exploration process preserving both domain independence and a high-level of abstraction. Design candidates will still be represented as models and the evolution of these models as rule execution sequences. Constraints are captured by model queries while objectives can be derived both from models or rule applications.

1 June 2014 in Science of Computer Programming
Verified
Journal Article
Closed access
EJEdgar Jakumeit
Edgar Jakumeit
SBSebastian Buchwald
Sebastian Buchwald
DWDennis Wagelaar
Dennis Wagelaar
LDLi Dan
Li Dan
ÁHÁbel Hegedüs
Ábel Hegedüs
SMSteffen Mazanek
Steffen Mazanek

20 August 2014 in Automated Software Engineering
Verified
Journal Article
Closed access
PDF file
ÁHÁbel Hegedüs
Ábel Hegedüs
ÁHÁkos Horváth
Ákos Horváth
DVDániel Varró
Dániel Varró

1 September 2011
Verified
Conference Paper
Closed access
ÁHÁbel Hegedüs
Ábel Hegedüs
ÁHÁkos Horváth
Ákos Horváth
IRIstván Ráth
István Ráth
MBMoisés Castelo Branco
Moisés Castelo Branco
DVDániel Varró
Dániel Varró
Domain-specific modeling languages (DSML) proved to be an important asset in creating powerful design tools for domain experts. Although these tools are capable of preserving the syntax-correctness of models even during free-hand editing, they often lack the ability of maintaining model consistency for complex language-specific constraints. Hence, there is a need for a tool-level automatism to assist DSML users in resolving consistency violation problems. In this paper, we describe an approach for the automatic generation of quick fixes for DSMLs, taking a set of domain-specific constraints and model manipulation policies as input. The computation relies on statespace exploration techniques to find sequences of operations that decrease the number of inconsistencies. Our approach is illustrated using a BPMN case study, and it is evaluated by several experiments to show its feasibility and performance.

1 September 2010
Verified
Conference Paper
Closed access
AHAbel Hegedus
Abel Hegedus
GBGabor Bergmann
Gabor Bergmann
IRIstvan Rath
Istvan Rath
DVDaniel Varro
Daniel Varro
Model-driven analysis aims at detecting design flaws early in high-level design models by automatically deriving mathematical models. These analysis models are subsequently investigated by formal verification and validation (V&V) tools, which may retrieve traces violating a certain requirement. Back-annotation aims at mapping back the results of V&V tools to the design model in order to highlight the real source of the fault, to ease making necessary amendments. Here we propose a technique for the back-annotation of simulation traces based on change-driven model transformations. Simulation traces of analysis models will be persisted as a change model with high-level change commands representing macro steps of a trace. This trace is back-annotated to the design model using change-driven transformation rules, which bridge the conceptual differences between macro steps in the analysis and design traces. Our concepts will be demonstrated on the back-annotation problem for analyzing BPEL processes using a Petri net simulator.