activity
20142021
most citedImplementing Anti-Unification Modulo Equational Theory

3 citations · 8 across the 12 of their papers we have counts for

collaborators
Showing 2014Show all

6 papers · 1 filter

cs.SE2014

Experiences in Developing Time-Critical Systems - The Case Study "Production Cell"

Jochen Burghardt

Starting from an informal requirements description of a toy production cell used in an intra-project competition in 1994, we give a formal specification that is as close as possibl…

cs.LO2014★ 3 cited

Implementing Anti-Unification Modulo Equational Theory

Jochen Burghardt, Birgit Heinz

We present an implementation of E-anti-unification as defined in Heinz (1995), where tree-grammar descriptions of equivalence classes of terms are used to compute generalizations m…

cs.FL2014

Regular Substitution Sets: A Means of Controlling E-Unification

Jochen Burghardt

A method for selecting solution constructors in narrowing is presented. The method is based on a sort discipline that describes regular sets of ground constructor terms as sorts. I…

cs.LO2014

Axiomatization of Finite Algebras

Jochen Burghardt

We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a…

cs.LO2014

E-Generalization Using Grammars

Jochen Burghardt

We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization set…

cs.DS2014

Maintaining partial sums in logarithmic time

Jochen Burghardt

We present a data structure that allows to maintain in logarithmic time all partial sums of elements of a linear array during incremental changes of element's values.