| 2023 | LOPSTR | Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation. | John P. Gallagher, Manuel V. Hermenegildo, Jos F. Morales, Pedro Lpez-Garca |
| 2020 | ISSTA | Detecting and diagnosing energy issues for mobile applications. | Xueliang Li, Yuming Yang, Yepang Liu, John P. Gallagher, Kaishun Wu |
| 2019 | LOPSTR | A General Framework for Static Cost Analysis of Parallel Logic Programs. | Maximiliano Klemen, Pedro Lpez-Garca, John P. Gallagher, Jos F. Morales, Manuel V. Hermenegildo |
| 2016 | CAV | Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. | Bishoksan Kafle, John P. Gallagher, Jos F. Morales |
| 2016 | FLOPS | A Transformational Approach to Parametric Accumulated-Cost Static Profiling. | Rmy Haemmerl, Pedro Lpez-Garca, Umer Liqat, Maximiliano Klemen, John P. Gallagher, Manuel V. Hermenegildo |
| 2016 | Mobiquitous | Fine-Grained Energy Modeling for the Source Code of a Mobile Application. | Xueliang Li, John P. Gallagher |
| 2016 | SCAM | A Source-Level Energy Optimization Framework for Mobile Applications. | Xueliang Li, John P. Gallagher |
| 2015 | PEPM | Constraint Specialisation in Horn Clause Verification. | Bishoksan Kafle, John P. Gallagher |
| 2015 | VMCAI | Tree Automata-Based Refinement with Application to Horn Clause Verification. | Bishoksan Kafle, John P. Gallagher |
| 2011 | ICLP | Frontmatter, Table of Contents, Preface, Conference Organization. | John P. Gallagher, Michael Gelfond |
| 2011 | LOPSTR | Analysis of Logic Programs Using Regular Tree Languages - (Extended Abstract). | John P. Gallagher |
| 2010 | LPAR | Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation. | Gourinath Banda, John P. Gallagher |
| 2009 | ICLP | Non-discriminating Arguments and Their Uses. | Henning Christiansen, John P. Gallagher |
| 2008 | LOPSTR | Analysis of Linear Hybrid Systems in CLP. | Gourinath Banda, John P. Gallagher |
| 2008 | LOPSTR | From Monomorphic to Polymorphic Well-Typings and Beyond. | Tom Schrijvers, Maurice Bruynooghe, John P. Gallagher |
| 2008 | LPAR | Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation. | John P. Gallagher, Mads Rosendahl |
| 2007 | LOPSTR | Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation. | Elvira Albert, John P. Gallagher, Miguel Gmez-Zamalloa, Germn Puebla |
| 2006 | SCAM | Abstract Interpretation of PIC Programs through Logic Programming. | Kim S. Henriksen, John P. Gallagher |
| 2005 | ICLP | Techniques for Scaling Up Analyses Based on Pre-interpretations. | John P. Gallagher, Kim S. Henriksen, Gourinath Banda |
| 2005 | LOPSTR | Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates. | Elvira Albert, Germn Puebla, John P. Gallagher |
| 2005 | LOPSTR | Converting One Type-Based Abstract Domain to Another. | John P. Gallagher, Germn Puebla, Elvira Albert |
| 2005 | SAS | Inference of Well-Typings for Logic Programs with Application to Termination Analysis. | Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck |
| 2004 | ICLP | Abstract Domains Based on Regular Types. | John P. Gallagher, Kim S. Henriksen |
| 2004 | LOPSTR | Fully Automatic Binding-Time Analysis for Prolog. | Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen |
| 2004 | SMC | Analysis and specialisation of a PIC processor. | Kim S. Henriksen, John P. Gallagher |
| 2003 | LOPSTR | A Program Transformation for Backwards Analysis of Logic Programs. | John P. Gallagher |
| 2002 | LOPSTR | Convex Hull Abstractions in Specialization of CLP Programs. | Julio C. Peralta, John P. Gallagher |
| 2002 | PADL | Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. | John P. Gallagher, Germn Puebla |
| 2002 | VMCAI | Combining Norms to Prove Termination. | Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon |
| 2000 | PEPM | Using Regular Approximations for Generalisation During Partial Evalution. | John P. Gallagher, Julio C. Peralta |
| 1999 | LOPSTR | Imperative Program Specialisation: An Approach Using CLP. | Julio C. Peralta, John P. Gallagher |
| 1999 | PEPM | An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework. | Germn Puebla, Manuel V. Hermenegildo, John P. Gallagher |
| 1998 | SAS | Analysis of Imperative Programs through Analysis of Constraint Logic Programs. | Julio C. Peralta, John P. Gallagher, Hseyin Saglam |
| 1997 | LOPSTR | Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs. | Laura Lafave, John P. Gallagher |
| 1997 | LOPSTR | Constrained Regular Approximation of Logic Programs. | Hseyin Saglam, John P. Gallagher |
| 1995 | ICLP | Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. | Bern Martens, John P. Gallagher |
| 1994 | CADE | The Applicability of Logic Program Analysis and Transformation to Theorem Proving. | D. Andre de Waal, John P. Gallagher |
| 1994 | ICLP | Fast and Precise Regular Approximations of Logic Programs. | John P. Gallagher, D. Andre de Waal |
| 1994 | LOPSTR | A Transformation System for Definite Programs Based on Termination Analysis. | J. Cook, John P. Gallagher |
| 1994 | LOPSTR | Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types. | Emmanuil I. Marakakis, John P. Gallagher |
| 1993 | PEPM | Tutorial on Specialisation of Logic Programs. | John P. Gallagher |
| 1992 | LOPSTR | Deletion of Redundant Unary Type Predicates from Logic Programs. | John P. Gallagher, D. Andre de Waal |
| 1992 | SAS | Static Analysis for Logic Program Specification. | John P. Gallagher |
| 1991 | LOPSTR | Specialisation of a Unification Algorithm. | D. Andre de Waal, John P. Gallagher |
| 1990 | ICLP | The Derivation of an Algorithm for Program Specialisation. | John P. Gallagher, Maurice Bruynooghe |
| 1986 | ECAI | Transforming Logic Programs by Specialising Interpreters. | John P. Gallagher |