Analysis and transformation of constrained Horn clauses for program verification
This paper surveys recent work on applying analysis and transformation techniques that
originate in the field of constraint logic programming (CLP) to the problem of verifying …
originate in the field of constraint logic programming (CLP) to the problem of verifying …
Nurse led follow up and conventional medical follow up in management of patients with lung cancer: randomised trial
Objective: To assess the effectiveness of nurse led follow up in the management of patients
with lung cancer. Design: Randomised controlled trial. Setting: Specialist cancer hospital …
with lung cancer. Design: Randomised controlled trial. Setting: Specialist cancer hospital …
Two variables per linear inequality as an abstract domain
This paper explores the spatial domain of sets of inequalities where each inequality contains
at most two variables—a domain that is richer than intervals and more tractable than general …
at most two variables—a domain that is richer than intervals and more tractable than general …
Similar meltwater contributions to glacial sea level changes from Antarctic and northern ice sheets
EJ Rohling, R Marsh, NC Wells, M Siddall… - Nature, 2004 - nature.com
Abstract The period between 75,000 and 20,000 years ago was characterized by high
variability in climate,,,,,,,,,,, and sea level,. Southern Ocean records of ice-rafted debris …
variability in climate,,,,,,,,,,, and sea level,. Southern Ocean records of ice-rafted debris …
Relational verification through horn clause transformation
We present a method for verifying relational program properties, that is, properties that relate
the input and the output of two programs. Our verification method is parametric with respect …
the input and the output of two programs. Our verification method is parametric with respect …
Infinite state model checking by abstract interpretation and program specialisation
M Leuschel, T Massart - … Workshop on Logic Programming Synthesis and …, 1999 - Springer
We illustrate the use of logic programming techniques for finite model checking of CTL
formulae. We present a technique for infinite state model checking of safety properties based …
formulae. We present a technique for infinite state model checking of safety properties based …
Logic program specialisation through partial deduction: Control issues
M Leuschel, M Bruynooghe - Theory and Practice of Logic …, 2002 - cambridge.org
Program specialisation aims at improving the overall performance of programs by
performing source to source transformations. A common approach within functional and …
performing source to source transformations. A common approach within functional and …
Solving Horn clauses on inductive data types without induction
We address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs)
based on theories of inductively defined data structures, such as lists and trees. We propose …
based on theories of inductively defined data structures, such as lists and trees. We propose …
Homeomorphic embedding for online termination of symbolic methods
M Leuschel - The essence of computation: complexity, analysis …, 2002 - Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained
popularity to ensure the termination of techniques for program analysis, specialisation …
popularity to ensure the termination of techniques for program analysis, specialisation …
Abstract interpretation of pic programs through logic programming
KS Henriksen, JP Gallagher - 2006 Sixth IEEE International …, 2006 - ieeexplore.ieee.org
A logic based general approach to abstract interpretation of low-level machine programs is
reported. It is based on modelling the behavior of the machine as a logic program. General …
reported. It is based on modelling the behavior of the machine as a logic program. General …