Experiences with the RAP System - A Specification Interpreter Combining Term Rewriting and Resolution. - Alfons Geser; Heinrich Hußmann (ESOP, 1986)

Towards Advanced Programming Environments Based on Algebraic Concepts. - Manfred Broy; Alfons Geser; Heinrich Hußmann (Advanced Programming Environments, 1986)

A Specification of the intel 8085 Microprocessor: A Case Study. - Alfons Geser (Algebraic Methods, 1987)

The RAP System as a Tool for Testing COLD Specifications. - Heinrich Hußmann; Alfons Geser (Algebraic Methods, 1987)

A Compiler for a Class of Conditional Term Rewriting Systems. - Alfons Geser; Heinrich Hußmann; Andreas Mück (CTRS, 1987)

Relative Termination. - Alfons Geser (1990)

A Complete Characterization of Termination of Op 1q -> 1r Os. - Hans Zantema; Alfons Geser (RTA, 1995)

Mechanized Inductive Proof of Properties of a Simple Code Optimizer. - Alfons Geser (TAPSOFT, 1995)

Non-monotone Fixpoint Iterations to Resolve Second Order Effects. - Alfons Geser; Jens Knoop; Gerald Lüttgen; Oliver Rüthing; Bernhard Steffen (CC, 1996)

Relative Undecidability in Term Rewriting. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (CSL, 1996)

An Improved General Path Order. - Alfons Geser (Appl. Algebra Eng. Commun. Comput., 1996)

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (TAPSOFT, 1997)

Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems. - Alfons Geser (J. Symb. Comput., 1997)

Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip - Alfons Geser; Wolfgang Küchlin (FM-Trends, 1998)

On Essential Premises for the Transformation Order. - Alfons Geser (Bull. EATCS, 1998)

Formale Hardware-Verifikation mit Termersetzung. - Reinhard Bündgen; Alfons Geser (Künstliche Intell., 1998)

Non-looping string rewriting. - Alfons Geser; Hans Zantema (RAIRO Theor. Informatics Appl., 1999)

Parallelizing functional programs by generalization. - Alfons Geser; Sergei Gorlatch (J. Funct. Program., 1999)

A Complete Characterization of Termination of 0p 1q-> 1r 0s. - Hans Zantema; Alfons Geser (Appl. Algebra Eng. Commun. Comput., 2000)

On normalizing, non-terminating one-rule string rewriting systems. - Alfons Geser (Theor. Comput. Sci., 2000)

Loops of Superexponential Lengths in One-Rule String Rewriting. - Alfons Geser (RTA, 2002)

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (Inf. Comput., 2002)

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (Inf. Comput., 2002)

Decidability of Termination of Grid String Rewriting Rules. - Alfons Geser (SIAM J. Comput., 2002)

Termination of String Rewriting Rules That Have One Pair of Overlaps. - Alfons Geser (RTA, 2003)

Simulation and verification I: formal analysis of air traffic management systems: the case of conflict resolution and recovery. - Ricky W. Butler; Jeffrey Maddalon; Alfons Geser; César A. Muñoz (WSC, 2003)

A Unified Fault-Tolerance Protocol. - Paul S. Miner; Alfons Geser; Lee Pike; Jeffrey Maddalon (FORMATS/FTRTFT, 2004)

Abstractions for Fault-Tolerant Distributed System Verification. - Lee Pike; Jeffrey Maddalon; Paul S. Miner; Alfons Geser (TPHOLs, 2004)

Finding Finite Automata That Certify Termination of String Rewriting. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (CIAA, 2004)

Match-Bounded String Rewriting Systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (Appl. Algebra Eng. Commun. Comput., 2004)

Termination of Single-Threaded One-Rule Semi-Thue Systems. - Wojciech Moczydlowski; Alfons Geser (RTA, 2005)

Finding finite automata that certify termination of string rewriting systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (Int. J. Found. Comput. Sci., 2005)

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (J. Autom. Reason., 2005)

On tree automata that certify termination of left-linear term rewriting systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (Inf. Comput., 2007)

Sparse Tiling Through Overlap Closures for Termination of String Rewriting. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (FSCD, 2019)