Alfons Geser

According to our database, Alfons Geser authored at least 35 papers between 1986 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2019

Sparse Tiling Through Overlap Closures for Termination of String Rewriting.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2007

On tree automata that certify termination of left-linear term rewriting systems.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema

Inf. Comput., 2007

2005

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann

J. Autom. Reason., 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 of Single-Threaded One-Rule Semi-Thue Systems.

Wojciech Moczydlowski, Alfons Geser

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004

Match-Bounded String Rewriting Systems.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann

Appl. Algebra Eng. Commun. Comput., 2004

Finding Finite Automata That Certify Termination of String Rewriting.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema

Proceedings of the Implementation and Application of Automata, 2004

Abstractions for Fault-Tolerant Distributed System Verification.

Lee Pike, Jeffrey Maddalon, Paul S. Miner, Alfons Geser

Proceedings of the Theorem Proving in Higher Order Logics, 17th International Conference, 2004

A Unified Fault-Tolerance Protocol.

Paul S. Miner, Alfons Geser, Lee Pike, Jeffrey Maddalon

Proceedings of the Formal Techniques, 2004

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

Proceedings of the 35th Winter Simulation Conference: Driving Innovation, 2003

Termination of String Rewriting Rules That Have One Pair of Overlaps.

Alfons Geser

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002

Decidability of Termination of Grid String Rewriting Rules.

Alfons Geser

SIAM J. Comput., 2002

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Inf. Comput., 2002

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Inf. Comput., 2002

Loops of Superexponential Lengths in One-Rule String Rewriting.

Alfons Geser

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2000

On normalizing, non-terminating one-rule string rewriting systems.

Alfons Geser

Theor. Comput. Sci., 2000

A Complete Characterization of Termination of 0^p 1^q-> 1^r 0^s.

Hans Zantema, Alfons Geser

Appl. Algebra Eng. Commun. Comput., 2000

1999

Parallelizing functional programs by generalization.

Alfons Geser, Sergei Gorlatch

J. Funct. Program., 1999

Non-looping string rewriting.

Alfons Geser, Hans Zantema

RAIRO Theor. Informatics Appl., 1999

1998

Formale Hardware-Verifikation mit Termersetzung.

Reinhard Bündgen, Alfons Geser

Künstliche Intell., 1998

On Essential Premises for the Transformation Order.

Alfons Geser

Bull. EATCS, 1998

Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip

Alfons Geser, Wolfgang Küchlin

Proceedings of the Applied Formal Methods, 1998

1997

Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems.

Alfons Geser

J. Symb. Comput., 1997

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1996

An Improved General Path Order.

Alfons Geser

Appl. Algebra Eng. Commun. Comput., 1996

Relative Undecidability in Term Rewriting.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

Non-monotone Fixpoint Iterations to Resolve Second Order Effects.

Alfons Geser, Jens Knoop, Gerald Lüttgen, Oliver Rüthing, Bernhard Steffen

Proceedings of the Compiler Construction, 6th International Conference, 1996

1995

Mechanized Inductive Proof of Properties of a Simple Code Optimizer.

Alfons Geser

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

A Complete Characterization of Termination of O^p 1^q -> 1^r O^s.

Hans Zantema, Alfons Geser

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

1990

Relative Termination.

Alfons Geser

PhD thesis, 1990

1987

A Compiler for a Class of Conditional Term Rewriting Systems.

Alfons Geser, Heinrich Hußmann, Andreas Mück

Proceedings of the Conditional Term Rewriting Systems, 1987

The RAP System as a Tool for Testing COLD Specifications.

Heinrich Hußmann, Alfons Geser

Proceedings of the Algebraic Methods: Theory, 1987

A Specification of the intel 8085 Microprocessor: A Case Study.

Alfons Geser

Proceedings of the Algebraic Methods: Theory, 1987

1986

Towards Advanced Programming Environments Based on Algebraic Concepts.

Manfred Broy, Alfons Geser, Heinrich Hußmann

Proceedings of the Advanced Programming Environments, 1986

Experiences with the RAP System - A Specification Interpreter Combining Term Rewriting and Resolution.

Alfons Geser, Heinrich Hußmann

Proceedings of the ESOP 86, 1986