default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfons Geser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i1]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Sparse Tiling through Overlap Closures for Termination of String Rewriting. CoRR abs/2003.01696 (2020)
2010 – 2019
- 2019
- [c22]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Sparse Tiling Through Overlap Closures for Termination of String Rewriting. FSCD 2019: 21:1-21:21
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. Reason. 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. WSC 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]Alfons Geser:
Loops of Superexponential Lengths in One-Rule String Rewriting. RTA 2002: 267-280 - 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]Alfons Geser, Hans Zantema:
Non-looping string rewriting. RAIRO Theor. Informatics Appl. 33(3): 279-302 (1999) - [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. Bull. EATCS 65: 139-142 (1998) - [j3]Reinhard Bündgen, Alfons Geser:
Formale Hardware-Verifikation mit Termersetzung. Künstliche Intell. 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 - 1990
- [b1]Alfons Geser:
Relative Termination. University of Passau, Germany, 1990, pp. 1-115
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
