Dániel Horpácsi

Dr. Dániel Horpácsi

Department of Programming Languages and Compilers, Eötvös Loránd University, Budapest, Hungary

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
22 August 2016
Verified
Conference Paper
Open access
PDF file
SLSándor Laki
Sándor Laki
DHDániel Horpácsi
Dániel Horpácsi
PVPéter Vörös
Péter Vörös
RKRóbert Kitlei
Róbert Kitlei
DLDániel Leskó
Dániel Leskó
MTMáté Tejfel
Máté Tejfel
P4 is a high level language for programming network switches that allows for great flexibility in the description of packet structure and processing, independent of the specifics of the underlying hardware. In this demo, we present our prototype P4 compiler in which the hardware independent and hardware specific functionalities are separated. We have identified the requisites of the latter, which form the interface of our target specific Hardware Abstraction Library (HAL); the compiler turns P4 code into a target independent core program that is linked to this library and invokes its operations. The two stage separation improves portability: to support a new architecture, only the hardware dependent library has to be implemented. In the demo, we demonstrate the flexibility of our compiler with a HAL for Intel DPDK, and show the packet processing and forwarding performance of compiled switches in different scenarios.

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

30 September 2010
Verified
Conference Paper
Open access
PDF file
DDDániel Drienyovszky
Dániel Drienyovszky
DHDániel Horpácsi
Dániel Horpácsi
STSimon Thompson
Simon Thompson
Refactoring is the transformation of program source code in a way that preserves the behaviour of the program. Many tools exist for automating a number of refactoring steps, but these tools are often poorly tested. We present an automated testing framework based on QuickCheck for testing refactoring tools written for the Erlang programming language

27 September 2008
Verified
Conference Paper
Open access
PDF file
LLLászló Lövei
László Lövei
CHCsaba Hoch
Csaba Hoch
HKHanna Köllö
Hanna Köllö
TNTamás Nagy
Tamás Nagy
AVAnikó Nagyné Víg
Anikó Nagyné Víg
RKRoland Király
Roland Király
This paper focuses on restructuring software written in Erlang. In large software projects, it is a common problem that internal structural complexity can grow to an extent where maintenance becomes impossible. This situation can be avoided by careful design, building loosely coupled components with strictly defined interfaces. However, when these design decisions are not made in the right time, it becomes necessary to split an already working software into such components, without breaking its functionality. There is strong industrial demand for such transformations in refactoring legacy code. A refactoring tool is very useful in the execution of such a restructuring. This paper shows that the semantical analysis required for refactoring is also useful for making suggestions on clustering. Existing analysis results are used to cover the whole process of module restructuring, starting with planning the new structure, and finishing by making the necessary source code transformations.

6 July 2016 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
DHDániel Horpácsi
Dániel Horpácsi
JKJudit Kőszegi
Judit Kőszegi
STSimon Thompson
Simon Thompson
Tool-assisted refactoring transformations must be trustworthy if programmers are to be confident in applying them on arbitrarily extensive and complex code in order to improve style or efficiency. We propose a simple, high-level but rigorous, notation for defining refactoring transformations in Erlang, and show that this notation provides an extensible, verifiable and executable specification language for refactoring. To demonstrate the applicability of our approach, we show how to define and verify a number of example refactorings in the system.Comment: In Proceedings VPT 2016, arXiv:1607.0183

1 January 2023 in Infocommunications journal
Verified
Journal Article
Closed access
BSBalázs Szalontai
Balázs Szalontai
PBPéter Bereczky
Péter Bereczky
DHDániel Horpácsi
Dániel Horpácsi