Stratified least fixpoint logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Stratified least fixpoint logic

Kevin J. Compton
  • Function : Author


Stratified least fixpoint logic or SLFP characterizes the expressibility of stratified logic programs and in a different formulation has been used as a logic of imperative programs. These two formulations of SLFP are proved to be equivalent and a complete sequent calculus for SLFP is presented. It is argued that SLFP is the most appropriate assertion language for program verification. In particular, it is shown that traditional approaches using first-order logic as an assertion language only restrict to interpretations where first-order logic has the same expressibility as SLFP.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1674.pdf (1.45 Mo) Télécharger le fichier

Dates and versions

inria-00074882 , version 1 (24-05-2006)


  • HAL Id : inria-00074882 , version 1


Kevin J. Compton. Stratified least fixpoint logic. [Research Report] RR-1674, INRIA. 1992. ⟨inria-00074882⟩
64 View
44 Download


Gmail Facebook Twitter LinkedIn More