Transforming Logic Programs by Specialising Interpreters. - John P. Gallagher (ECAI, 1986)

Using Safe Approximations of Fixed Points for Analysis of Logic Programs. - Michael Codish; John P. Gallagher; Ehud Shapiro (META, 1988)

Specialisation of Prolog and FCP Programs Using Abstract Interpretation. - John P. Gallagher; Michael Codish; Ehud Shapiro (New Gener. Comput., 1988)

Specialisation of a Unification Algorithm. - D. Andre de Waal; John P. Gallagher (LOPSTR, 1991)

The Derivation of an Algorithm for Program Specialisation. - John P. Gallagher; Maurice Bruynooghe (New Gener. Comput., 1991)

Deletion of Redundant Unary Type Predicates from Logic Programs. - John P. Gallagher; D. Andre de Waal (LOPSTR, 1992)

Static Analysis for Logic Program Specification. - John P. Gallagher (WSA, 1992)

Tutorial on Specialisation of Logic Programs. - John P. Gallagher (PEPM, 1993)

Logic Program Specialisation With Deletion of Useless Clauses. - D. Andre de Waal; John P. Gallagher (ILPS, 1993)

The Applicability of Logic Program Analysis and Transformation to Theorem Proving. - D. Andre de Waal; John P. Gallagher (CADE, 1994)

Fast and Precise Regular Approximations of Logic Programs. - John P. Gallagher; D. Andre de Waal (ICLP, 1994)

A Transformation System for Definite Programs Based on Termination Analysis. - J. Cook; John P. Gallagher (LOPSTR, 1994)

Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types. - Emmanuil I. Marakakis; John P. Gallagher (LOPSTR, 1994)

Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. - Bern Martens; John P. Gallagher (ICLP, 1995)

Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions - Hüseyin Saglam; John P. Gallagher (PLILP, 1995)

Practical Model-Based Static Analysis for Definite Logic Programs. - John P. Gallagher; Dmitri Boulanger; Hüseyin Saglam (ILPS, 1995)

Regular Approximation of Computation Paths in Logic and Functional Languages. - John P. Gallagher; Laura Lafave (Dagstuhl Seminar on Partial Evaluation, 1996)

Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs. - Laura Lafave; John P. Gallagher (LOPSTR, 1997)

Constrained Regular Approximation of Logic Programs. - Hüseyin Saglam; John P. Gallagher (LOPSTR, 1997)

Analysis of Imperative Programs through Analysis of Constraint Logic Programs. - Julio C. Peralta; John P. Gallagher; Hüseyin Saglam (SAS, 1998)

The Role of Trace Abstractions in Program Specialization Algorithms. - John P. Gallagher; Laura Lafave (ACM Comput. Surv., 1998)

Extending the Power of Automatic Constraint-Based Partial Evaluators. - Laura Lafave; John P. Gallagher (ACM Comput. Surv., 1998)

Imperative Program Specialisation: An Approach Using CLP. - Julio C. Peralta; John P. Gallagher (LOPSTR, 1999)

An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework. - Germán Puebla; Manuel V. Hermenegildo; John P. Gallagher (PEPM, 1999)

Abductive reasoning with knowledge bases for context modelling. - Ahmed Guessoum; John P. Gallagher (Abduction, Belief and Context in Dialogue, 2000)

Using Regular Approximations for Generalisation During Partial Evalution. - John P. Gallagher; Julio C. Peralta (PEPM, 2000)

Regular Tree Languages as an Abstract Domain in Program Specialisation. - John P. Gallagher; Julio C. Peralta (High. Order Symb. Comput., 2001)

Whatever Happened to Meta-Programming? - John P. Gallagher (APPIA-GULP-PRODE, 2002)

Convex Hull Abstractions in Specialization of CLP Programs. - Julio C. Peralta; John P. Gallagher (LOPSTR, 2002)

Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. - John P. Gallagher; Germán Puebla (PADL, 2002)

Combining Norms to Prove Termination. - Samir Genaim; Michael Codish; John P. Gallagher; Vitaly Lagoon (VMCAI, 2002)

A Program Transformation for Backwards Analysis of Logic Programs. - John P. Gallagher (LOPSTR, 2003)

Abstract Domains Based on Regular Types. - John P. Gallagher; Kim S. Henriksen (ICLP, 2004)

Fully Automatic Binding-Time Analysis for Prolog. - Stephen-John Craig; John P. Gallagher; Michael Leuschel; Kim S. Henriksen (LOPSTR, 2004)

Regular types, modes and model checking (Invited Talk). - John P. Gallagher (WLPE, 2004)

Analysis and specialisation of a PIC processor. - Kim S. Henriksen; John P. Gallagher (SMC (2), 2004)

Techniques for Scaling Up Analyses Based on Pre-interpretations. - John P. Gallagher; Kim S. Henriksen; Gourinath Banda (ICLP, 2005)

Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates. - Elvira Albert; Germán Puebla; John P. Gallagher (LOPSTR, 2005)

Converting One Type-Based Abstract Domain to Another. - John P. Gallagher; Germán Puebla; Elvira Albert (LOPSTR, 2005)

Inference of Well-Typings for Logic Programs with Application to Termination Analysis. - Maurice Bruynooghe; John P. Gallagher; Wouter Van Humbeeck (SAS, 2005)

Abstract Interpretation of PIC Programs through Logic Programming. - Kim S. Henriksen; John P. Gallagher (SCAM, 2006)

Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation. - Elvira Albert; John P. Gallagher; Miguel Gómez-Zamalloa; Germán Puebla (LOPSTR, 2007)

Experiments with a Convex Polyhedral Analysis Tool for Logic Programs - Kim S. Henriksen; Gourinath Banda; John P. Gallagher (CoRR, 2007)

A Web-based Tool Combining Different Type Analyses - Kim S. Henriksen; John P. Gallagher (CoRR, 2007)

Termination analysis of logic programs through combination of type-based norms. - Maurice Bruynooghe; Michael Codish; John P. Gallagher; Samir Genaim; Wim Vanhoof (ACM Trans. Program. Lang. Syst., 2007)

Analysis of Linear Hybrid Systems in CLP. - Gourinath Banda; John P. Gallagher (LOPSTR, 2008)

From Monomorphic to Polymorphic Well-Typings and Beyond. - Tom Schrijvers; Maurice Bruynooghe; John P. Gallagher (LOPSTR, 2008)

Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation. - John P. Gallagher; Mads Rosendahl (LPAR, 2008)

Non-discriminating Arguments and Their Uses. - Henning Christiansen 001; John P. Gallagher (ICLP, 2009)

Type-based homeomorphic embedding for online termination. - Elvira Albert; John P. Gallagher; Miguel Gómez-Zamalloa; Germán Puebla (Inf. Process. Lett., 2009)

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation. - Gourinath Banda; John P. Gallagher (LPAR (Dakar), 2010)

Proceedings of the 19th Workshop on Logic-based methods in Programming Environments (WLPE 2009) - Rafael Caballero 001; John P. Gallagher (CoRR, 2010)

Editorial. - John P. Gallagher; Janis Voigtländer (High. Order Symb. Comput., 2010)

Frontmatter, Table of Contents, Preface, Conference Organization. - John P. Gallagher; Michael Gelfond (ICLP (Technical Communications), 2011)

Analysis of Logic Programs Using Regular Tree Languages - (Extended Abstract). - John P. Gallagher (LOPSTR, 2011)

Introduction to the 27th International Conference on Logic Programming Special Issue. - John P. Gallagher; Michael Gelfond (Theory Pract. Log. Program., 2011)

Analysis and Transformation Tools for Constrained Horn Clause Verification. - John P. Gallagher; Bishoksan Kafle (CoRR, 2014)

Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. - Bishoksan Kafle; John P. Gallagher (HCVS, 2014)

Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IR. - Umer Liqat; Kyriakos Georgiou; Steve Kerrison; Pedro López-García 001; John P. Gallagher; Manuel V. Hermenegildo; Kerstin Eder (FOPARA, 2015)

Tree Automata-Based Refinement with Application to Horn Clause Verification. - Bishoksan Kafle; John P. Gallagher (VMCAI, 2015)

An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata. - John P. Gallagher; Mai Ajspur; Bishoksan Kafle (CoRR, 2015)

Decomposition by tree dimension in Horn clause verification. - Bishoksan Kafle; John P. Gallagher; Pierre Ganty (VPT@ETAPS, 2015)

A Top-to-Bottom View: Energy Analysis for Mobile Application Source Code. - Xueliang Li 002; John P. Gallagher (CoRR, 2015)

Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. - Bishoksan Kafle; John P. Gallagher; José F. Morales 001 (CAV (1), 2016)

A Transformational Approach to Parametric Accumulated-Cost Static Profiling. - Rémy Haemmerlé; Pedro López-García 001; Umer Liqat; Maximiliano Klemen; John P. Gallagher; Manuel V. Hermenegildo (FLOPS, 2016)

Fine-Grained Energy Modeling for the Source Code of a Mobile Application. - Xueliang Li 002; John P. Gallagher (MobiQuitous, 2016)

A Source-Level Energy Optimization Framework for Mobile Applications. - Xueliang Li 002; John P. Gallagher (SCAM, 2016)

An Energy-Aware Programming Approach for Mobile Application Development Guided by a Fine-Grained Energy Model. - Xueliang Li 002; John P. Gallagher (CoRR, 2016)

Interpolant tree automata and their application in Horn clause verification. - Bishoksan Kafle; John P. Gallagher (VPT@ETAPS, 2016)

Solving non-linear Horn clauses using a linear Horn clause solver. - Bishoksan Kafle; John P. Gallagher; Pierre Ganty (HCVS@ETAPS, 2016)

ENTRA: Whole-systems energy transparency. - Kerstin Eder; John P. Gallagher; Pedro López-García 001; Henk L. Muller; Zorana Bankovic; Kyriakos Georgiou; Rémy Haemmerlé; Manuel V. Hermenegildo; Bishoksan Kafle; Steve Kerrison; Maja H. Kirkeby; Maximiliano Klemen; et al. (Microprocess. Microsystems, 2016)

Horn clause verification with convex polyhedral abstraction and tree automata-based refinement. - Bishoksan Kafle; John P. Gallagher (Comput. Lang. Syst. Struct., 2017)

Pre-proceedings of the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017). - Fabio Fioravanti; John P. Gallagher (CoRR, 2017)

Constraint specialisation in Horn clause verification. - Bishoksan Kafle; John P. Gallagher (Sci. Comput. Program., 2017)

Optimised determinisation and completion of finite tree automata. - John P. Gallagher; Mai Ajspur; Bishoksan Kafle (J. Log. Algebraic Methods Program., 2018)

Tree dimension in verification of constrained Horn clauses. - Bishoksan Kafle; John P. Gallagher; Pierre Ganty (Theory Pract. Log. Program., 2018)

An iterative approach to precondition inference using constrained Horn clauses. - Bishoksan Kafle; John P. Gallagher; Graeme Gange; Peter Schachte; Harald Søndergaard; Peter J. Stuckey (Theory Pract. Log. Program., 2018)

A General Framework for Static Cost Analysis of Parallel Logic Programs. - Maximiliano Klemen; Pedro López-García 001; John P. Gallagher; José F. Morales 001; Manuel V. Hermenegildo (LOPSTR, 2019)

Towards a General Framework for Static Cost Analysis of Parallel Logic Programs. - Maximiliano Klemen; Pedro López-García 001; John P. Gallagher; José F. Morales 001; Manuel V. Hermenegildo (CoRR, 2019)

Polyvariant Program Specialisation with Property-based Abstraction. - John P. Gallagher (VPT@Programming, 2019)

Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis. - Jesús J. Doménech; John P. Gallagher; Samir Genaim (Theory Pract. Log. Program., 2019)

Detecting and diagnosing energy issues for mobile applications. - Xueliang Li 002; Yuming Yang; Yepang Liu 001; John P. Gallagher; Kaishun Wu (ISSTA, 2020)

From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation. - John P. Gallagher; Manuel V. Hermenegildo; Bishoksan Kafle; Maximiliano Klemen; Pedro López-García 001; José F. Morales 001 (VPT/HCVS@ETAPS, 2020)

An Experiment Combining Specialization with Abstract Interpretation. - John P. Gallagher; Robert Glück (VPT/HCVS@ETAPS, 2020)

Preface. - Fabio Fioravanti; John P. Gallagher; Maurizio Proietti (Fundam. Informaticae, 2020)

An Approach to Estimating Energy Consumption of Web-based IT Systems. - Maja H. Kirkeby; John P. Gallagher; Bent Thomsen (CERCIRAS, 2021)

Regular Path Clauses and Their Application in Solving Loops. - Bishoksan Kafle; John P. Gallagher; Manuel V. Hermenegildo; Maximiliano Klemen; Pedro López-García 001; José F. Morales 001 (HCVS@ETAPS, 2021)

Preface. - John P. Gallagher; Martin Sulzmann (Sci. Comput. Program., 2021)

Analysis and Transformation of Constrained Horn Clauses for Program Verification. - Emanuele De Angelis; Fabio Fioravanti; John P. Gallagher; Manuel V. Hermenegildo; Alberto Pettorossi; Maurizio Proietti (Theory Pract. Log. Program., 2022)

Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation. - John P. Gallagher; Manuel V. Hermenegildo; José F. Morales 001; Pedro López-García 001 (LOPSTR, 2023)

Combatting Energy Issues for Mobile Applications. - Xueliang Li 002; Junyang Chen 001; Yepang Liu 001; Kaishun Wu; John P. Gallagher (ACM Trans. Softw. Eng. Methodol., 2023)