The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John P. Gallagher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. D. Andre de Waal, John P. Gallagher
    The Applicability of Logic Program Analysis and Transformation to Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:207-221 [Conf]
  2. John P. Gallagher, Laura Lafave
    Regular Approximation of Computation Paths in Logic and Functional Languages. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Partial Evaluation, 1996, pp:115-136 [Conf]
  3. John P. Gallagher
    Transforming Logic Programs by Specialising Interpreters. [Citation Graph (0, 0)][DBLP]
    ECAI, 1986, pp:313-326 [Conf]
  4. John P. Gallagher, Maurice Bruynooghe
    The Derivation of an Algorithm for Program Specialisation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:732-746 [Conf]
  5. John P. Gallagher, Kim S. Henriksen
    Abstract Domains Based on Regular Types. [Citation Graph (0, 0)][DBLP]
    ICLP, 2004, pp:27-42 [Conf]
  6. John P. Gallagher, Kim S. Henriksen, Gourinath Banda
    Techniques for Scaling Up Analyses Based on Pre-interpretations. [Citation Graph (0, 0)][DBLP]
    ICLP, 2005, pp:280-296 [Conf]
  7. John P. Gallagher, D. Andre de Waal
    Fast and Precise Regular Approximations of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:599-613 [Conf]
  8. Bern Martens, John P. Gallagher
    Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:597-611 [Conf]
  9. Elvira Albert, Germán Puebla, John P. Gallagher
    Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2005, pp:115-132 [Conf]
  10. J. Cook, John P. Gallagher
    A Transformation System for Definite Programs Based on Termination Analysis. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1994, pp:51-68 [Conf]
  11. Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen
    Fully Automatic Binding-Time Analysis for Prolog. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:53-68 [Conf]
  12. John P. Gallagher
    A Program Transformation for Backwards Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:92-105 [Conf]
  13. John P. Gallagher, Germán Puebla, Elvira Albert
    Converting One Type-Based Abstract Domain to Another. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2005, pp:147-162 [Conf]
  14. John P. Gallagher, D. Andre de Waal
    Deletion of Redundant Unary Type Predicates from Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:151-167 [Conf]
  15. Laura Lafave, John P. Gallagher
    Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1997, pp:168-188 [Conf]
  16. Emmanuil I. Marakakis, John P. Gallagher
    Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1994, pp:138-153 [Conf]
  17. Julio C. Peralta, John P. Gallagher
    Convex Hull Abstractions in Specialization of CLP Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2002, pp:90-108 [Conf]
  18. Julio C. Peralta, John P. Gallagher
    Imperative Program Specialisation: An Approach Using CLP. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1999, pp:102-117 [Conf]
  19. Hüseyin Saglam, John P. Gallagher
    Constrained Regular Approximation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1997, pp:282-299 [Conf]
  20. D. Andre de Waal, John P. Gallagher
    Specialisation of a Unification Algorithm. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1991, pp:205-220 [Conf]
  21. Michael Codish, John P. Gallagher, Ehud Y. Shapiro
    Using Safe Approximations of Fixed Points for Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    META, 1988, pp:233-261 [Conf]
  22. John P. Gallagher, Germán Puebla
    Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    PADL, 2002, pp:243-261 [Conf]
  23. John P. Gallagher
    Tutorial on Specialisation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    PEPM, 1993, pp:88-98 [Conf]
  24. John P. Gallagher, Julio C. Peralta
    Using Regular Approximations for Generalisation During Partial Evalution. [Citation Graph (0, 0)][DBLP]
    PEPM, 2000, pp:44-51 [Conf]
  25. Germán Puebla, Manuel V. Hermenegildo, John P. Gallagher
    An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework. [Citation Graph (0, 0)][DBLP]
    PEPM, 1999, pp:75-84 [Conf]
  26. Hüseyin Saglam, John P. Gallagher
    Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:461-462 [Conf]
  27. Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck
    Inference of Well-Typings for Logic Programs with Application to Termination Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:35-51 [Conf]
  28. John P. Gallagher
    Static Analysis for Logic Program Specification. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:285-294 [Conf]
  29. Julio C. Peralta, John P. Gallagher, Hüseyin Saglam
    Analysis of Imperative Programs through Analysis of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1998, pp:246-261 [Conf]
  30. Kim S. Henriksen, John P. Gallagher
    Abstract Interpretation of PIC Programs through Logic Programming. [Citation Graph (0, 0)][DBLP]
    SCAM, 2006, pp:184-196 [Conf]
  31. John P. Gallagher, Dmitri Boulanger, Hüseyin Saglam
    Practical Model-Based Static Analysis for Definite Logic Programs. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:351-365 [Conf]
  32. D. Andre de Waal, John P. Gallagher
    Logic Program Specialisation With Deletion of Useless Clauses. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:632- [Conf]
  33. Kim S. Henriksen, John P. Gallagher
    Analysis and specialisation of a PIC processor. [Citation Graph (0, 0)][DBLP]
    SMC (2), 2004, pp:1131-1135 [Conf]
  34. Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon
    Combining Norms to Prove Termination. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:126-138 [Conf]
  35. John P. Gallagher, Laura Lafave
    The Role of Trace Abstractions in Program Specialization Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1998, v:30, n:3es, pp:12- [Journal]
  36. Laura Lafave, John P. Gallagher
    Extending the Power of Automatic Constraint-Based Partial Evaluators. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1998, v:30, n:3es, pp:15- [Journal]
  37. John P. Gallagher, Julio C. Peralta
    Regular Tree Languages as an Abstract Domain in Program Specialisation. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2001, v:14, n:2-3, pp:143-172 [Journal]
  38. John P. Gallagher, Maurice Bruynooghe
    The Derivation of an Algorithm for Program Specialisation. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1991, v:9, n:3/4, pp:305-334 [Journal]
  39. John P. Gallagher, Michael Codish, Ehud Y. Shapiro
    Specialisation of Prolog and FCP Programs Using Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1988, v:6, n:2&3, pp:159-186 [Journal]
  40. Kim S. Henriksen, John P. Gallagher
    A Web-based Tool Combining Different Type Analyses [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  41. Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof
    Termination analysis of logic programs through combination of type-based norms. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:2, pp:- [Journal]

  42. Non-discriminating Arguments and Their Uses. [Citation Graph (, )][DBLP]


  43. Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation. [Citation Graph (, )][DBLP]


  44. From Monomorphic to Polymorphic Well-Typings and Beyond. [Citation Graph (, )][DBLP]


  45. Analysis of Linear Hybrid Systems in CLP. [Citation Graph (, )][DBLP]


  46. Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation. [Citation Graph (, )][DBLP]


  47. Experiments with a Convex Polyhedral Analysis Tool for Logic Programs [Citation Graph (, )][DBLP]


Search in 1.383secs, Finished in 1.385secs
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