Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alfons Geser
2000 – 2009
- 2007
[j15]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205(4): 512-534 (2007)- 2005
- [j14]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): 471-486 (2005)
- [j13]Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reasoning 34(4): 365-385 (2005)
- [c21]Wojciech Moczydlowski, Alfons Geser: Termination of Single-Threaded One-Rule Semi-Thue Systems. RTA 2005: 338-352
- [c20]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367
- 2004
- [j12]Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15(3-4): 149-171 (2004)
- [c19]Paul S. Miner, Alfons Geser, Lee Pike, Jeffrey Maddalon: A Unified Fault-Tolerance Protocol. FORMATS/FTRTFT 2004: 167-182
- [c18]Lee Pike, Jeffrey Maddalon, Paul S. Miner, Alfons Geser: Abstractions for Fault-Tolerant Distributed System Verification. TPHOLs 2004: 257-270
- [c17]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145
- 2003
- [c16]Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. MFCS 2003: 449-459
- [c15]Alfons Geser: Termination of String Rewriting Rules That Have One Pair of Overlaps. RTA 2003: 410-423
- [c14]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. Winter Simulation Conference 2003: 906-914
- 2002
- [j11]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)
- [j10]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)
- [j9]Alfons Geser: Decidability of Termination of Grid String Rewriting Rules. SIAM J. Comput. 31(4): 1156-1168 (2002)
- [c13]
- 2000
- [j8]Hans Zantema, Alfons Geser: A Complete Characterization of Termination of 0p 1q-> 1r 0s. Appl. Algebra Eng. Commun. Comput. 11(1): 1-25 (2000)
- [j7]Alfons Geser: On normalizing, non-terminating one-rule string rewriting systems. Theor. Comput. Sci. 243(1-2): 489-498 (2000)
1990 – 1999
- 1999
- [j6]
- [j5]Alfons Geser, Sergei Gorlatch: Parallelizing functional programs by generalization. J. Funct. Program. 9(6): 649-673 (1999)
- 1998
- [j4]Alfons Geser: On Essential Premises for the Transformation Order. Bulletin of the EATCS 65: 139-142 (1998)
- [j3]Reinhard Bündgen, Alfons Geser: Formale Hardware-Verifikation mit Termersetzung. KI 12(4): 19-24 (1998)
- [c12]Alfons Geser, Wolfgang Küchlin: Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip. FM-Trends 1998: 92-106
- 1997
- [j2]Alfons Geser: Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems. J. Symb. Comput. 23(4): 399-411 (1997)
- [c11]Alfons Geser, Sergei Gorlatch: Parallelizing Functional Programs by Generalization. ALP/HOA 1997: 46-60
- [c10]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248
- 1996
- [j1]Alfons Geser: An Improved General Path Order. Appl. Algebra Eng. Commun. Comput. 7(6): 469-511 (1996)
- [c9]Alfons Geser, Jens Knoop, Gerald Lüttgen, Oliver Rüthing, Bernhard Steffen: Non-monotone Fixpoint Iterations to Resolve Second Order Effects. CC 1996: 106-120
- [c8]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166
- 1995
- [c7]Hans Zantema, Alfons Geser: A Complete Characterization of Termination of Op 1q -> 1r Os. RTA 1995: 41-55
- [c6]Alfons Geser: Mechanized Inductive Proof of Properties of a Simple Code Optimizer. TAPSOFT 1995: 605-619
1980 – 1989
- 1987
- [c5]Heinrich Hußmann, Alfons Geser: The RAP System as a Tool for Testing COLD Specifications. Algebraic Methods 1987: 331-345
- [c4]Alfons Geser: A Specification of the intel 8085 Microprocessor: A Case Study. Algebraic Methods 1987: 347-401
- [c3]Alfons Geser, Heinrich Hußmann, Andreas Mück: A Compiler for a Class of Conditional Term Rewriting Systems. CTRS 1987: 84-90
- 1986
- [c2]Alfons Geser, Heinrich Hußmann: Experiences with the RAP System - A Specification Interpreter Combining Term Rewriting and Resolution. ESOP 1986: 339-350
- [c1]Manfred Broy, Alfons Geser, Heinrich Hußmann: Towards Advanced Programming Environments Based on Algebraic Concepts. Advanced Programming Environments 1986: 554-470
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:53 CET by the dblp team