BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Denmark
1 × Japan
1 × Spain
1 × Sweden
1 × The Netherlands
1 × United Kingdom
3 × Germany
Collaborated with:
H.Zantema D.Hofbauer J.Waldmann W.Moczydlowski W.Küchlin S.Gorlatch A.Middeldorp E.Ohlebusch H.Hußmann J.Knoop G.Lüttgen O.Rüthing B.Steffen
Talks about:
rewrit (8) sup (8) termin (7) system (4) string (4) that (4) rule (4) automata (3) certifi (3) term (3)

Person: Alfons Geser

DBLP DBLP: Geser:Alfons

Contributed to:

RTA 20052005
CIAA 20042004
CIAA 20042005
RTA 20032003
RTA 20022002
FM-Trends 19981998
ALP/HOA 19971997
CC 19961996
CSL 19961996
RTA 19951995
ESOP 19861986

Wrote 14 papers:

RTA-2005-GeserHWZ #automaton #linear #on the #term rewriting #termination
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
RTA-2005-MoczydlowskiG #termination #thread
Termination of Single-Threaded One-Rule Semi-Thue Systems (WM, AG), pp. 338–352.
CIAA-2004-GeserHWZ #automaton #finite #string #termination
Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.
CIAA-J-2004-GeserHWZ05 #automaton #finite #string #term rewriting #termination
Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.
RTA-2003-Geser #string #termination
Termination of String Rewriting Rules That Have One Pair of Overlaps (AG), pp. 410–423.
RTA-2002-Geser #string
Loops of Superexponential Lengths in One-Rule String Rewriting (AG), pp. 267–280.
FM-1998-GeserK #verification
Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip (AG, WK), pp. 92–106.
ALP-1997-GeserG #functional #source code
Parallelizing Functional Programs by Generalization (AG, SG), pp. 46–60.
CC-1996-GeserKLRS #fixpoint #higher-order
Non-monotone Fixpoint Iterations to Resolve Second Order Effects (AG, JK, GL, OR, BS), pp. 106–120.
CSL-1996-GeserMOZ #term rewriting
Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.
RTA-1995-ZantemaG #termination
A Complete Characterization of Termination of Op 1q -> 1r Os (HZ, AG), pp. 41–55.
ESOP-1986-GeserH #case study #experience #interpreter #specification #term rewriting
Experiences with the RAP System — A Specification Interpreter Combining Term Rewriting and Resolution (AG, HH), pp. 339–350.
TAPSOFT-1995-Geser #induction #proving
Mechanized Inductive Proof of Properties of a Simple Code Optimizer (AG), pp. 605–619.
TAPSOFT-1997-GeserMOZ #termination
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules (AG, AM, EO, HZ), pp. 237–248.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.