AbstractIn this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. We first apply the verification framework defined in [3] to derive sufficient inductive conditions to prove partial correctness. Then we show how the resulting conditions can be proved using program transformation techniques
International audiencePartial correctness is perhaps the most important functional property of algo-...
We present a general framework (a programming calculus) for the specification, verification and synt...
Interpretation Giorgio Levi and Paolo Volpe Dipartimento di Informatica, Universit`a di Pisa Corso...
AbstractIn this paper we define a new verification method based on an assertion language able to exp...
In this paper we define a new verification method based on an assertion language able to express pro...
AbstractThis paper is an overview of our results on the application of abstract interpretation conce...
AbstractThis paper is an overview of our results on the application of abstract interpretation conce...
his paper is an overview of our results on the application of abstract interpretation concepts to th...
AbstractCertain properties of logic programs are inexpressible in terms of their declarative semanti...
AbstractIn this paper we shall consider proof methods for declarative properties of definite program...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
This paper explores the relationship between verification of logic programs and imperative programs ...
AbstractIn this paper we shall consider proof methods for declarative properties of definite program...
AbstractWe present a proof method in the style of Hoare's logic, aimed at providing a unifying frame...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
International audiencePartial correctness is perhaps the most important functional property of algo-...
We present a general framework (a programming calculus) for the specification, verification and synt...
Interpretation Giorgio Levi and Paolo Volpe Dipartimento di Informatica, Universit`a di Pisa Corso...
AbstractIn this paper we define a new verification method based on an assertion language able to exp...
In this paper we define a new verification method based on an assertion language able to express pro...
AbstractThis paper is an overview of our results on the application of abstract interpretation conce...
AbstractThis paper is an overview of our results on the application of abstract interpretation conce...
his paper is an overview of our results on the application of abstract interpretation concepts to th...
AbstractCertain properties of logic programs are inexpressible in terms of their declarative semanti...
AbstractIn this paper we shall consider proof methods for declarative properties of definite program...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
This paper explores the relationship between verification of logic programs and imperative programs ...
AbstractIn this paper we shall consider proof methods for declarative properties of definite program...
AbstractWe present a proof method in the style of Hoare's logic, aimed at providing a unifying frame...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
International audiencePartial correctness is perhaps the most important functional property of algo-...
We present a general framework (a programming calculus) for the specification, verification and synt...
Interpretation Giorgio Levi and Paolo Volpe Dipartimento di Informatica, Universit`a di Pisa Corso...