The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alfons Geser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002