The following pages link to John P. Gallagher (Q238502):
Displaying 38 items.
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335) (← links)
- (Q989514) (redirect page) (← links)
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- Specialisation of Prolog and FCP programs using abstract interpretation (Q1108783) (← links)
- (Q1239032) (redirect page) (← links)
- A rigid elliptic inclusion in an anisotropic elastic whole space (Q1239033) (← links)
- The fundamental integral for small deformations superposed on finite triaxial extension of a neo-Hockean material (Q2540860) (← links)
- (Q2723919) (← links)
- A Transformational Approach to Parametric Accumulated-Cost Static Profiling (Q2798274) (← links)
- Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation (Q3066089) (← links)
- Convex Hull Abstractions in Specialization of CLP Programs (Q3079923) (← links)
- Analysis of Linear Hybrid Systems in CLP (Q3617430) (← links)
- From Monomorphic to Polymorphic Well-Typings and Beyond (Q3617436) (← links)
- (Q3983041) (← links)
- An iterative approach to precondition inference using constrained Horn clauses (Q4559813) (← links)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- Non-discriminating Arguments and Their Uses (Q4649724) (← links)
- (Q4736992) (← links)
- Analysis of Logic Programs Using Regular Tree Languages (Q4909309) (← links)
- (Q4997236) (← links)
- (Q5015369) (← links)
- (Q5020649) (← links)
- (Q5020658) (← links)
- A General Framework for Static Cost Analysis of Parallel Logic Programs (Q5097623) (← links)
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis (Q5108517) (← links)
- Tree Automata-Based Refinement with Application to Horn Clause Verification (Q5172644) (← links)
- The applicability of logic program analysis and transformation to theorem proving (Q5210773) (← links)
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (Q5302883) (← links)
- Converting One Type-Based Abstract Domain to Another (Q5302885) (← links)
- Logic Programming (Q5313204) (← links)
- Fully Automatic Binding-Time Analysis for Prolog (Q5458793) (← links)
- Logic Programming (Q5475784) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
- Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation (Q5505589) (← links)
- Logic Based Program Synthesis and Transformation (Q5713949) (← links)
- Static Analysis (Q5897427) (← links)
- Regular tree languages as an abstract domain in program specialisation (Q5959582) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
