The feasibility of using Horn clauses as a means of describing and transforming imperative pro-grams is explored. A logical semantics is derived for a typical imperative language. The style of this semantics permits direct translations between the source language and semantical representations. Given the use of Horn clause logic in logic programming, the semantics is particularly useful since models of computation associated with logic programs can be applied to it. Treating the semantics as a logic program means that, in a program transformation context, the semantic representation is particularly well suited to partial evaluation. To support these ideas, an automatic translation system has been implemented which permits translation betw...
We present a method for automatically generating verification conditions for a class of imperative p...
In this paper definite Horn clause programs are investigated within a proof-theoretic framework; pro...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
The feasibility of using Horn clauses as a means of describing and transforming imperative pro-grams...
Abstract. Provably correct compilation is an important aspect in development of high assurance softw...
Logic programming is now firmly established as an alternative programming paradigm, distinct and arg...
We investigate representations of imperative programs as constrained Horn clauses. Starting from ope...
We present a method for verifying the correctness of imperative programs which is based on the autom...
Most logic programming languages have the first-order, classical theory of Horn clauses as their log...
We present a method for verifying the correctness of an imperative program with respect to a spec-if...
Provably correct compilation is an important aspect in development of high assurance software system...
Abstract. Horn ⊃ is a logic programming language, defined on the underlying logic FO ⊃ (an extension...
Program analysis and specialisation for declarative languages have been subjects of active research ...
The semantics of an imperative programming language can be expressed as a program in a declarative ...
© 1989, Springer-Verlag. We describe an application of abstract interpretation within the field of s...
We present a method for automatically generating verification conditions for a class of imperative p...
In this paper definite Horn clause programs are investigated within a proof-theoretic framework; pro...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
The feasibility of using Horn clauses as a means of describing and transforming imperative pro-grams...
Abstract. Provably correct compilation is an important aspect in development of high assurance softw...
Logic programming is now firmly established as an alternative programming paradigm, distinct and arg...
We investigate representations of imperative programs as constrained Horn clauses. Starting from ope...
We present a method for verifying the correctness of imperative programs which is based on the autom...
Most logic programming languages have the first-order, classical theory of Horn clauses as their log...
We present a method for verifying the correctness of an imperative program with respect to a spec-if...
Provably correct compilation is an important aspect in development of high assurance software system...
Abstract. Horn ⊃ is a logic programming language, defined on the underlying logic FO ⊃ (an extension...
Program analysis and specialisation for declarative languages have been subjects of active research ...
The semantics of an imperative programming language can be expressed as a program in a declarative ...
© 1989, Springer-Verlag. We describe an application of abstract interpretation within the field of s...
We present a method for automatically generating verification conditions for a class of imperative p...
In this paper definite Horn clause programs are investigated within a proof-theoretic framework; pro...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...