Dániel Horpácsi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dániel Horpácsi has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Péter Bereczky
Eötvös Loránd University, Budapest, Hungary
15 shared publications - Simon Thompson
University of Kent, Canterbury, United Kingdom
10 shared publications - Judit Kőszegi
Eötvös Loránd University
5 shared publications - Máté Tejfel
Eötvös Loránd University
3 shared publications Ádám Kurucz
3 shared publications- Arsenii Fomin
Eötvös Loránd University, Budapest, Hungary
2 shared publications
Latest Publications
- Open Access
- 21 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 33-44
A Mechanised Semantics of Erlang’s References
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.
- 21 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 33-44
Open AccessA Mechanised Semantics of Erlang’s References
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.
- Open Access
- 11 July 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 151
Toward Model-theoretic Consistency Verification in a Dependently Typed Encoding of Matching Logic
- 11 July 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 151
Open AccessToward Model-theoretic Consistency Verification in a Dependently Typed Encoding of Matching Logic
- Open Access
- 6 April 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 150
Unification and anti-unification in applicative matching logic
- 6 April 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 150
Open AccessUnification and anti-unification in applicative matching logic
- Open Access
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 26-39
Deriving an Erlang Interpreter from a Mechanised Formal Semantics of Core Erlang
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 26-39
Open AccessDeriving an Erlang Interpreter from a Mechanised Formal Semantics of Core Erlang
- Open Access
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 14-25
Mechanised Proofs of Atom Exhaustion in Erlang
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 14-25
Open AccessMechanised Proofs of Atom Exhaustion in Erlang
- Open Access
- 16 September 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 427, 3-23
On a Dependently Typed Encoding of Matching Logic
Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of matching $\mu$-logic, a sorted, polyadic variant of the logic. Metatheoretic reasoning requires the logic to be expressed within a foundational theory; opting for a dependently typed one enables well-sortedness in the object theory to correspond directly to well-typedness in the host theory. In this paper, we present the first dependently typed definition of matching $\mu$-logic, ensuring well-sortedness via sorted contexts encoded in type indices. As a result, ill-sorted syntax elements are unrepresentable, and the semantics of well-sorted elements are guaranteed to lie within the domain of their associated sort.
- 16 September 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 427, 3-23
Open AccessOn a Dependently Typed Encoding of Matching Logic
Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of matching $\mu$-logic, a sorted, polyadic variant of the logic. Metatheoretic reasoning requires the logic to be expressed within a foundational theory; opting for a dependently typed one enables well-sortedness in the object theory to correspond directly to well-typedness in the host theory. In this paper, we present the first dependently typed definition of matching $\mu$-logic, ensuring well-sortedness via sorted contexts encoded in type indices. As a result, ill-sorted syntax elements are unrepresentable, and the semantics of well-sorted elements are guaranteed to lie within the domain of their associated sort.
- Open Access
- 31 October 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 410, 1-17
Unification in Matching Logic — Revisited
Matching logic is a logical framework for specifying and reasoning about programs using pattern matching semantics. A pattern is made up of a number of structural components and constraints. Structural components are syntactically matched, while constraints need to be satisfied. Having multiple structural patterns poses a practical problem as it requires multiple matching operations. This is easily remedied by unification, for which an algorithm has already been defined and proven correct in a sorted, polyadic variant of matching logic. This paper revisits the subject in the applicative variant of the language while generalising the unification problem and mechanizing a proven-sound solution in Coq.
- 31 October 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 410, 1-17
Open AccessUnification in Matching Logic — Revisited
Matching logic is a logical framework for specifying and reasoning about programs using pattern matching semantics. A pattern is made up of a number of structural components and constraints. Structural components are syntactically matched, while constraints need to be satisfied. Having multiple structural patterns poses a practical problem as it requires multiple matching operations. This is easily remedied by unification, for which an algorithm has already been defined and proven correct in a sorted, polyadic variant of matching logic. This paper revisits the subject in the applicative variant of the language while generalising the unification problem and mechanizing a proven-sound solution in Coq.
- Open Access
Program Equivalence in the Erlang Actor Model
This paper presents the formal semantics of concurrency in Core Erlang, an intermediate language for Erlang, along with a notion of program equivalence (based on barbed bisimulation) that is able to model equivalence between programs that have different communication structures but the same observable behaviour. The novelty in our formalisation is its extent: it includes semantics for messages and exit and link signals, in addition to most of Core Erlang’s sequential features. Furthermore, unlike previous studies, this work formalises message receipt using primitive operations, consistent with the standard as of Erlang/OTP 23. In this novel formalisation, we show some generally applicable program equivalences (such as process identifier renaming and silent evaluation) and present a practical case study featuring the equivalence of sequential and concurrent list processing.
Open AccessProgram Equivalence in the Erlang Actor Model
This paper presents the formal semantics of concurrency in Core Erlang, an intermediate language for Erlang, along with a notion of program equivalence (based on barbed bisimulation) that is able to model equivalence between programs that have different communication structures but the same observable behaviour. The novelty in our formalisation is its extent: it includes semantics for messages and exit and link signals, in addition to most of Core Erlang’s sequential features. Furthermore, unlike previous studies, this work formalises message receipt using primitive operations, consistent with the standard as of Erlang/OTP 23. In this novel formalisation, we show some generally applicable program equivalences (such as process identifier renaming and silent evaluation) and present a practical case study featuring the equivalence of sequential and concurrent list processing.
- Open Access
- 28 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 55-66
Is This Really a Refactoring? Automated Equivalence Checking for Erlang Projects
We present an automated approach to checking whether a change to a repository is a refactoring, that is, it makes no change to the behaviour of the system. This is implemented in the EquivcheckEr tool, which detects the places in which the code has changed, and compares the old and new versions of all functions that are affected by the change, applying the functions to randomly generated inputs. Our tool works for projects written in Erlang, and so needs to deal with effectful as well as pure functions. We aim only to report inequivalence when we have concrete evidence to that effect, avoiding any ``false positive'' counterexamples.
- 28 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 55-66
Open AccessIs This Really a Refactoring? Automated Equivalence Checking for Erlang Projects
We present an automated approach to checking whether a change to a repository is a refactoring, that is, it makes no change to the behaviour of the system. This is implemented in the EquivcheckEr tool, which detects the places in which the code has changed, and compares the old and new versions of all functions that are affected by the change, applying the functions to randomly generated inputs. Our tool works for projects written in Erlang, and so needs to deal with effectful as well as pure functions. We aim only to report inequivalence when we have concrete evidence to that effect, avoiding any ``false positive'' counterexamples.
- Open Access
- 4 March 2024
- Published by University of Szeged in Acta Cybernetica
- Vol. 26 (3) , 373-404
A Formalisation of Core Erlang, a Concurrent Actor Language
In order to reason about the behaviour of programs described in a programming language, a mathematically rigorous definition of that language is needed. In this paper, we present a machine-checked formalisation of concurrent Core Erlang (a subset of Erlang) based on our previous formalisations of its sequential sublanguage. We define a modular, frame stack semantics, show how program evaluation is carried out with it, and prove a number of properties (e.g. determinism, confluence). Finally, we define program equivalence based on bisimulations and prove that side-effect-free evaluation is a bisimulation. This research is part of a wider project that aims to verify refactorings to prove that particular program code transformations preserve program behaviour.
- 4 March 2024
- Published by University of Szeged in Acta Cybernetica
- Vol. 26 (3) , 373-404
Open AccessA Formalisation of Core Erlang, a Concurrent Actor Language
In order to reason about the behaviour of programs described in a programming language, a mathematically rigorous definition of that language is needed. In this paper, we present a machine-checked formalisation of concurrent Core Erlang (a subset of Erlang) based on our previous formalisations of its sequential sublanguage. We define a modular, frame stack semantics, show how program evaluation is carried out with it, and prove a number of properties (e.g. determinism, confluence). Finally, we define program equivalence based on bisimulations and prove that side-effect-free evaluation is a bisimulation. This research is part of a wider project that aims to verify refactorings to prove that particular program code transformations preserve program behaviour.