{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T20:34:56Z","timestamp":1762374896059},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,4,1]],"date-time":"1985-04-01T00:00:00Z","timestamp":481161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,4]]},"DOI":"10.1007\/bf00290146","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T05:53:34Z","timestamp":1096955614000},"page":"67-83","source":"Crossref","is-referenced-by-count":35,"title":["General correctness: A unification of partial and total correctness"],"prefix":"10.1007","volume":"22","author":[{"given":"Dean","family":"Jacobs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-10003-2_59","volume-title":"Semantics of unbounded nondeterminism","author":"R.J. Back","year":"1980","unstructured":"Back, R.J.: Semantics of unbounded nondeterminism. Proc. ICALP 80, Lecture Notes in Computer Science 85, pp. 51?63. Berlin-Heidelberg-New York: Springer 1980"},{"key":"CR2","first-page":"165","volume-title":"Formal Description of Programming Concepts","author":"J.W. Bakker de","year":"1978","unstructured":"de Bakker, J.W.: Recursive programs as predicate transformers. In: Formal Description of Programming Concepts (E.J. Neuhold, ed.), pp. 165?181. Amsterdam: North Holland 1978"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Barringer, H., Cheng, J.H., Jones, C.B.: A logic covering undefinedness in program proofs. Tech. Rep., University of Manchester 1984","DOI":"10.1007\/BF00264250"},{"key":"CR4","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Englewood Cliffs: Prentice-Hall 1976"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1145\/321420.321422","volume":"4","author":"R.W. Floyd","year":"1967","unstructured":"Floyd, R.W.: Nondeterministic algorithms. J. ACM 4, 636?644 (1967)","journal-title":"J. ACM"},{"key":"CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"D. Gries","year":"1981","unstructured":"Gries, D.: The Science of Programming. Berlin-Heidelberg-New York: Springer 1981"},{"key":"CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-11494-7_12","volume-title":"Another characterization of weakest preconditions","author":"P. Guerreiro","year":"1982","unstructured":"Guerreiro, P.: Another characterization of weakest preconditions. Lecture Notes in Computer Science 137, pp. 164?177. Berlin-Heidelberg-New York: Springer 1982"},{"key":"CR8","unstructured":"Harel, D.: On the total correctness of nondeterministic programs. IBM Research Report RC 7691, 1979"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/69610.357988","volume":"27","author":"R. Hehner","year":"1984","unstructured":"Hehner, R.: Predicative programming. Part I. CACM 27, 134?143 (1984)","journal-title":"Part I. CACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/322077.322088","volume":"23","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Some properties of predicate transformers. J. ACM 23, 461?480 (1978)","journal-title":"J. ACM"},{"key":"CR11","first-page":"135","volume":"3","author":"C.A.R. Hoare","year":"1974","unstructured":"Hoare, C.A.R., Lauer, P.E.: Consistent and complementary formal theories of the semantics of programming languages. Acta Inf. 3, 135?153 (1974)","journal-title":"Acta Inf."},{"key":"CR12","unstructured":"Jacobs, D.: General Correctness: a Unification of Partial and Total Correctness. Ph.D. Thesis, Computer Science Dept., Cornell University 1984"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0020-0190(80)90048-4","volume":"4","author":"M.E. Majster-Cederbaum","year":"1980","unstructured":"Majster-Cederbaum, M.E.: A simple relation between relational and predicate transformer semantics for nondeterministic programs. Inf. Process. Lett. 4, 190?192 (1980)","journal-title":"Inf. Process. Lett."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G.D. Plotkin","year":"1976","unstructured":"Plotkin, G.D.: A powerdomain construction. SIAM J. Comput 5, 452?487 (1976)","journal-title":"SIAM J. Comput"},{"key":"CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/3-540-07854-1_217","volume-title":"Dijkstra's predicate transformer, nondeterminism, recursion, and termination","author":"W.P. Roever de","year":"1976","unstructured":"de Roever, W.P.: Dijkstra's predicate transformer, nondeterminism, recursion, and termination. Lecture Notes in Computer Science 45, pp. 472?481. Berlin-Heidelberg-New York: Springer 1976"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Smyth, M.: Powerdomains. J. Comput. Syst Sci. 16 (1978)","DOI":"10.1016\/0022-0000(78)90048-X"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0022-0000(77)80006-8","volume":"15","author":"M. Wand","year":"1977","unstructured":"Wand, M.: A characterization of weakest preconditions. J. Comput Syst Sci. 15, 209?212 (1977)","journal-title":"J. Comput Syst Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290146.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00290146\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T12:45:25Z","timestamp":1682772325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00290146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,4]]}},"alternative-id":["BF00290146"],"URL":"https:\/\/doi.org\/10.1007\/bf00290146","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,4]]}}}