John P. Gallagher

Orcid: 0000-0001-6984-7419

Affiliations:
  • Roskilde University, Denmark


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Combatting Energy Issues for Mobile Applications.
ACM Trans. Softw. Eng. Methodol., January, 2023

Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2023

2022
Analysis and Transformation of Constrained Horn Clauses for Program Verification.
Theory Pract. Log. Program., 2022

2021
Preface.
Sci. Comput. Program., 2021

Regular Path Clauses and Their Application in Solving Loops.
Proceedings of the Proceedings 8th Workshop on Horn Clauses for Verification and Synthesis, 2021

An Approach to Estimating Energy Consumption of Web-based IT Systems.
Proceedings of the First Workshop on Connecting Education and Research Communities for an Innovative Resource Aware Society (CERCIRAS), 2021

2020
Preface.
Fundam. Informaticae, 2020

An Experiment Combining Specialization with Abstract Interpretation.
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.
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.
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.
Theory Pract. Log. Program., 2019

Polyvariant Program Specialisation with Property-based Abstraction.
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.
CoRR, 2019

A General Framework for Static Cost Analysis of Parallel Logic Programs.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2019

2018
An iterative approach to precondition inference using constrained Horn clauses.
Theory Pract. Log. Program., 2018

Tree dimension in verification of constrained Horn clauses.
Theory Pract. Log. Program., 2018

Optimised determinisation and completion of finite tree automata.
J. Log. Algebraic Methods Program., 2018

2017
Constraint specialisation in Horn clause verification.
Sci. Comput. Program., 2017

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

Horn clause verification with convex polyhedral abstraction and tree automata-based refinement.
Comput. Lang. Syst. Struct., 2017

2016
ENTRA: Whole-systems energy transparency.
Microprocess. Microsystems, 2016

Solving non-linear Horn clauses using a linear Horn clause solver.
Proceedings of the Proceedings 3rd Workshop on Horn Clauses for Verification and Synthesis, 2016

Interpolant tree automata and their application in Horn clause verification.
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.
CoRR, 2016

A Source-Level Energy Optimization Framework for Mobile Applications.
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.
Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, 2016

A Transformational Approach to Parametric Accumulated-Cost Static Profiling.
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.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

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

Decomposition by tree dimension in Horn clause verification.
Proceedings of the Third International Workshop on Verification and Program Transformation, 2015

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

Tree Automata-Based Refinement with Application to Horn Clause Verification.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IR.
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.
Proceedings of the Proceedings First Workshop on Horn Clauses for Verification and Synthesis, 2014

Analysis and Transformation Tools for Constrained Horn Clause Verification.
CoRR, 2014

2011
Introduction to the 27th International Conference on Logic Programming Special Issue.
Theory Pract. Log. Program., 2011

Analysis of Logic Programs Using Regular Tree Languages - (Extended Abstract).
Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Frontmatter, Table of Contents, Preface, Conference Organization.
Proceedings of the Technical Communications of the 27th International Conference on Logic Programming, 2011

2010
Editorial.
High. Order Symb. Comput., 2010

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

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
Type-based homeomorphic embedding for online termination.
Inf. Process. Lett., 2009

Non-discriminating Arguments and Their Uses.
Proceedings of the Logic Programming, 25th International Conference, 2009

2008
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation.
Proceedings of the Logic for Programming, 2008

From Monomorphic to Polymorphic Well-Typings and Beyond.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

Analysis of Linear Hybrid Systems in CLP.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

2007
Termination analysis of logic programs through combination of type-based norms.
ACM Trans. Program. Lang. Syst., 2007

A Web-based Tool Combining Different Type Analyses
CoRR, 2007

Experiments with a Convex Polyhedral Analysis Tool for Logic Programs
CoRR, 2007

Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

2006
Abstract Interpretation of PIC Programs through Logic Programming.
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.
Proceedings of the Static Analysis, 12th International Symposium, 2005

Converting One Type-Based Abstract Domain to Another.
Proceedings of the Logic Based Program Synthesis and Transformation, 2005

Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates.
Proceedings of the Logic Based Program Synthesis and Transformation, 2005

Techniques for Scaling Up Analyses Based on Pre-interpretations.
Proceedings of the Logic Programming, 21st International Conference, 2005

2004
Analysis and specialisation of a PIC processor.
Proceedings of the IEEE International Conference on Systems, 2004

Regular types, modes and model checking (Invited Talk).
Proceedings of the 14th International Workshop on Logic Programming Environments, 2004

Fully Automatic Binding-Time Analysis for Prolog.
Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Abstract Domains Based on Regular Types.
Proceedings of the Logic Programming, 20th International Conference, 2004

2003
A Program Transformation for Backwards Analysis of Logic Programs.
Proceedings of the Logic Based Program Synthesis and Transformation, 2003

2002
Combining Norms to Prove Termination.
Proceedings of the Verification, 2002

Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs.
Proceedings of the Practical Aspects of Declarative Languages, 4th International Symposium, 2002

Convex Hull Abstractions in Specialization of CLP Programs.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Whatever Happened to Meta-Programming?
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.
High. Order Symb. Comput., 2001

2000
Using Regular Approximations for Generalisation During Partial Evalution.
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.
Proceedings of the Abduction, Belief and Context in Dialogue, 2000

1999
An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework.
Proceedings of the 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, 1999

Imperative Program Specialisation: An Approach Using CLP.
Proceedings of the Logic Programming Synthesis and Transformation, 1999

1998
Extending the Power of Automatic Constraint-Based Partial Evaluators.
ACM Comput. Surv., 1998

The Role of Trace Abstractions in Program Specialization Algorithms.
ACM Comput. Surv., 1998

Analysis of Imperative Programs through Analysis of Constraint Logic Programs.
Proceedings of the Static Analysis, 5th International Symposium, 1998

1997
Constrained Regular Approximation of Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1997

Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1997

1996
Regular Approximation of Computation Paths in Logic and Functional Languages.
Proceedings of the Partial Evaluation, International Seminar, 1996

1995
Practical Model-Based Static Analysis for Definite Logic Programs.
Proceedings of the Logic Programming, 1995

Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions
Proceedings of the Programming Languages: Implementations, 1995

Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance.
Proceedings of the Logic Programming, 1995

1994
Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types.
Proceedings of the Logic Programming Synthesis and Transformation, 1994

A Transformation System for Definite Programs Based on Termination Analysis.
Proceedings of the Logic Programming Synthesis and Transformation, 1994

Fast and Precise Regular Approximations of Logic Programs.
Proceedings of the Logic Programming, 1994

The Applicability of Logic Program Analysis and Transformation to Theorem Proving.
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.
Proceedings of the Logic Programming, 1993

Tutorial on Specialisation of Logic Programs.
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1993

1992
Static Analysis for Logic Program Specification.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

Deletion of Redundant Unary Type Predicates from Logic Programs.
Proceedings of the Logic Program Synthesis and Transformation, 1992

1991
The Derivation of an Algorithm for Program Specialisation.
New Gener. Comput., 1991

Specialisation of a Unification Algorithm.
Proceedings of the Logic Program Synthesis and Transformation, 1991

1988
Specialisation of Prolog and FCP Programs Using Abstract Interpretation.
New Gener. Comput., 1988

Using Safe Approximations of Fixed Points for Analysis of Logic Programs.
Proceedings of the Meta-Programming in Logic Programming, 1988

1986
Transforming Logic Programs by Specialising Interpreters.
Proceedings of the Advances in Artificial Intelligence II, 1986


  Loading...