Alfons Geser

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