Alfons Geser

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 2

Top Venues

CoRR

FSCD

University of Passau, Germany (PHD)

Education History

University of Passau, Germany

PHD

Publications

Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Sparse Tiling through Overlap Closures for Termination of String Rewriting. CoRR (2020)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Sparse Tiling Through Overlap Closures for Termination of String Rewriting. FSCD (2019)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205 (4) (2007)
Wojciech Moczydlowski, Alfons Geser
Termination of Single-Threaded One-Rule Semi-Thue Systems. RTA (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci. 16 (3) (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reason. 34 (4) (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
Finding Finite Automata That Certify Termination of String Rewriting. CIAA (2004)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15 (3-4) (2004)
Paul S. Miner, Alfons Geser, Lee Pike, Jeffrey Maddalon
A Unified Fault-Tolerance Protocol. FORMATS/FTRTFT (2004)
Lee Pike, Jeffrey Maddalon, Paul S. Miner, Alfons Geser
Abstractions for Fault-Tolerant Distributed System Verification. TPHOLs (2004)
Alfons Geser
Termination of String Rewriting Rules That Have One Pair of Overlaps. RTA (2003)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Match-Bounded String Rewriting Systems. MFCS (2003)
Ricky W. Butler, Jeffrey Maddalon, Alfons Geser, César A. Muñoz
Simulation and verification I: formal analysis of air traffic management systems: the case of conflict resolution and recovery. WSC (2003)
Alfons Geser
Loops of Superexponential Lengths in One-Rule String Rewriting. RTA (2002)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178 (1) (2002)
Alfons Geser
Decidability of Termination of Grid String Rewriting Rules. SIAM J. Comput. 31 (4) (2002)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178 (1) (2002)
Hans Zantema, Alfons Geser
. Appl. Algebra Eng. Commun. Comput. 11 (1) (2000)
Alfons Geser
On normalizing, non-terminating one-rule string rewriting systems. Theor. Comput. Sci. 243 (1-2) (2000)
Alfons Geser, Hans Zantema
Non-looping string rewriting. RAIRO Theor. Informatics Appl. 33 (3) (1999)
Alfons Geser, Sergei Gorlatch
Parallelizing functional programs by generalization. J. Funct. Program. 9 (6) (1999)
Alfons Geser, Wolfgang Küchlin
Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip FM-Trends (1998)
Alfons Geser
On Essential Premises for the Transformation Order. Bull. EATCS 65 (1998)
Reinhard Bündgen, Alfons Geser
Formale Hardware-Verifikation mit Termersetzung. Künstliche Intell. 12 (4) (1998)
Alfons Geser
Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems. J. Symb. Comput. 23 (4) (1997)
Alfons Geser, Sergei Gorlatch
Parallelizing Functional Programs by Generalization. ALP/HOA (1997)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT (1997)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting. CSL (1996)
Alfons Geser, Jens Knoop, Gerald Lüttgen, Oliver Rüthing, Bernhard Steffen
Non-monotone Fixpoint Iterations to Resolve Second Order Effects. CC (1996)
Alfons Geser
An Improved General Path Order. Appl. Algebra Eng. Commun. Comput. 7 (6) (1996)
Alfons Geser
Mechanized Inductive Proof of Properties of a Simple Code Optimizer. TAPSOFT (1995)
Hans Zantema, Alfons Geser
. RTA (1995)
Alfons Geser, Heinrich Hußmann, Andreas Mück
A Compiler for a Class of Conditional Term Rewriting Systems. CTRS (1987)
Heinrich Hußmann, Alfons Geser
The RAP System as a Tool for Testing COLD Specifications. Algebraic Methods (1987)
Alfons Geser
A Specification of the intel 8085 Microprocessor: A Case Study. Algebraic Methods (1987)
Manfred Broy, Alfons Geser, Heinrich Hußmann
Towards Advanced Programming Environments Based on Algebraic Concepts. Advanced Programming Environments (1986)
Alfons Geser, Heinrich Hußmann
Experiences with the RAP System - A Specification Interpreter Combining Term Rewriting and Resolution. ESOP (1986)

Alfons Geser.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alfons Geser