Paper: Completeness of a Relational Calculus for Program Schemes (at LICS 1998)

Authors: Marcelo F. Frias Roger D. Maddux

Abstract

The relational calculus MU₂, presented in de Roever's dissertation as a framework for describing and proving properties of programs, was conjectured by David Park to be complete. In this paper we confirm Park's conjecture

BibTeX

  @InProceedings{FriasMaddux-CompletenessofaRela,
    author = 	 {Marcelo F. Frias and Roger D. Maddux},
    title = 	 {Completeness of a Relational Calculus for Program Schemes},
    booktitle =  {Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1998)},
    year =	 {1998},
    month =	 {June}, 
    pages =      {127--134},
    location =   {Indianapolis, IN, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }