@proceedings {CominiGL00b, title = {Assertion based Inductive Verification Methods for Logic Programs}, journal = {Proceedings of MFCSIT{\textquoteright}2000}, volume = {40}, year = {2001}, note = {Available at URL: {\href{http://www.elsevier.nl/locate/entcs/volume40.html} {\texttt{http://www.elsevier.nl/locate/entcs/volume40.html}}}}, pages = {1{\textendash}18}, publisher = {Elsevier Science Publishers}, abstract = {This paper is an overview of our results on the application of abstract interpretation concepts to the derivation of a verification method for logic programs. These include the systematic design of semantics modeling various proof methods and the characterization of assertions as abstract domains. We first apply the verification framework defined in [CominiGLV99] to derive inductive sufficient conditions for partial correctness. Then the domain of assertions is formalized as an abstract domain. We can therefore derive an assertion based verification method. We finally show two methods based on different assertion languages: a decidable assertion language and Horn clause logic used as assertion language.}, keywords = {Abstract Interpretation, Assertion Language, Inductive Verification, Transformation of logic programs}, author = {Marco Comini and Roberta Gori and Giorgio Levi}, editor = {A. K. Seda} } @proceedings {CominiGL00a, title = {Logic programs as specifications in the inductive verification of logic programs}, journal = {Declarative Programming {\textendash} Selected Papers from AGP 2000}, volume = {48}, year = {2001}, note = {Available at URL: {\href{http://www.elsevier.nl/locate/entcs/volume48.html} {\texttt{http://www.elsevier.nl/locate/entcs/volume48.html}}}}, pages = {1{\textendash}16}, publisher = {Elsevier Science Publishers}, abstract = {n 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 [CominiGLV99] to derive sufficient inductive conditions to prove partial correctness. Then we show how the resulting conditions can be proved using program transformation techniques.}, keywords = {Abstract Interpretation, Inductive Verification, Transformation of logic programs}, author = {Marco Comini and Roberta Gori and Giorgio Levi}, editor = {Agostino Dovier and Maria Chiara Meo and Omicini, A.} }