Get started
Author

Alfons Geser

Observed names: A GESER, A. Geser, ALFONS GESER, Alfons Geser (icase, Geser, A., Geser, Alfons
Observed institutions: Langley Research Center, National Institute of Aerospace, Leipzig University of Applied Sciences, University of Passau, Universität Ulm, National Aeronautics and Space Administration, University of Tübingen
OpenAlex ID: A5111933891
Tactical conflict detection and resolution in a 3-d airspace
2001 · Gilles Dowek, Munoz Cesar, et al. · Defense Technical Information Center (DTIC) · 58
Match-Bounded String Rewriting Systems
2004 · Alfons Geser, Dieter Hofbauer, et al. · Applicable Algebra in Engineering Communication and Computing · 54
On tree automata that certify termination of left-linear term rewriting systems
2007 · Alfons Geser, Dieter Hofbauer, et al. · Information and Computation · 46
PDF
1 CoLoR: a Coq Library on Rewriting and termination
2006 · Blanqui, F., Coupet-Grimal, S., et al. · 39
Experiences with the RAP system — a specification interpreter combining term rewriting and resolution
1986 · Alfons Geser, Heinrich Hussman · Lecture notes in computer science · 35
PDF
A Unified Fault-Tolerance Protocol
2004 · Paul Miner, Alfons Geser, et al. · Lecture notes in computer science · 32
Abstractions for Fault-Tolerant Distributed System Verification
2004 · Lee Pike, Jeffrey Maddalon, et al. · Lecture notes in computer science · 29
Non-Looping String Rewriting
1999 · Alfons Geser, Hans Zantema · RAIRO - Theoretical Informatics and Applications · 27
PDF
A geometric approach to strategic conflict detection and resolution [ATC]
2003 · A. Geser, C. Munoz · IEEE/AIAA Digital Avionics Systems Conference (DASC) · 25
Parallelizing functional programs by generalization
1999 · ALFONS GESER, SERGEI GORLATCH · Journal of Functional Programming · 25
PDF
A complete characterization of termination of 0p 1q→1r 0s
1995 · Hans Zantema, Alfons Geser · Lecture notes in computer science · 17
A compiler for a class of conditional term rewriting systems
1988 · Alfons Geser, Heinrich Hussmann, et al. · Lecture notes in computer science · 17
A Complete Characterization of Termination of 0 p 1 q → 1 r 0 s
2000 · Hans Zantema, Alfons Geser · Applicable Algebra in Engineering Communication and Computing · 16
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds
2005 · Alfons Geser, Dieter Hofbauer, et al. · Journal of Automated Reasoning · 15
Formal Verification of a Conflict Resolution and Recovery Algorithm
2013 · Jeffrey M. Maddalon, Ricky W. Butler, et al. · 13
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
2005 · Alfons Geser, Dieter Hofbauer, et al. · Lecture notes in computer science · 13
Match-Bounded String Rewriting Systems
2003 · Alfons Geser, Dieter Hofbauer, et al. · Lecture notes in computer science · 13
A New On-Line Diagnosis Protocol for the Spider Family of Byzantine Fault Tolerant Architectures
2013 · Alfons Geser, Paul S. Miner · 12
PDF
An Improved General Path Order
1996 · A. Geser · Applicable Algebra in Engineering Communication and Computing · 12
A specification of the intel 8085 microprocessor: A case study
2005 · Alfons Geser · Springer eBooks · 11
Air Traffic Conflict Resolution and Recovery
2002 · Alfons Geser, César Muñoz, et al. · Defense Technical Information Center (DTIC) · 10
Non-looping rewriting
1996 · Hans Zantema, Alfons Geser · Utrecht University Repository (Utrecht University) · 10
PDF
Finding Finite Automata That Certify Termination of String Rewriting Systems
2005 · ALFONS GESER, DIETER HOFBAUER, et al. · International Journal of Foundations of Computer Science · 9
Formal analysis of air traffic management systems: the case of conflict resolution and recovery
2004 · R. Butler, J. Maddalon, et al. · International Conference on Machine Learning and Cybernetics · 9
Relative Undecidability in Term RewritingI. The Termination Hierarchy
2002 · A GESER, A MIDDELDORP, et al. · Information and Computation · 9
Works count: 74
Citation count: 679
H-index: 14
I10-index: 22
Year
Topic
Type