Alfons Geser - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2019

Sparse Tiling Through Overlap Closures for Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann. RTA 2019: [doi]

2012

Relative terminationAlfons Geser. PhD thesis, University of Passau, 2012. [doi]

2007

On tree automata that certify termination of left-linear term rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. iandc, 205(4):512-534, 2007. [doi]

2005

2004

2003

Simulation and verification I: formal analysis of air traffic management systems: the case of conflict resolution and recoveryRicky W. Butler, Jeffrey Maddalon, Alfons Geser, César Muñoz. wsc 2003: 906-914 [doi]

Match-Bounded String Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann. mfcs 2003: 449-459 [doi]

Termination of String Rewriting Rules That Have One Pair of OverlapsAlfons Geser. RTA 2003: 410-423 [doi]

2002

2000

On normalizing, non-terminating one-rule string rewriting systemsAlfons Geser. TCS, 243(1-2):489-498, 2000. [doi]

A Complete Characterization of Termination of 0:::p::: 1:::q:::-> 1:::r::: 0:::s:::Hans Zantema, Alfons Geser. aaecc, 11(1):1-25, 2000. [doi]

1999

Non-looping string rewritingAlfons Geser, Hans Zantema. ita, 33(3):279-302, 1999.

Parallelizing functional programs by generalizationAlfons Geser, Sergei Gorlatch. JFP, 9(6):649-673, 1999.

1998

Formale Hardware-Verifikation mit TermersetzungReinhard Bündgen, Alfons Geser. ki, 12(4):19-24, 1998.

Structured Formal Verification of a Fragment of the IBM S/390 Clock ChipAlfons Geser, Wolfgang Küchlin. FM 1999: 92-106

On Essential Premises for the Transformation OrderAlfons Geser. eatcs, 65:139-142, 1998.

1997

Omega-Termination is Undecidable for Totally Terminating Term Rewriting SystemsAlfons Geser. JSC, 23(4):399-411, 1997.

Relative Undecidability in the Termination Hierarchy of Single Rewrite RulesAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. tapsoft 1997: 237-248

Parallelizing Functional Programs by GeneralizationAlfons Geser, Sergei Gorlatch. icalp 1997: 46-60

1996

An Improved General Path OrderAlfons Geser. aaecc, 7(6):469-511, 1996. [doi]

Relative Undecidability in Term RewritingAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. csl 1997: 150-166

Non-monotone Fixpoint Iterations to Resolve Second Order EffectsAlfons Geser, Jens Knoop, Gerald Lüttgen, Oliver Rüthing, Bernhard Steffen. cc 1996: 106-120

1995

Mechanized Inductive Proof of Properties of a Simple Code OptimizerAlfons Geser. tapsoft 1995: 605-619

A Complete Characterization of Termination of O:::p::: 1:::q::: -> 1:::r::: O:::s:::Hans Zantema, Alfons Geser. RTA 1995: 41-55

1990

Relative TerminationAlfons Geser. PhD thesis, University of Passau, Germany, 1990. [doi]

1987

A Compiler for a Class of Conditional Term Rewriting SystemsAlfons Geser, Heinrich Hußmann, Andreas Mück. ctrs 1988: 84-90

A Specification of the intel 8085 Microprocessor: A Case StudyAlfons Geser. am 1989: 347-401

The RAP System as a Tool for Testing COLD SpecificationsHeinrich Hußmann, Alfons Geser. am 1989: 331-345

1986

Towards Advanced Programming Environments Based on Algebraic ConceptsManfred Broy, Alfons Geser, Heinrich Hußmann. ifip 1986: 554-470

Experiences with the RAP System - A Specification Interpreter Combining Term Rewriting and ResolutionAlfons Geser, Heinrich Hußmann. ESOP 1986: 339-350

Sign in or sign up to see more results.

runs on WebDSL