AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Programs (NLP). We give explicit first-order characterizations of the program-verifying power of the well-known Manna-Cooper method for proving total correctness assertions (tca's). Similar characterization is given to the Intermittent Assertions Method (w.r.t. tca's). A comparison of the tca-proving powers of distinguished methods (or logics of programs) is also attempted. We also show that NLP provides new methods which are strictly stronger than the Manna-Cooper method. In the end we turn to partial correctness issues related to the main body of the paper
We advocate using the declarative reading in proving partial correctness of logic programs, when the...
We present an approximation framework for attacking the undecidable termination prob-lem of logic pr...
interpretation is a well-known and extensively used method to extract over-approximate program invar...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
International audiencePartial correctness is perhaps the most important functional property of algo-...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
Program testing or debugging is one of the most time consuming tasks in the development of a compute...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
We advocate using the declarative reading in proving partial correctness of logic programs, when the...
We present an approximation framework for attacking the undecidable termination prob-lem of logic pr...
interpretation is a well-known and extensively used method to extract over-approximate program invar...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
International audiencePartial correctness is perhaps the most important functional property of algo-...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
Program testing or debugging is one of the most time consuming tasks in the development of a compute...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
We advocate using the declarative reading in proving partial correctness of logic programs, when the...
We present an approximation framework for attacking the undecidable termination prob-lem of logic pr...
interpretation is a well-known and extensively used method to extract over-approximate program invar...