John P. Gallagher

According to our database, John P. Gallagher authored at least 90 papers between 1986 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Combatting Energy Issues for Mobile Applications.

Xueliang Li, Junyang Chen, Yepang Liu, Kaishun Wu, John P. Gallagher

ACM Trans. Softw. Eng. Methodol., January, 2023

Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation.

John P. Gallagher, Manuel V. Hermenegildo, José F. Morales, Pedro López-García

Proceedings of the Logic-Based Program Synthesis and Transformation, 2023

2022

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

2021

Preface.

John P. Gallagher, Martin Sulzmann

Sci. Comput. Program., 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, José F. Morales

Proceedings of the Proceedings 8th Workshop on Horn Clauses for Verification and Synthesis, 2021

2020

Preface.

Fabio Fioravanti, John P. Gallagher, Maurizio Proietti

Fundam. Informaticae, 2020

An Experiment Combining Specialization with Abstract Interpretation.

John P. Gallagher, Robert Glück

Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 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, José F. Morales

Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

Detecting and diagnosing energy issues for mobile applications.

Xueliang Li, Yuming Yang, Yepang Liu, John P. Gallagher, Kaishun Wu

Proceedings of the ISSTA '20: 29th ACM SIGSOFT International Symposium on Software Testing and Analysis, 2020

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

Polyvariant Program Specialisation with Property-based Abstraction.

John P. Gallagher

Proceedings of the Proceedings Seventh International Workshop on Verification and Program Transformation, 2019

Towards a General Framework for Static Cost Analysis of Parallel Logic Programs.

Maximiliano Klemen, Pedro López-García, John P. Gallagher, José F. Morales, Manuel V. Hermenegildo

CoRR, 2019

A General Framework for Static Cost Analysis of Parallel Logic Programs.

Maximiliano Klemen, Pedro López-García, John P. Gallagher, José F. Morales, Manuel V. Hermenegildo

Proceedings of the Logic-Based Program Synthesis and Transformation, 2019

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

Tree dimension in verification of constrained Horn clauses.

Bishoksan Kafle, John P. Gallagher, Pierre Ganty

Theory Pract. Log. Program., 2018

Optimised determinisation and completion of finite tree automata.

John P. Gallagher, Mai Ajspur, Bishoksan Kafle

J. Log. Algebraic Methods Program., 2018

2017

Constraint specialisation in Horn clause verification.

Bishoksan Kafle, John P. Gallagher

Sci. Comput. Program., 2017

Pre-proceedings of the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017).

Fabio Fioravanti, John P. Gallagher

CoRR, 2017

Horn clause verification with convex polyhedral abstraction and tree automata-based refinement.

Bishoksan Kafle, John P. Gallagher

Comput. Lang. Syst. Struct., 2017

2016

ENTRA: Whole-systems energy transparency.

Kerstin Eder, John P. Gallagher, Pedro López-García, Henk L. Muller, Zorana Bankovic, Kyriakos Georgiou, Rémy Haemmerlé, Manuel V. Hermenegildo, Bishoksan Kafle, Steve Kerrison, Maja H. Kirkeby, Maximiliano Klemen, Xueliang Li, Umer Liqat, Jeremy Morse, Morten Rhiger, Mads Rosendahl

Microprocess. Microsystems, 2016

Solving non-linear Horn clauses using a linear Horn clause solver.

Bishoksan Kafle, John P. Gallagher, Pierre Ganty

Proceedings of the Proceedings 3rd Workshop on Horn Clauses for Verification and Synthesis, 2016

Interpolant tree automata and their application in Horn clause verification.

Bishoksan Kafle, John P. Gallagher

Proceedings of the Fourth International Workshop on Verification and Program Transformation, 2016

An Energy-Aware Programming Approach for Mobile Application Development Guided by a Fine-Grained Energy Model.

Xueliang Li, John P. Gallagher

CoRR, 2016

A Source-Level Energy Optimization Framework for Mobile Applications.

Xueliang Li, John P. Gallagher

Proceedings of the 16th IEEE International Working Conference on Source Code Analysis and Manipulation, 2016

Fine-Grained Energy Modeling for the Source Code of a Mobile Application.

Xueliang Li, John P. Gallagher

Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, 2016

A Transformational Approach to Parametric Accumulated-Cost Static Profiling.

Rémy Haemmerlé, Pedro López-García, Umer Liqat, Maximiliano Klemen, John P. Gallagher, Manuel V. Hermenegildo

Proceedings of the Functional and Logic Programming - 13th International Symposium, 2016

Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata.

Bishoksan Kafle, John P. Gallagher, José F. Morales

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

A Top-to-Bottom View: Energy Analysis for Mobile Application Source Code.

Xueliang Li, John P. Gallagher

CoRR, 2015

Decomposition by tree dimension in Horn clause verification.

Bishoksan Kafle, John P. Gallagher, Pierre Ganty

Proceedings of the Third International Workshop on Verification and Program Transformation, 2015

An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata.

John P. Gallagher, Mai Ajspur, Bishoksan Kafle

CoRR, 2015

Tree Automata-Based Refinement with Application to Horn Clause Verification.

Bishoksan Kafle, John P. Gallagher

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IR.

Umer Liqat, Kyriakos Georgiou, Steve Kerrison, Pedro López-García, John P. Gallagher, Manuel V. Hermenegildo, Kerstin Eder

Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2015

2014

Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification.

Bishoksan Kafle, John P. Gallagher

Proceedings of the Proceedings First Workshop on Horn Clauses for Verification and Synthesis, 2014

Analysis and Transformation Tools for Constrained Horn Clause Verification.

John P. Gallagher, Bishoksan Kafle

CoRR, 2014

2011

Introduction to the 27th International Conference on Logic Programming Special Issue.

John P. Gallagher, Michael Gelfond

Theory Pract. Log. Program., 2011

Analysis of Logic Programs Using Regular Tree Languages - (Extended Abstract).

John P. Gallagher

Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Frontmatter, Table of Contents, Preface, Conference Organization.

John P. Gallagher, Michael Gelfond

Proceedings of the Technical Communications of the 27th International Conference on Logic Programming, 2011

2010

Editorial.

John P. Gallagher, Janis Voigtländer

High. Order Symb. Comput., 2010

Proceedings of the 19th Workshop on Logic-based methods in Programming Environments (WLPE 2009)

Rafael Caballero, John P. Gallagher

CoRR, 2010

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation.

Gourinath Banda, John P. Gallagher

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Type-based homeomorphic embedding for online termination.

Elvira Albert, John P. Gallagher, Miguel Gómez-Zamalloa, Germán Puebla

Inf. Process. Lett., 2009

Non-discriminating Arguments and Their Uses.

Henning Christiansen, John P. Gallagher

Proceedings of the Logic Programming, 25th International Conference, 2009

2008

Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation.

John P. Gallagher, Mads Rosendahl

Proceedings of the Logic for Programming, 2008

From Monomorphic to Polymorphic Well-Typings and Beyond.

Tom Schrijvers, Maurice Bruynooghe, John P. Gallagher

Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

Analysis of Linear Hybrid Systems in CLP.

Gourinath Banda, John P. Gallagher

Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

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

A Web-based Tool Combining Different Type Analyses

Kim S. Henriksen, John P. Gallagher

CoRR, 2007

Experiments with a Convex Polyhedral Analysis Tool for Logic Programs

Kim S. Henriksen, Gourinath Banda, John P. Gallagher

CoRR, 2007

Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation.

Elvira Albert, John P. Gallagher, Miguel Gómez-Zamalloa, Germán Puebla

Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

2006

Abstract Interpretation of PIC Programs through Logic Programming.

Kim S. Henriksen, John P. Gallagher

Proceedings of the Sixth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2006), 2006

2005

Inference of Well-Typings for Logic Programs with Application to Termination Analysis.

Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck

Proceedings of the Static Analysis, 12th International Symposium, 2005

Converting One Type-Based Abstract Domain to Another.

John P. Gallagher, Germán Puebla, Elvira Albert

Proceedings of the Logic Based Program Synthesis and Transformation, 2005

Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates.

Elvira Albert, Germán Puebla, John P. Gallagher

Proceedings of the Logic Based Program Synthesis and Transformation, 2005

Techniques for Scaling Up Analyses Based on Pre-interpretations.

John P. Gallagher, Kim S. Henriksen, Gourinath Banda

Proceedings of the Logic Programming, 21st International Conference, 2005

2004

Analysis and specialisation of a PIC processor.

Kim S. Henriksen, John P. Gallagher

Proceedings of the IEEE International Conference on Systems, 2004

Regular types, modes and model checking (Invited Talk).

John P. Gallagher

Proceedings of the 14th International Workshop on Logic Programming Environments, 2004

Fully Automatic Binding-Time Analysis for Prolog.

Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen

Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Abstract Domains Based on Regular Types.

John P. Gallagher, Kim S. Henriksen

Proceedings of the Logic Programming, 20th International Conference, 2004

2003

A Program Transformation for Backwards Analysis of Logic Programs.

John P. Gallagher

Proceedings of the Logic Based Program Synthesis and Transformation, 2003

2002

Combining Norms to Prove Termination.

Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon

Proceedings of the Verification, 2002

Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs.

John P. Gallagher, Germán Puebla

Proceedings of the Practical Aspects of Declarative Languages, 4th International Symposium, 2002

Convex Hull Abstractions in Specialization of CLP Programs.

Julio C. Peralta, John P. Gallagher

Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Whatever Happened to Meta-Programming?

John P. Gallagher

Proceedings of the AGP 2002: Proceedings of the Joint Conference on Declarative Programming, 2002

2001

Regular Tree Languages as an Abstract Domain in Program Specialisation.

John P. Gallagher, Julio C. Peralta

High. Order Symb. Comput., 2001

2000

Using Regular Approximations for Generalisation During Partial Evalution.

John P. Gallagher, Julio C. Peralta

Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00), 2000

Abductive reasoning with knowledge bases for context modelling.

Ahmed Guessoum, John P. Gallagher

Proceedings of the Abduction, Belief and Context in Dialogue, 2000

1999

An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework.

Germán Puebla, Manuel V. Hermenegildo, John P. Gallagher

Proceedings of the 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, 1999

Imperative Program Specialisation: An Approach Using CLP.

Julio C. Peralta, John P. Gallagher

Proceedings of the Logic Programming Synthesis and Transformation, 1999

1998

Extending the Power of Automatic Constraint-Based Partial Evaluators.

Laura Lafave, John P. Gallagher

ACM Comput. Surv., 1998

The Role of Trace Abstractions in Program Specialization Algorithms.

John P. Gallagher, Laura Lafave

ACM Comput. Surv., 1998

Analysis of Imperative Programs through Analysis of Constraint Logic Programs.

Julio C. Peralta, John P. Gallagher, Hüseyin Saglam

Proceedings of the Static Analysis, 5th International Symposium, 1998

1997

Constrained Regular Approximation of Logic Programs.

Hüseyin Saglam, John P. Gallagher

Proceedings of the Logic Programming Synthesis and Transformation, 1997

Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs.

Laura Lafave, John P. Gallagher

Proceedings of the Logic Programming Synthesis and Transformation, 1997

1996

Regular Approximation of Computation Paths in Logic and Functional Languages.

John P. Gallagher, Laura Lafave

Proceedings of the Partial Evaluation, International Seminar, 1996

1995

Practical Model-Based Static Analysis for Definite Logic Programs.

John P. Gallagher, Dmitri Boulanger, Hüseyin Saglam

Proceedings of the Logic Programming, 1995

Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions

Hüseyin Saglam, John P. Gallagher

Proceedings of the Programming Languages: Implementations, 1995

Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance.

Bern Martens, John P. Gallagher

Proceedings of the Logic Programming, 1995

1994

Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types.

Emmanuil I. Marakakis, John P. Gallagher

Proceedings of the Logic Programming Synthesis and Transformation, 1994

A Transformation System for Definite Programs Based on Termination Analysis.

J. Cook, John P. Gallagher

Proceedings of the Logic Programming Synthesis and Transformation, 1994

Fast and Precise Regular Approximations of Logic Programs.

John P. Gallagher, D. Andre de Waal

Proceedings of the Logic Programming, 1994

The Applicability of Logic Program Analysis and Transformation to Theorem Proving.

D. Andre de Waal, John P. Gallagher

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993

Logic Program Specialisation With Deletion of Useless Clauses.

D. Andre de Waal, John P. Gallagher

Proceedings of the Logic Programming, 1993

Tutorial on Specialisation of Logic Programs.

John P. Gallagher

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1993

1992

Static Analysis for Logic Program Specification.

John P. Gallagher

Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

Deletion of Redundant Unary Type Predicates from Logic Programs.

John P. Gallagher, D. Andre de Waal

Proceedings of the Logic Program Synthesis and Transformation, 1992

1991

The Derivation of an Algorithm for Program Specialisation.

John P. Gallagher, Maurice Bruynooghe

New Gener. Comput., 1991

Specialisation of a Unification Algorithm.

D. Andre de Waal, John P. Gallagher

Proceedings of the Logic Program Synthesis and Transformation, 1991

1988

Specialisation of Prolog and FCP Programs Using Abstract Interpretation.

John P. Gallagher, Michael Codish, Ehud Shapiro

New Gener. Comput., 1988

Using Safe Approximations of Fixed Points for Analysis of Logic Programs.

Michael Codish, John P. Gallagher, Ehud Shapiro

Proceedings of the Meta-Programming in Logic Programming, 1988

1986

Transforming Logic Programs by Specialising Interpreters.

John P. Gallagher

Proceedings of the Advances in Artificial Intelligence II, 1986