Dieter Hofbauer

Affiliations:
  • University of Kassel, Germany


According to our database1, Dieter Hofbauer authored at least 27 papers between 1988 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions.
CoRR, 2023

Old and New Benchmarks for Relative Termination of String Rewrite Systems.
CoRR, 2023

2019
Sparse Tiling Through Overlap Closures for Termination of String Rewriting.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2010
Finding and Certifying Loops.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2007
On tree automata that certify termination of left-linear term rewriting systems.
Inf. Comput., 2007

2006
Termination of {<i>a</i><i>a</i>-><i>b</i><i>c</i>, <i>b</i><i>b</i>-><i>a</i><i>c</i>, <i>c</i><i>c</i>-><i>a</i><i>b</i>}.
Inf. Process. Lett., 2006

Termination of String Rewriting with Matrix Interpretations.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005
On state-alternating context-free grammars.
Theor. Comput. Sci., 2005

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.
J. Autom. Reason., 2005

Finding finite automata that certify termination of string rewriting systems.
Int. J. Found. Comput. Sci., 2005

2004
Deleting string rewriting systems preserve regularity.
Theor. Comput. Sci., 2004

Match-Bounded String Rewriting Systems.
Appl. Algebra Eng. Commun. Comput., 2004

Finding Finite Automata That Certify Termination of String Rewriting.
Proceedings of the Implementation and Application of Automata, 2004

2003
An upper bound on the derivational complexity of Knuth-Bendix orderings.
Inf. Comput., 2003

2002
Test Sets for the Universal and Existential Closure of Regular Tree Languages.
Inf. Comput., 2002

2001
Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity.
Appl. Algebra Eng. Commun. Comput., 2001

Termination Proofs by Context-Dependent Interpretations.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

1994
Linearizing Term Rewriting Systems Using Test Sets.
J. Symb. Comput., 1994

Some Results on Top-Context-Free Tree Languages.
Proceedings of the Trees in Algebra and Programming, 1994

1992
Termination proofs and derivation lengths in term rewriting systems.
PhD thesis, 1992

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths.
Theor. Comput. Sci., 1992

Computing Linearizations Using Test Sets.
Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

1991
Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1989
Termination Proofs and the Length of Derivations (Preliminary Version).
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

Grundlagen des maschinellen Beweisens - eine Einführung für Informatiker und Mathematiker.
Vieweg, ISBN: 978-3-528-04718-4, 1989

1988
Proving Inductive Theorems Based on Term Rewriting Systems.
Proceedings of the Algebraic and Logic Programming, 1988

Proving Inductive Theorems in Equational Theories.
Proceedings of the 6st Workshop on Abstract Data Type, 1988. University of Berlin, Germany, 1988


  Loading...