{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:34Z","timestamp":1725663274901},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540505174"},{"type":"electronic","value":"9783540460305"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50517-2_88","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:26:40Z","timestamp":1330201600000},"page":"304-328","source":"Crossref","is-referenced-by-count":0,"title":["Relation level semantics"],"prefix":"10.1007","author":[{"given":"Jules","family":"Desharnais","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazim H.","family":"Madhavji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"J. Backus. From function level semantics to program transformation and optimization. Mathematical Foundations of Software Development. Proc. Int. Joint Conf. on Theory and Practice of Software Development (TAPSOFT), Berlin, March 1985, Vol. 1, Lecture Notes in Comp. Sci. 185, Springer-Verlag 1985, 60\u201391.","DOI":"10.1007\/3-540-15198-2_5"},{"key":"22_CR2","unstructured":"J. W. De Bakker and W. P. De Roever. A calculus for recursive program schemes. Automata, languages and programming. Proc. symp. organized by IRIA, Rocquencourt, France, July 1972, (M. Nivat, ed.), North-Holland 1973, 167\u2013196."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(86)90172-6","volume":"43","author":"R. Berghammer","year":"1986","unstructured":"R. Berghammer and H. Zierer. Relational algebraic semantics of deterministic and nondeterministic programs. Theor. Comput. Sci. 43, 1986, 123\u2013147.","journal-title":"Theor. Comput. Sci."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"A. Blikle. A comparative review of some program verification methods. Proc. 6th Symp. Math. Found. Comput. Sci., (J. Gruska, ed.), Lecture Notes in Comp. Sci. 53, Springer-Verlag 1977, 17\u201333.","DOI":"10.1007\/3-540-08353-7_124"},{"issue":"6","key":"22_CR5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E.F. Codd","year":"1970","unstructured":"E.F. Codd. A relational model for large shared data banks. Commun. ACM 13, 6, June 1970, 377\u2013387.","journal-title":"Commun. ACM"},{"key":"22_CR6","unstructured":"J. Desharnais and N. Madhavji. Object-free relational specification and program derivation. Internal technical report, available from the authors."},{"key":"22_CR7","unstructured":"P.C. Fischer and S.J. Thomas. Operators for non-first-normal-form relations. Proc. 7th Int. Computer Software & Applications Conference (COMPSAC 83), Chicago, IL, IEEE Comp. Soc. Press 1983, 464\u2013475."},{"issue":"10","key":"22_CR8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM 12, 10, October 1969, 576\u2013581.","journal-title":"Commun. ACM"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare and He Jifeng. The weakest prespecification. Fundam. Inform. IX, 1986, Part I: 51\u201384, Part II: 217\u2013252.","DOI":"10.3233\/FI-1986-9104"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare, I.J. Hayes, He Jifeng, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey and B.A. Sufrin. Laws of Programming. Commun. ACM 30, 8, August 87, pp. 672\u2013686. Plus Corrigenda: Commun. ACM 30, 9, September 87, p. 770.","DOI":"10.1145\/27651.27653"},{"key":"22_CR11","volume-title":"The theory of relational databases","author":"D. Maier","year":"1983","unstructured":"D. Maier. The theory of relational databases. Computer Science Press, Inc., Rockville, MD, 1983."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00264277","volume":"20","author":"A. Mili","year":"1983","unstructured":"A. Mili. A relational approach to the design of deterministic programs. Acta Inform. 20, 1983, 315\u2013328.","journal-title":"Acta Inform."},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00265990","volume":"24","author":"A. Mili","year":"1987","unstructured":"A. Mili, J. Desharnais and F. Mili. Relational heuristics for the design of deterministic programs. Acta Inform. 24, 1987, 239\u2013276.","journal-title":"Acta Inform."},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(81)90060-8","volume":"15","author":"G. Schmidt","year":"1981","unstructured":"G. Schmidt. Programs as partial graphs I: Flow equivalence and correctness. Theor. Comput. Sci. 15, 1981, 1\u201325.","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"22_CR15","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott. Data types as lattices. SIAM J. Comput. 5, 3, September 1976, 522\u2013587.","journal-title":"SIAM J. Comput."},{"key":"22_CR16","volume-title":"Denotational semantics: The Scott-Strachey approach to programming language theory","author":"J. E. Stoy","year":"1977","unstructured":"J. E. Stoy. Denotational semantics: The Scott-Strachey approach to programming language theory. The MIT Press, Cambridge, MA, 1977."},{"issue":"3","key":"22_CR17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"A. Tarski. On the calculus of relations. J. Symb. Log. 6, 3, September 1941, 73\u201389.","journal-title":"J. Symb. Log."},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 1955, 285\u2013309.","journal-title":"Pacific J. Math."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50517-2_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:37:22Z","timestamp":1640918242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50517-2_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540505174","9783540460305"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-50517-2_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}