John P. Gallagher

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

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

Coauthor Index

1Elvira Albert [37] [38] [44]
2Gourinath Banda [39] [42] [46]
3Dmitri Boulanger [16]
4Maurice Bruynooghe [4] [5] [36] [43] [47]
5Michael Codish [2] [3] [29] [43]
6J. Cook [11]
7Stephen-John Craig [34]
8Samir Genaim [29] [43]
9Miguel Gómez-Zamalloa [44]
10Kim S. Henriksen [33] [34] [35] [39] [40] [41] [42]
11Manuel V. Hermenegildo [25]
12Wouter Van Humbeeck [36]
13Laura Lafave [18] [20] [22] [23]
14Vitaly Lagoon [29]
15Michael Leuschel [34]
16Emmanuil I. Marakakis [12]
17Bern Martens [17]
18Julio C. Peralta [24] [26] [27] [28] [31]
19Germán Puebla (German Puebla) [25] [30] [37] [38] [44]
20Mads Rosendahl [45]
21Hüseyin Saglam [15] [16] [19] [24]
22Tom Schrijvers [47]
23Ehud Y. Shapiro [2] [3]
24Wim Vanhoof [43]
25D. Andre de Waal [6] [8] [10] [13] [14]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)