Dániel Lukács

Mr. Dániel Lukács

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
21 May 2019 in Acta Cybernetica
Verified
Journal Article
Open access
PDF file
DLDániel Lukács
Dániel Lukács
MTMáté Tejfel
Máté Tejfel
GPGergely Pongrácz
Gergely Pongrácz
The networking dataplane is going through a paradigm shift as softwarization of switches sees an increased pull from the market. Yet, software tooling to support development with these new technologies is still in its infancy.In this work, we introduce a framework for verifying performance requirement conformance of data plane protocols defined in the P4 language . We present a framework that transforms a P4 program in a versatile symbolic formula which can be utilized to answer various performance queries. We represented the system using denotational semantics and it can be easily extended with low-level target-dependent information. We demonstrate the operation of this system on a toy specification.

17 December 2020 in Open Computer Science
Verified
Journal Article
Open access
PDF file
DLDániel Lukács
Dániel Lukács
GPGergely Pongrácz
Gergely Pongrácz
MTMáté Tejfel
Máté Tejfel
The networking industry is currently undergoing a steady trend of softwarization. Yet, network engineers suffer from the lack of software development tools that support programming of new protocols. We are creating a cost analysis tool for the P4 programming language, that automatically verifies whether the developed program meets soft deadline requirements imposed by the network. In this paper, we present an approach to estimate the average execution time of P4 program based on control flow graphs. Our approach takes into consideration that many of the parts of P4 are implementation-defined: required information can be added in through incremental refinement, while missing information is handled by falling back to less precise defaults. We illustrate application of this approach to a P4 protocol in two case studies: we use it to examine the effect of a compiler optimization in the deparse stage, and to show how it enables cost modelling complex lookup table implementations. Finally, we assess future research tasks to be completed before the tool is ready for real-world usage.

6 July 2022 in Electronics
Verified
Journal Article
Open access
PDF file
DLDániel Lukács
Dániel Lukács
GPGergely Pongrácz
Gergely Pongrácz
MTMáté Tejfel
Máté Tejfel
Next-generation networks focus on scale and scope at the price of increasing complexity, leading to difficulties in network design and planning. As a result, anticipating all hardware- and software-related factors of network performance requires time-consuming and expensive benchmarking. This work presents a framework and software tool for automatically inferring the performance of P4 programmable network switches based on the P4 source code and probabilistic models of the execution environment with the hope of eliminating the requirement of the costly set-up of networked hardware and conducting benchmarks. We designed the framework using a top-down approach. First, we transform high-level P4 programs into a representation that can be refined incrementally by adding probabilistic environment models of increasing levels of complexity in order to improve the estimation precision. Then, we use the PRISM probabilistic model checker to perform the heavy weight calculations involved in static performance prediction. We present a formalization of the performance estimation problem, detail our solution, and illustrate its usage and validation through a case study conducted using a small P4 program and the P4C-BM reference switch. We show that the framework is already capable of performing estimation, and it can be extended with more concrete information to yield better estimates.

21 August 2026
Verified
Conference Paper
Open access
DLDániel Lukács
Dániel Lukács
PBPéter Bereczky
Péter Bereczky
DHDániel Horpácsi
Dániel Horpácsi
This paper formalises Erlang references as an extension to an existing formal semantics of Core Erlang mechanised in Rocq. We define reference generation based on the evaluation state, rather than relying on a registry of previously generated references. The main advantage of this approach is that it requires considerably less modifications to the existing semantics than the registry-based approach. We argue that references generated this way are sufficiently unique because freshly generated references are guaranteed to be distinct from all references available in the evaluation state at the point of generation. Finally, we present two case studies evaluating our semantics, discuss the advantages and pitfalls of our semantics, and highlight potential enhancements and alternative approaches to formalise references. We also mechanise our results in Rocq.

4 March 2024 in Acta Cybernetica
Verified
Journal Article
Open access
PDF file
DLDániel Lukács
Dániel Lukács
MTMáté Tejfel
Máté Tejfel
Our overall research aim is to statically derive execution cost and other metrics from program code written in the P4 programming language. For this purpose, we extract a detailed control flow graph (CFG) from the code, that can be turned into a full, formal model of execution, to extract properties -- such as execution cost -- from the model. While CFG extraction and analysis is well researched area, details are dependent on code representation and therefore application of textbook algorithms (often defined over unstructured code listings) to real programming languages is often non-trivial. Our aim is to present an algorithm for CFG extraction over P4 abstract syntax trees (AST). During the extraction we create direct links between nodes of the CFG and the P4 AST: this way we can access all information in the P4 AST during CFG traversal. We are utilizing Gremlin, a graph query language to take advantage of graph databases, but also for compactness and to formally prove algorithm correctness.

16 March 2025 in Acta Cybernetica
Verified
Journal Article
Open access
PDF file
MTMáté Tejfel
Máté Tejfel
DLDániel Lukács
Dániel Lukács
PHPéter Hegyi
Péter Hegyi
P4 is a domain-specific programming language for programmable switches running inside next-generation computer networks. The language is designed to use the software defined networking (SDN) paradigm which separates the data plane and the control plane layers of the program. The paper introduces tool-supported refactoring steps for P4. The challenge in this task is that P4 has special domain-specific constructs that cannot be found in other languages and as such there is no existing methodology yet for refactoring these constructs. The proposed steps are implemented using P4Query, an analyzer framework dedicated to P4.