7 citations · 7 across the 3 of their papers we have counts for
4 papers
Towards a constraint solver for proving confluence with invariant and equivalence of realistic CHR programs
Henning Christiansen, Maja Kirkeby
Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized…
Confluence of CHR revisited: invariants and modulo equivalence
Henning Christiansen, Maja H. Kirkeby
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition…
Confluence and Convergence in Probabilistically Terminating Reduction Systems
Maja H. Kirkeby, Henning Christiansen
Convergence of an abstract reduction system (ARS) is the property that any derivation from an initial state will end in the same final state, a.k.a. normal form. We generalize this…
On Proving Confluence Modulo Equivalence for Constraint Handling Rules
Henning Christiansen, Maja H. Kirkeby
Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered c…