default search action
John P. Gallagher
Person information
- affiliation: Roskilde University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j20]Xueliang Li
, Junyang Chen, Yepang Liu, Kaishun Wu, John P. Gallagher
Combatting Energy Issues for Mobile Applications. ACM Trans. Softw. Eng. Methodol. 32(1): 13:1-13:44 (2023) - [c63]John P. Gallagher
Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation. LOPSTR 2023: 28-38 - [e9]Pedro López-García
Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems - Essays Dedicated to Manuel Hermenegildo on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 13160, Springer 2023, ISBN 978-3-031-31475-9 [contents] - 2022
- [j19]Emanuele De Angelis
Analysis and Transformation of Constrained Horn Clauses for Program Verification. Theory Pract. Log. Program. 22(6): 974-1042 (2022) - 2021
- [j18]John P. Gallagher
Preface. Sci. Comput. Program. 202: 102577 (2021) - [c62]Maja H. Kirkeby, John P. Gallagher, Bent Thomsen:
An Approach to Estimating Energy Consumption of Web-based IT Systems. CERCIRAS 2021 - [c61]Bishoksan Kafle, John P. Gallagher
Regular Path Clauses and Their Application in Solving Loops. HCVS@ETAPS 2021: 22-35 - [i17]Emanuele De Angelis, Fabio Fioravanti, John P. Gallagher, Manuel V. Hermenegildo, Alberto Pettorossi, Maurizio Proietti:
Analysis and Transformation of Constrained Horn Clauses for Program Verification. CoRR abs/2108.00739 (2021) - 2020
- [j17]Fabio Fioravanti
Preface. Fundam. Informaticae 173(4) (2020) - [c60]Xueliang Li, Yuming Yang, Yepang Liu, John P. Gallagher
Detecting and diagnosing energy issues for mobile applications. ISSTA 2020: 115-127 - [c59]John P. Gallagher
From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation. VPT/HCVS@ETAPS 2020: 50-64 - [c58]John P. Gallagher
An Experiment Combining Specialization with Abstract Interpretation. VPT/HCVS@ETAPS 2020: 155-158
2010 – 2019
- 2019
- [j16]Jesús J. Doménech
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis. Theory Pract. Log. Program. 19(5-6): 990-1005 (2019) - [c57]Maximiliano Klemen
A General Framework for Static Cost Analysis of Parallel Logic Programs. LOPSTR 2019: 19-35 - [c56]John P. Gallagher
Polyvariant Program Specialisation with Property-based Abstraction. VPT@Programming 2019: 34-48 - [i16]Xueliang Li, Yuming Yang, Yepang Liu, John P. Gallagher, Kaishun Wu:
Detecting and Diagnosing Energy Issues for Mobile Applications. CoRR abs/1901.01062 (2019) - [i15]Jesús J. Doménech, John P. Gallagher, Samir Genaim:
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis. CoRR abs/1907.12345 (2019) - [i14]Maximiliano Klemen, Pedro López-García, John P. Gallagher, José F. Morales, Manuel V. Hermenegildo:
Towards a General Framework for Static Cost Analysis of Parallel Logic Programs. CoRR abs/1907.13272 (2019) - 2018
- [j15]John P. Gallagher
Optimised determinisation and completion of finite tree automata. J. Log. Algebraic Methods Program. 95: 1-16 (2018) - [j14]Bishoksan Kafle, John P. Gallagher
Tree dimension in verification of constrained Horn clauses. Theory Pract. Log. Program. 18(2): 224-251 (2018) - [j13]Bishoksan Kafle
An iterative approach to precondition inference using constrained Horn clauses. Theory Pract. Log. Program. 18(3-4): 553-570 (2018) - [e8]John P. Gallagher, Martin Sulzmann:
Functional and Logic Programming - 14th International Symposium, FLOPS 2018, Nagoya, Japan, May 9-11, 2018, Proceedings. Lecture Notes in Computer Science 10818, Springer 2018, ISBN 978-3-319-90685-0 [contents] - [e7]Fabio Fioravanti, John P. Gallagher
Logic-Based Program Synthesis and Transformation - 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10855, Springer 2018, ISBN 978-3-319-94459-3 [contents] - [e6]John P. Gallagher, Rob van Glabbeek, Wendelin Serwe:
Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation, MARS/VPT@ETAPS 2018, Thessaloniki, Greece, 20th April 2018. EPTCS 268, 2018 [contents] - [i13]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Tree dimension in verification of constrained Horn clauses. CoRR abs/1803.01448 (2018) - [i12]Bishoksan Kafle, John P. Gallagher, Graeme Gange, Peter Schachte, Harald Søndergaard
An iterative approach to precondition inference using constrained Horn clauses. CoRR abs/1804.05989 (2018) - 2017
- [j12]Bishoksan Kafle, John P. Gallagher
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement. Comput. Lang. Syst. Struct. 47: 2-18 (2017) - [j11]Bishoksan Kafle
Constraint specialisation in Horn clause verification. Sci. Comput. Program. 137: 125-140 (2017) - [i11]Fabio Fioravanti, John P. Gallagher:
Pre-proceedings of the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017). CoRR abs/1708.07854 (2017) - 2016
- [j10]Kerstin Eder, John P. Gallagher
ENTRA: Whole-systems energy transparency. Microprocess. Microsystems 47: 278-286 (2016) - [c55]Bishoksan Kafle, John P. Gallagher
Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. CAV (1) 2016: 261-268 - [c54]Rémy Haemmerlé, Pedro López-García
A Transformational Approach to Parametric Accumulated-Cost Static Profiling. FLOPS 2016: 163-180 - [c53]Xueliang Li, John P. Gallagher
Fine-Grained Energy Modeling for the Source Code of a Mobile Application. MobiQuitous 2016: 180-189 - [c52]Xueliang Li, John P. Gallagher
A Source-Level Energy Optimization Framework for Mobile Applications. SCAM 2016: 31-40 - [c51]Bishoksan Kafle, John P. Gallagher
Solving non-linear Horn clauses using a linear Horn clause solver. HCVS@ETAPS 2016: 33-48 - [c50]Bishoksan Kafle, John P. Gallagher
Interpolant tree automata and their application in Horn clause verification. VPT@ETAPS 2016: 104-117 - [e5]John P. Gallagher
Proceedings 3rd Workshop on Horn Clauses for Verification and Synthesis, HCVS@ETAPS 2016, Eindhoven, The Netherlands, 3rd April 2016. EPTCS 219, 2016 [contents] - [i10]Xueliang Li, John P. Gallagher:
An Energy-Aware Programming Approach for Mobile Application Development Guided by a Fine-Grained Energy Model. CoRR abs/1605.05234 (2016) - [i9]Kerstin Eder, John P. Gallagher, Pedro López-García, Henk L. Muller, Zorana Bankovic, Kyriakos Georgiou
ENTRA: Whole-Systems Energy Transparency. CoRR abs/1606.04074 (2016) - [i8]Xueliang Li, John P. Gallagher:
A Source-level Energy Optimization Framework for Mobile Applications. CoRR abs/1608.05248 (2016) - 2015
- [c49]Umer Liqat, Kyriakos Georgiou
Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IR. FOPARA 2015: 81-100 - [c48]Bishoksan Kafle, John P. Gallagher
Constraint Specialisation in Horn Clause Verification. PEPM 2015: 85-90 - [c47]Bishoksan Kafle, John P. Gallagher
Tree Automata-Based Refinement with Application to Horn Clause Verification. VMCAI 2015: 209-226 - [c46]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Decomposition by tree dimension in Horn clause verification. VPT@ETAPS 2015: 1-14 - [i7]Xueliang Li, John P. Gallagher:
A Top-to-Bottom View: Energy Analysis for Mobile Application Source Code. CoRR abs/1510.04165 (2015) - [i6]Umer Liqat, Kyriakos Georgiou
Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IR. CoRR abs/1511.01413 (2015) - [i5]John P. Gallagher, Mai Ajspur, Bishoksan Kafle:
An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata. CoRR abs/1511.03595 (2015) - 2014
- [c45]Bishoksan Kafle, John P. Gallagher
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. HCVS 2014: 53-67 - [i4]John P. Gallagher, Bishoksan Kafle:
Analysis and Transformation Tools for Constrained Horn Clause Verification. CoRR abs/1405.3883 (2014) - 2011
- [j9]John P. Gallagher
Introduction to the 27th International Conference on Logic Programming Special Issue. Theory Pract. Log. Program. 11(4-5): 429-432 (2011) - [c44]John P. Gallagher, Michael Gelfond
Frontmatter, Table of Contents, Preface, Conference Organization. ICLP (Technical Communications) 2011 - [c43]John P. Gallagher:
Analysis of Logic Programs Using Regular Tree Languages - (Extended Abstract). LOPSTR 2011: 1-3 - [e4]John P. Gallagher, Michael Gelfond:
Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011, July 6-10, 2011, Lexington, Kentucky, USA. LIPIcs 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2011, ISBN 978-3-939897-31-6 [contents] - 2010
- [j8]John P. Gallagher
Editorial. High. Order Symb. Comput. 23(3): 273-274 (2010) - [c42]Gourinath Banda, John P. Gallagher:
Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation. LPAR (Dakar) 2010: 27-45 - [e3]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, ISBN 978-1-60558-727-1 [contents] - [i3]Rafael Caballero, John P. Gallagher:
Proceedings of the 19th Workshop on Logic-based methods in Programming Environments (WLPE 2009). CoRR abs/1002.4535 (2010)
2000 – 2009
- 2009
- [j7]Elvira Albert, John P. Gallagher
Type-based homeomorphic embedding for online termination. Inf. Process. Lett. 109(15): 879-886 (2009) - [c41]Henning Christiansen
Non-discriminating Arguments and Their Uses. ICLP 2009: 55-69 - 2008
- [c40]Gourinath Banda, John P. Gallagher:
Analysis of Linear Hybrid Systems in CLP. LOPSTR 2008: 55-70 - [c39]Tom Schrijvers
From Monomorphic to Polymorphic Well-Typings and Beyond. LOPSTR 2008: 152-167 - [c38]John P. Gallagher, Mads Rosendahl:
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation. LPAR 2008: 682-696 - 2007
- [j6]Maurice Bruynooghe, Michael Codish
Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst. 29(2): 10 (2007) - [c37]Elvira Albert, John P. Gallagher, Miguel Gómez-Zamalloa
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation. LOPSTR 2007: 23-42 - [i2]Kim S. Henriksen, Gourinath Banda, John P. Gallagher:
Experiments with a Convex Polyhedral Analysis Tool for Logic Programs. CoRR abs/0712.2737 (2007) - [i1]Kim S. Henriksen, John P. Gallagher:
A Web-based Tool Combining Different Type Analyses. CoRR abs/cs/0701110 (2007) - 2006
- [c36]Kim S. Henriksen, John P. Gallagher:
Abstract Interpretation of PIC Programs through Logic Programming. SCAM 2006: 184-196 - 2005
- [c35]John P. Gallagher, Kim S. Henriksen, Gourinath Banda:
Techniques for Scaling Up Analyses Based on Pre-interpretations. ICLP 2005: 280-296 - [c34]Elvira Albert, Germán Puebla, John P. Gallagher:
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates. LOPSTR 2005: 115-132 - [c33]John P. Gallagher, Germán Puebla, Elvira Albert:
Converting One Type-Based Abstract Domain to Another. LOPSTR 2005: 147-162 - [c32]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
- [c31]John P. Gallagher, Kim S. Henriksen:
Abstract Domains Based on Regular Types. ICLP 2004: 27-42 - [c30]Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen:
Fully Automatic Binding-Time Analysis for Prolog. LOPSTR 2004: 53-68 - [c29]John P. Gallagher:
Regular types, modes and model checking (Invited Talk). WLPE 2004 - [c28]Kim S. Henriksen, John P. Gallagher:
Analysis and specialisation of a PIC processor. SMC (2) 2004: 1131-1135 - 2003
- [c27]John P. Gallagher:
A Program Transformation for Backwards Analysis of Logic Programs. LOPSTR 2003: 92-105 - 2002
- [c26]John P. Gallagher:
Whatever Happened to Meta-Programming? APPIA-GULP-PRODE 2002: 1 - [c25]Julio C. Peralta, John P. Gallagher
Convex Hull Abstractions in Specialization of CLP Programs. LOPSTR 2002: 90-108 - [c24]John P. Gallagher
Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. PADL 2002: 243-261 - [c23]Samir Genaim
Combining Norms to Prove Termination. VMCAI 2002: 126-138 - 2001
- [j5]John P. Gallagher
Regular Tree Languages as an Abstract Domain in Program Specialisation. High. Order Symb. Comput. 14(2-3): 143-172 (2001) - 2000
- [c22]John P. Gallagher, Julio C. Peralta:
Using Regular Approximations for Generalisation During Partial Evalution. PEPM 2000: 44-51 - [p1]Ahmed Guessoum, John P. Gallagher:
Abductive reasoning with knowledge bases for context modelling. Abduction, Belief and Context in Dialogue 2000: 413-428
1990 – 1999
- 1999
- [c21]Julio C. Peralta, John P. Gallagher
Imperative Program Specialisation: An Approach Using CLP. LOPSTR 1999: 102-117 - [c20]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
- [j4]John P. Gallagher
The Role of Trace Abstractions in Program Specialization Algorithms. ACM Comput. Surv. 30(3es): 12 (1998) - [j3]Laura Lafave, John P. Gallagher:
Extending the Power of Automatic Constraint-Based Partial Evaluators. ACM Comput. Surv. 30(3es): 15 (1998) - [c19]Julio C. Peralta, John P. Gallagher
Analysis of Imperative Programs through Analysis of Constraint Logic Programs. SAS 1998: 246-261 - 1997
- [c18]Laura Lafave, John P. Gallagher
Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs. LOPSTR 1997: 168-188 - [c17]Hüseyin Saglam, John P. Gallagher
Constrained Regular Approximation of Logic Programs. LOPSTR 1997: 282-299 - [e2]John P. Gallagher:
Logic Programming Synthesis and Transformation, 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings. Lecture Notes in Computer Science 1207, Springer 1997, ISBN 3-540-62718-9 [contents] - [e1]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, ISBN 0-89791-917-3 [contents] - 1996
- [c16]John P. Gallagher
Regular Approximation of Computation Paths in Logic and Functional Languages. Dagstuhl Seminar on Partial Evaluation 1996: 115-136 - 1995
- [c15]Bern Martens, John P. Gallagher:
Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. ICLP 1995: 597-611 - [c14]Hüseyin Saglam, John P. Gallagher
Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions. PLILP 1995: 461-462 - [c13]John P. Gallagher, Dmitri Boulanger, Hüseyin Saglam:
Practical Model-Based Static Analysis for Definite Logic Programs. ILPS 1995: 351-365 - 1994
- [c12]D. Andre de Waal, John P. Gallagher
The Applicability of Logic Program Analysis and Transformation to Theorem Proving. CADE 1994: 207-221 - [c11]John P. Gallagher, D. Andre de Waal:
Fast and Precise Regular Approximations of Logic Programs. ICLP 1994: 599-613 - [c10]J. Cook, John P. Gallagher
A Transformation System for Definite Programs Based on Termination Analysis. LOPSTR 1994: 51-68 - [c9]Emmanuil I. Marakakis, John P. Gallagher
Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types. LOPSTR 1994: 138-153 - 1993
- [c8]John P. Gallagher:
Tutorial on Specialisation of Logic Programs. PEPM 1993: 88-98 - [c7]D. Andre de Waal, John P. Gallagher:
Logic Program Specialisation With Deletion of Useless Clauses. ILPS 1993: 632 - 1992
- [c6]John P. Gallagher, D. Andre de Waal:
Deletion of Redundant Unary Type Predicates from Logic Programs. LOPSTR 1992: 151-167 - [c5]John P. Gallagher:
Static Analysis for Logic Program Specification. WSA 1992: 285-294 - 1991
- [j2]John P. Gallagher
The Derivation of an Algorithm for Program Specialisation. New Gener. Comput. 9(3/4): 305-334 (1991) - [c4]D. Andre de Waal, John P. Gallagher:
Specialisation of a Unification Algorithm. LOPSTR 1991: 205-220 - 1990
- [c3]John P. Gallagher, Maurice Bruynooghe:
The Derivation of an Algorithm for Program Specialisation. ICLP 1990: 732-746
1980 – 1989
- 1988
- [j1]John P. Gallagher, Michael Codish
Specialisation of Prolog and FCP Programs Using Abstract Interpretation. New Gener. Comput. 6(2&3): 159-186 (1988) - [c2]Michael Codish, John P. Gallagher, Ehud Shapiro:
Using Safe Approximations of Fixed Points for Analysis of Logic Programs. META 1988: 233-261 - 1986
- [c1]John P. Gallagher:
Transforming Logic Programs by Specialising Interpreters. ECAI 1986: 313-326
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: