dblp.uni-trier.dewww.uni-trier.de

Alfons Geser Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
36EEAlfons 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
35EEWojciech Moczydlowski, Alfons Geser: Termination of Single-Threaded One-Rule Semi-Thue Systems. RTA 2005: 338-352
34EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367
33EEAlfons 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)
32EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann: Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reasoning 34(4): 365-385 (2005)
2004
31EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145
30EEPaul S. Miner, Alfons Geser, Lee Pike, Jeffrey Maddalon: A Unified Fault-Tolerance Protocol. FORMATS/FTRTFT 2004: 167-182
29EELee Pike, Jeffrey Maddalon, Paul S. Miner, Alfons Geser: Abstractions for Fault-Tolerant Distributed System Verification. TPHOLs 2004: 257-270
28EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15(3-4): 149-171 (2004)
2003
27EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. MFCS 2003: 449-459
26EEAlfons Geser: Termination of String Rewriting Rules That Have One Pair of Overlaps. RTA 2003: 410-423
25EERicky W. Butler, Jeffrey Maddalon, Alfons Geser, César 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
24EEAlfons Geser: Loops of Superexponential Lengths in One-Rule String Rewriting. RTA 2002: 267-280
23EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)
22EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)
21EEAlfons Geser: Decidability of Termination of Grid String Rewriting Rules. SIAM J. Comput. 31(4): 1156-1168 (2002)
2000
20EEHans Zantema, Alfons Geser: A Complete Characterization of Termination of 0p 1q-> 1r 0s. Appl. Algebra Eng. Commun. Comput. 11(1): 1-25 (2000)
19EEAlfons Geser: On normalizing, non-terminating one-rule string rewriting systems. Theor. Comput. Sci. 243(1-2): 489-498 (2000)
1999
18 Alfons Geser, Hans Zantema: Non-looping string rewriting. ITA 33(3): 279-302 (1999)
17 Alfons Geser, Sergei Gorlatch: Parallelizing functional programs by generalization. J. Funct. Program. 9(6): 649-673 (1999)
1998
16EEAlfons Geser, Wolfgang Küchlin: Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip FM-Trends 1998: 92-106
15 Alfons Geser: On Essential Premises for the Transformation Order. Bulletin of the EATCS 65: 139-142 (1998)
14 Reinhard Bündgen, Alfons Geser: Formale Hardware-Verifikation mit Termersetzung. KI 12(4): 19-24 (1998)
1997
13EEAlfons Geser, Sergei Gorlatch: Parallelizing Functional Programs by Generalization. ALP/HOA 1997: 46-60
12EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248
11 Alfons Geser: Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems. J. Symb. Comput. 23(4): 399-411 (1997)
1996
10EEAlfons Geser, Jens Knoop, Gerald Lüttgen, Oliver Rüthing, Bernhard Steffen: Non-monotone Fixpoint Iterations to Resolve Second Order Effects. CC 1996: 106-120
9EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166
8EEAlfons Geser: An Improved General Path Order. Appl. Algebra Eng. Commun. Comput. 7(6): 469-511 (1996)
1995
7EEHans Zantema, Alfons Geser: A Complete Characterization of Termination of Op 1q -> 1r Os. RTA 1995: 41-55
6EEAlfons Geser: Mechanized Inductive Proof of Properties of a Simple Code Optimizer. TAPSOFT 1995: 605-619
1987
5EEHeinrich Hußmann, Alfons Geser: The RAP System as a Tool for Testing COLD Specifications. Algebraic Methods 1987: 331-345
4EEAlfons Geser: A Specification of the intel 8085 Microprocessor: A Case Study. Algebraic Methods 1987: 347-401
3 Alfons Geser, Heinrich Hußmann, Andreas Mück: A Compiler for a Class of Conditional Term Rewriting Systems. CTRS 1987: 84-90
1986
2 Manfred Broy, Alfons Geser, Heinrich Hußmann: Towards Advanced Programming Environments Based on Algebraic Concepts. Advanced Programming Environments 1986: 554-470
1EEAlfons Geser, Heinrich Hußmann: Experiences with the RAP System - A Specification Interpreter Combining Term Rewriting and Resolution. ESOP 1986: 339-350

Coauthor Index

1Manfred Broy [2]
2Reinhard Bündgen [14]
3Ricky W. Butler [25]
4Sergei Gorlatch [13] [17]
5Dieter Hofbauer [27] [28] [31] [32] [33] [34] [36]
6Heinrich Hußmann (Heinrich Hussmann) [1] [2] [3] [5]
7Jens Knoop [10]
8Wolfgang Küchlin [16]
9Gerald Lüttgen [10]
10Jeffrey Maddalon [25] [29] [30]
11Aart Middeldorp [9] [12] [22] [23]
12Paul S. Miner [29] [30]
13Wojciech Moczydlowski [35]
14Andreas Mück [3]
15César Muñoz [25]
16Enno Ohlebusch [9] [12] [22] [23]
17Lee Pike [29] [30]
18Oliver Rüthing [10]
19Bernhard Steffen [10]
20Johannes Waldmann [27] [28] [31] [32] [33] [34] [36]
21Hans Zantema [7] [9] [12] [18] [20] [22] [23] [31] [33] [34] [36]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)