( en | de | ru )

 

Disambiguation of "Gallagher, John P."

Author of the publication

copydeleteadd this publication to your clipboard
An iterative approach to precondition inference using constrained Horn clauses.

, , , , , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

John P Burrows

John P Brown

John P Broussard

John P Teschke

John P Dickson

 

Other publications of authors with the same name

Tree dimension in verification of constrained Horn clauses., , and . Theory Pract. Log. Program., 18 (2): 224-251 (2018)An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata., , and . CoRR, (2015)Tutorial on Specialisation of Logic Programs.. PEPM, page 88-98. ACM, (1993)Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates., , and . LOPSTR, volume 3901 of Lecture Notes in Computer Science, page 115-132. Springer, (2005)From Monomorphic to Polymorphic Well-Typings and Beyond., , and . LOPSTR, volume 5438 of Lecture Notes in Computer Science, page 152-167. Springer, (2008)Specialisation of a Unification Algorithm., and . LOPSTR, page 205-220. Springer, (1991)Tree Automata-Based Refinement with Application to Horn Clause Verification., and . VMCAI, volume 8931 of Lecture Notes in Computer Science, page 209-226. Springer, (2015)The Derivation of an Algorithm for Program Specialisation., and . New Gener. Comput., 9 (3/4): 305-334 (1991)Type-based homeomorphic embedding for online termination., , , and . Inf. Process. Lett., 109 (15): 879-886 (2009)Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance., and . ICLP, page 597-611. MIT Press, (1995)