10 citations · 21 across the 8 of their papers we have counts for
8 papers
Dependently Typed Model Composition for Matching Logic
Ádám Kurucz, Péter Bereczky, Dániel Horpácsi
This paper investigates model composition—often referred to as "gluing"—within the framework of matching logic. Specifically, we examine the systematic combination of existing…
On a Dependently Typed Encoding of Matching Logic
Ádám Kurucz, Péter Bereczky, Dániel Horpácsi
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 lan…
Unification in Matching Logic -- Revisited
Ádám Kurucz, Péter Bereczky, Dániel Horpácsi
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 co…
Refactoring = Substitution + Rewriting
Simon Thompson, Dániel Horpácsi
We present an approach to describing refactorings that abstracts away from particular refactorings to classes of similar transformations, and presents an implementation of these th…
Program Equivalence in an Untyped, Call-by-value Lambda Calculus with Uncurried Recursive Functions
Dániel Horpácsi, Péter Bereczky, Simon Thompson
We aim to reason about the correctness of behaviour-preserving transformations of Erlang programs. Behaviour preservation is characterised by semantic equivalence. Based upon our e…
Mechanizing Matching Logic In Coq
Péter Bereczky, Xiaohong Chen, Dániel Horpácsi +2
Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define m…
Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study
Dániel Horpácsi, Judit Kőszegi, Zoltán Horváth
Widely used complex code refactoring tools lack a solid reasoning about the correctness of the transformations they implement, whilst interest in proven correct refactoring is ever…
Towards Trustworthy Refactoring in Erlang
Dániel Horpácsi, Judit Kőszegi, 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 styl…