DocumentCode
1954975
Title
Completeness of a relational calculus for program schemes
Author
Frias, Marcelo F. ; Maddux, Roger D.
Author_Institution
Dept. de Inf., Pontificia Univ. Catolica do Rio de Janeiro, Brazil
fYear
1998
fDate
21-24 Jun 1998
Firstpage
127
Lastpage
134
Abstract
The relational calculus MU2, 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
Keywords
relational algebra; MU2; completeness; program schemes; relational calculus; Boolean algebra; Calculus; Computational modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
Conference_Location
Indianapolis, IN
ISSN
1043-6871
Print_ISBN
0-8186-8506-9
Type
conf
DOI
10.1109/LICS.1998.705649
Filename
705649
Link To Document