The SCEAS System
Navigation Menu

Search the dblp DataBase


Ulrich Neumerkel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Teresita Krueger, George Kurian, Anil Nair, Gustaf Neumann, Ulrich Neumerkel, Stefan Nusser, Peter B. Reintjes, Andrew Taylor, Daphne Tzoar, Adrian Walker
    People Oriented Software Technology, and its Use in Environmental Reporting [Citation Graph (0, 0)][DBLP]
    DEXA, 1995, pp:136-145 [Conf]
  2. Ulrich Neumerkel
    Interprocedural Register Allocation for the WAM based on Source to Source Transformations. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:127-141 [Conf]
  3. Ulrich Neumerkel
    GUPU: A Prolog Course Environment and its Programming Methodology (Poster Abstract). [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:549- [Conf]
  4. Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet
    cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2001, pp:271-286 [Conf]
  5. Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
    Non-Termination Inference for Optimal Termination Conditions of Logic Programs. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2002, pp:87-0 [Conf]
  6. Ulrich Neumerkel
    Une transformation de programme basée sur la notion d'équations entre termes. [Citation Graph (0, 0)][DBLP]
    JFPL, 1993, pp:215-229 [Conf]
  7. Ulrich Neumerkel
    A Transformation Based in the Equality Between Terms. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:162-176 [Conf]
  8. Ulrich Neumerkel
    Pruning Infinite Failure Branches in Programs with Occur-Check. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:172-177 [Conf]
  9. Ulrich Neumerkel, Stefan Kral
    Declarative program development in Prolog with GUPU. [Citation Graph (0, 0)][DBLP]
    WLPE, 2002, pp:77-86 [Conf]
  10. Ulrich Neumerkel, Christoph Rettig, Christian Schallart
    Visualizing Solutions with Viewers. [Citation Graph (0, 0)][DBLP]
    LPE, 1997, pp:43-50 [Conf]
  11. Andreas Krall, Ulrich Neumerkel
    The Vienna Abstract Machine. [Citation Graph (0, 0)][DBLP]
    PLILP, 1990, pp:121-135 [Conf]
  12. Paul Tarau, Ulrich Neumerkel
    A Novel Term Compression Scheme and Data Representation in the BinWAM. [Citation Graph (0, 0)][DBLP]
    PLILP, 1994, pp:73-87 [Conf]
  13. Ulrich Neumerkel, Frédéric Mesnard
    Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:328-342 [Conf]
  14. Frédéric Mesnard, Ulrich Neumerkel
    Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:93-110 [Conf]
  15. Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
    Detecting Optimal Termination Conditions of Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:509-526 [Conf]
  16. Ulrich Neumerkel
    Interprozedurale Registerallokation durch Quelltexttransformationen. [Citation Graph (0, 0)][DBLP]
    WLP, 1995, pp:171-178 [Conf]
  17. Serge Burckel, Sébastien Hoarau, Frédéric Mesnard, Ulrich Neumerkel
    cTI: Bottom-Up Termination Inference for Logic Programs. [Citation Graph (0, 0)][DBLP]
    15. WLP, 2000, pp:123-134 [Conf]
  18. Stefan Kral, Frédéric Mesnard, Ulrich Neumerkel
    Slicing zur Fehlersuche in Logikprogrammen. [Citation Graph (0, 0)][DBLP]
    WLP, 2000, pp:241-243 [Conf]
  19. Ulrich Neumerkel, Stefan Kral
    Declarative program development in Prolog with GUPU [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]

  20. Better Termination for Prolog with Constraints [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002