{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:05:24Z","timestamp":1760043924557},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,2,1]],"date-time":"1982-02-01T00:00:00Z","timestamp":381369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11489,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982,2]]},"DOI":"10.1016\/0304-3975(82)90001-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"113-149","source":"Crossref","is-referenced-by-count":13,"title":["Floyd's principle, correctness theories and program equivalence"],"prefix":"10.1016","volume":"17","author":[{"given":"J.A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Tiuryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.V.","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90001-9_BIB1","series-title":"Proc. 5th Scandinavian Logic Symposium","first-page":"1","article-title":"Ten years of Hoare's logic, a survey","author":"Apt","year":"1979"},{"key":"10.1016\/0304-3975(82)90001-9_BIB2","article-title":"Recursive Procedures","volume":"24","author":"de Bakker","year":"1973"},{"key":"10.1016\/0304-3975(82)90001-9_BIB3","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0304-3975(82)90001-9_BIB4","first-page":"7","volume":"2","author":"Banachowski","year":"1977"},{"key":"10.1016\/0304-3975(82)90001-9_BIB5","article-title":"The field of algebraic numbers fails to possess even a nice sound, if relatively incomplete","volume":"136","author":"Bergstra","year":"1980"},{"key":"10.1016\/0304-3975(82)90001-9_BIB6","first-page":"73","article-title":"Existential quantifiers in abstract data types","author":"Broy","year":"1979"},{"key":"10.1016\/0304-3975(82)90001-9_BIB7","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0304-3975(82)90001-9_BIB8","series-title":"Technical Report 79","article-title":"Axiomatic and interpretative semantics for an ALGOL fragment","author":"Cook","year":"1975"},{"key":"10.1016\/0304-3975(82)90001-9_BIB9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verifications","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90001-9_BIB10","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(82)90001-9_BIB11","series-title":"Mathematical Centre Tracts","first-page":"57","article-title":"Algorithmic Logic","volume":"63","author":"Engeler","year":"1975"},{"key":"10.1016\/0304-3975(82)90001-9_BIB12","series-title":"General Recursion Theory: An Axiomatic Approach","author":"Fenstad","year":"1980"},{"key":"10.1016\/0304-3975(82)90001-9_BIB13","series-title":"Mathematical Aspects of Computer Science","first-page":"19","article-title":"Assigning meaning to programs","author":"Floyd","year":"1967"},{"key":"10.1016\/0304-3975(82)90001-9_BIB14","series-title":"Logic Colliquium, '69","first-page":"316","article-title":"Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Friedman","year":"1971"},{"key":"10.1016\/0304-3975(82)90001-9_BIB15","series-title":"Current Trends in Programming Methodology IV, Data Structuring","first-page":"80","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(82)90001-9_BIB16","series-title":"Theory of Program Structures: Schemes, Semantics, Verification","author":"Greibach","year":"1975"},{"key":"10.1016\/0304-3975(82)90001-9_BIB17","series-title":"First-order Dynamic Logic","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(82)90001-9_BIB18","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(80)90007-0","article-title":"A proof system for the first-order relational calculus","volume":"20","author":"Hennessy","year":"1980","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(82)90001-9_BIB19","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90001-9_BIB20","series-title":"Symposium on the Semantics of Algorithmic Languages","first-page":"102","article-title":"Procedures and parameters: an axiomatic approach","author":"Hoare","year":"1971"},{"key":"10.1016\/0304-3975(82)90001-9_BIB21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00264034","article-title":"Consistent and complementary formal theories of the semantics of programming languages","volume":"3","author":"Hoare","year":"1974","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90001-9_BIB22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289504","article-title":"An axiomatic definition of the programming language PASCAL","volume":"2","author":"Hoare","year":"1973","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90001-9_BIB23","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(69)80009-7","article-title":"The correctness of programs","volume":"3","author":"Manna","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90001-9_BIB24","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0304-3975(82)90001-9_BIB25","author":"Meyer","year":"1979","journal-title":"Letter to J. Tiuryn"},{"key":"10.1016\/0304-3975(82)90001-9_BIB26","author":"Meyer","year":"1979","journal-title":"Letter to J. Tiuryn"},{"key":"10.1016\/0304-3975(82)90001-9_BIB27","series-title":"Proc. 6th ACM Symposium on Principles of Programming Languages","first-page":"180","article-title":"Specifying program language semantics: a tutorial and critique of a paper by Hoare and Lauer","author":"Meyer","year":"1979"},{"key":"10.1016\/0304-3975(82)90001-9_BIB28","series-title":"Proc. 7th ACM Symposium on Principles of Programming Languages","first-page":"203","article-title":"Axiomatic definitions of programming languages. A theoretical assessment","author":"Meyer","year":"1980"},{"key":"10.1016\/0304-3975(82)90001-9_BIB29","unstructured":"J. Moldestad and J.V. Tucker, On the classification of computable functions in an abstract setting, in preparation."},{"key":"10.1016\/0304-3975(82)90001-9_BIB30","first-page":"427","article-title":"Abstract first-order computability I","volume":"138","author":"Moschovakis","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(82)90001-9_BIB31","doi-asserted-by":"crossref","unstructured":"R. Parikh, Some applications of topology to program semantics, Math. Systems Theory, to appear.","DOI":"10.1007\/BFb0025791"},{"key":"10.1016\/0304-3975(82)90001-9_BIB32","series-title":"UCLA-ENG-7838","article-title":"An axiomatic semantic definition of ALGOL 68","author":"Schwartz","year":"1978"},{"key":"10.1016\/0304-3975(82)90001-9_BIB33","article-title":"Logic of effective definitions","author":"Tiuryn","year":"1979","journal-title":"RWTH Aachen Department of Computer Science Research Report 55"},{"key":"10.1016\/0304-3975(82)90001-9_BIB34","series-title":"Recursion Theory, its Generalisations and Applications","article-title":"Computing in algebraic systems","author":"Tucker","year":"1980"},{"key":"10.1016\/0304-3975(82)90001-9_BIB35","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","article-title":"Final algebra semantics and data type extensions","volume":"19","author":"Wand","year":"1979","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:26:02Z","timestamp":1555111562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,2]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,2]]}},"alternative-id":["0304397582900019"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90001-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,2]]}}}