John P. Gallagher

	2011
57		John P. Gallagher, Michael Gelfond: Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011, July 6-10, 2011, Lexington, Kentucky, USA Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011
56		John P. Gallagher, Michael Gelfond: Frontmatter, Table of Contents, Preface, Conference Organization. ICLP (Technical Communications) 2011
55		John P. Gallagher, Michael Gelfond: Introduction to the 27th International Conference on Logic Programming Special Issue. TPLP 11(4-5): 429-432 (2011)
	2010
54		John P. Gallagher, Janis Voigtländer: Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2010, Madrid, Spain, January 18-19, 2010 ACM 2010
53		Rafael Caballero, John P. Gallagher: Proceedings of the 19th Workshop on Logic-based methods in Programming Environments (WLPE 2009) CoRR 2010
52		Gourinath Banda, John P. Gallagher: Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation. LPAR (Dakar) 2010: 27-45
51		John P. Gallagher, Janis Voigtländer: Editorial. Higher-Order and Symbolic Computation 23(3): 273-274 (2010)
	2009
50		Henning Christiansen, John P. Gallagher: Non-discriminating Arguments and Their Uses. ICLP 2009: 55-69
49		Elvira Albert, John P. Gallagher, Miguel Gómez-Zamalloa, Germán Puebla: Type-based homeomorphic embedding for online termination. Inf. Process. Lett. 109(15): 879-886 (2009)
	2008
48		Tom Schrijvers, Maurice Bruynooghe, John P. Gallagher: From Monomorphic to Polymorphic Well-Typings and Beyond. LOPSTR 2008: 152-167
47		Gourinath Banda, John P. Gallagher: Analysis of Linear Hybrid Systems in CLP. LOPSTR 2008: 55-70
46		John P. Gallagher, Mads Rosendahl: Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation. LPAR 2008: 682-696
	2007
45		Elvira 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
44		Maurice 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)
43		Kim S. Henriksen, Gourinath Banda, John P. Gallagher: Experiments with a Convex Polyhedral Analysis Tool for Logic Programs CoRR abs/0712.2737: (2007)
42		Kim S. Henriksen, John P. Gallagher: A Web-based Tool Combining Different Type Analyses CoRR abs/cs/0701110: (2007)
	2006
41		Kim S. Henriksen, John P. Gallagher: Abstract Interpretation of PIC Programs through Logic Programming. SCAM 2006: 184-196
	2005
40		John P. Gallagher, Kim S. Henriksen, Gourinath Banda: Techniques for Scaling Up Analyses Based on Pre-interpretations. ICLP 2005: 280-296
39		Elvira Albert, Germán Puebla, John P. Gallagher: Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates. LOPSTR 2005: 115-132
38		John P. Gallagher, Germán Puebla, Elvira Albert: Converting One Type-Based Abstract Domain to Another. LOPSTR 2005: 147-162
37		Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck: Inference of Well-Typings for Logic Programs with Application to Termination Analysis. SAS 2005: 35-51
	2004
36		John P. Gallagher, Kim S. Henriksen: Abstract Domains Based on Regular Types. ICLP 2004: 27-42
35		Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen: Fully Automatic Binding-Time Analysis for Prolog. LOPSTR 2004: 53-68
34		Kim S. Henriksen, John P. Gallagher: Analysis and specialisation of a PIC processor. SMC (2) 2004: 1131-1135
	2003
33		John P. Gallagher: A Program Transformation for Backwards Analysis of Logic Programs. LOPSTR 2003: 92-105
	2002
32		Julio C. Peralta, John P. Gallagher: Convex Hull Abstractions in Specialization of CLP Programs. LOPSTR 2002: 90-108
31		John P. Gallagher, Germán Puebla: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. PADL 2002: 243-261
30		Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon: Combining Norms to Prove Termination. VMCAI 2002: 126-138
	2001
29		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)
	2000
28		John P. Gallagher, Julio C. Peralta: Using Regular Approximations for Generalisation During Partial Evalution. PEPM 2000: 44-51
	1999
27		Julio C. Peralta, John P. Gallagher: Imperative Program Specialisation: An Approach Using CLP. LOPSTR 1999: 102-117
26		Germán Puebla, Manuel V. Hermenegildo, John P. Gallagher: An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework. PEPM 1999: 75-84
	1998
25		Julio C. Peralta, John P. Gallagher, Hüseyin Saglam: Analysis of Imperative Programs through Analysis of Constraint Logic Programs. SAS 1998: 246-261
24		John P. Gallagher, Laura Lafave: The Role of Trace Abstractions in Program Specialization Algorithms. ACM Comput. Surv. 30(3es): 12 (1998)
23		Laura Lafave, John P. Gallagher: Extending the Power of Automatic Constraint-Based Partial Evaluators. ACM Comput. Surv. 30(3es): 15 (1998)
	1997
22		John P. Gallagher, Charles Consel, A. Michael Berman: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '97), Amsterdam, The Netherlands, June 12-13, 1997 ACM 1997
21		John P. Gallagher: Logic Programming Synthesis and Transformation, 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings Springer 1997
20		Laura Lafave, John P. Gallagher: Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs. LOPSTR 1997: 168-188
19		Hüseyin Saglam, John P. Gallagher: Constrained Regular Approximation of Logic Programs. LOPSTR 1997: 282-299
	1996
18		John P. Gallagher, Laura Lafave: Regular Approximation of Computation Paths in Logic and Functional Languages. Dagstuhl Seminar on Partial Evaluation 1996: 115-136
	1995
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
	1994
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
	1993
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
	1992
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
	1991
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)
	1990
4		John P. Gallagher, Maurice Bruynooghe: The Derivation of an Algorithm for Program Specialisation. ICLP 1990: 732-746
	1988
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)
	1986
1		John P. Gallagher: Transforming Logic Programs by Specialising Interpreters. ECAI 1986: 313-326

Coauthor Index

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

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page