default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDániel Horpácsi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Péter Bereczky
, Dániel Horpácsi, Simon J. Thompson:
A Formalisation of Core Erlang, a Concurrent Actor Language. Acta Cybern. 26(3): 373-404 (2024)- [c19]Bendegúz Seres, Dániel Horpácsi, Simon J. Thompson:
Is This Really a Refactoring? Automated Equivalence Checking for Erlang Projects. Erlang 2024: 55-66 - 2023
- [j4]Dániel Horpácsi, Péter Bereczky, Simon J. Thompson:
Program equivalence in an untyped, call-by-value functional language with uncurried functions. J. Log. Algebraic Methods Program. 132: 100857 (2023) - [c18]Simon J. Thompson, Dániel Horpácsi:
Refactoring = Substitution + Rewriting: Towards Generic, Language-Independent Refactorings. Eelco Visser Commemorative Symposium 2023: 26:1-26:9 - [c17]Jan Tusil, Péter Bereczky, Dániel Horpácsi:
Interactive Matching Logic Proofs in Coq. ICTAC 2023: 139-157 - [c16]Péter Bereczky, Dániel Horpácsi, Simon J. Thompson:
A frame stack semantics for sequential Core Erlang. IFL 2023: 5:1-5:13 - [i6]Péter Bereczky, Dániel Horpácsi, Simon J. Thompson:
A Frame Stack Semantics for Sequential Core Erlang. CoRR abs/2308.12403 (2023) - [i5]Péter Bereczky, Dániel Horpácsi, Simon J. Thompson:
A Formalisation of Core Erlang, a Concurrent Actor Language. CoRR abs/2311.10482 (2023) - 2022
- [c15]Péter Bereczky, Xiaohong Chen, Dániel Horpácsi, Tamás Bálint Mizsei, Lucas Peña, Jan Tusil:
Mechanizing Matching Logic in Coq. FROM 2022: 17-36 - [i4]Dániel Horpácsi, Péter Bereczky, Simon J. Thompson:
Program Equivalence in an Untyped, Call-by-value Lambda Calculus with Uncurried Recursive Functions. CoRR abs/2208.14260 (2022) - [i3]Simon J. Thompson, Dániel Horpácsi:
Refactoring = Substitution + Rewriting. CoRR abs/2211.11550 (2022) - 2021
- [j3]Dániel Horpácsi, Judit Köszegi, Dávid János Németh:
Towards a Generic Framework for Trustworthy Program Refactoring. Acta Cybern. 25(4): 753-779 (2021) - [j2]Dávid János Németh, Dániel Horpácsi, Máté Tejfel:
Adaptation of a Refactoring DSL for the Object-Oriented Paradigm. Acta Cybern. 25(4): 817-846 (2021) - 2020
- [c14]Péter Bereczky, Dániel Horpácsi, Simon J. Thompson:
Machine-checked natural semantics for Core Erlang: exceptions and side effects. Erlang Workshop 2020: 1-13 - [c13]Sándor Laki, Dániel Horpácsi, Péter Vörös, Máté Tejfel, Péter Hudoba, Gergely Pongrácz, László Molnár:
The Price for Asynchronous Execution of Extern Functions in Programmable Software Data Planes. ICIN 2020: 23-28 - [c12]Péter Bereczky, Dániel Horpácsi, Judit Köszegi, Soma Szeier, Simon J. Thompson:
Validating Formal Semantics by Property-Based Cross-Testing. IFL 2020: 150-161 - [c11]Péter Bereczky, Dániel Horpácsi, Simon J. Thompson:
A Proof Assistant Based Formalisation of a Subset of Sequential Core Erlang. TFP 2020: 139-158 - [i2]Péter Bereczky, Dániel Horpácsi, Simon J. Thompson:
A Proof Assistant Based Formalisation of Core Erlang. CoRR abs/2005.11821 (2020) - [i1]Péter Bereczky, Dániel Horpácsi, Simon J. Thompson:
A Comparison of Big-step Semantics Definition Styles. CoRR abs/2011.10373 (2020)
2010 – 2019
- 2019
- [b1]Dániel Horpácsi:
Verification and Application of Program Transformations. Eötvös Loránd University, Hungary, 2019 - [c10]Dániel Horpácsi, Sándor Laki, Péter Vörös, Máté Tejfel, Gergely Pongrácz, László Molnár:
Asynchronous Extern Functions in Programmable Software Data Planes. ANCS 2019: 1-2 - 2018
- [c9]Péter Vörös, Dániel Horpácsi, Róbert Kitlei, Dániel Leskó, Máté Tejfel, Sándor Laki:
T4P4S: A Target-independent Compiler for Protocol-independent Packet Processors. HPSR 2018: 1-8 - 2017
- [c8]Dániel Horpácsi, Judit Köszegi, Zoltán Horváth:
Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study. VPT@ETAPS 2017: 92-108 - 2016
- [c7]Sándor Laki, Dániel Horpácsi, Peter Vörös, Róbert Kitlei, Dániel Leskó, Máté Tejfel:
High speed packet forwarding compiled from protocol independent data plane specifications. SIGCOMM 2016: 629-630 - [c6]Dániel Horpácsi, Judit Köszegi, Simon J. Thompson:
Towards Trustworthy Refactoring in Erlang. VPT@ETAPS 2016: 83-103 - 2014
- [c5]István Bozó, Viktoria Fordós, Zoltán Horváth, Melinda Tóth, Dániel Horpácsi, Tamás Kozsik, Judit Köszegi, Adam D. Barwell, Christopher Brown, Kevin Hammond:
Discovering parallel pattern candidates in Erlang. Erlang Workshop 2014: 13-23 - [c4]István Bozó, Viktoria Fordós, Dániel Horpácsi, Zoltán Horváth, Tamás Kozsik, Judit Köszegi, Melinda Tóth:
Refactorings to Enable Parallelization. Trends in Functional Programming 2014: 104-121 - 2013
- [j1]Dániel Horpácsi, Judit Köszegi:
Static analysis of function calls in Erlang. e Informatica Softw. Eng. J. 7(1): 65-76 (2013) - [c3]Dániel Horpácsi:
Extending Erlang by utilising RefactorErl. Erlang Workshop 2013: 63-72 - 2010
- [c2]Dániel Drienyovszky, Dániel Horpácsi, Simon J. Thompson:
Quickchecking refactoring tools. Erlang Workshop 2010: 75-80
2000 – 2009
- 2008
- [c1]László Lövei, Csaba Hoch, Hanna Köllö, Tamás Nagy, Anikó Nagyné Víg, Dániel Horpácsi, Róbert Kitlei, Roland Király:
Refactoring module structure. Erlang Workshop 2008: 83-89
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
