{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:13Z","timestamp":1761611173757},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1007\/bf00268074","type":"journal-article","created":{"date-parts":[[2006,2,19]],"date-time":"2006-02-19T05:14:38Z","timestamp":1140326078000},"page":"1-7","source":"Crossref","is-referenced-by-count":25,"title":["A simple fixpoint argument without the restriction to continuity"],"prefix":"10.1007","volume":"23","author":[{"given":"Edsger W.","family":"Dijkstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J. M.","family":"van Gasteren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00268074_CR1","unstructured":"Back, R.J.R.: Correctness preserving program refinements: proof theory and applications. Math. Cent. Tracts 131, (1980)"},{"key":"BF00268074_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF00289263","volume":"15","author":"R.J.R. Back","year":"1981","unstructured":"Back, R.J.R.: Proving Total Correctness of Nondeterministic Programs in Infinitary Logic. Acta Inf. 15, 233\u2013249 (1981)","journal-title":"Acta Inf."},{"key":"BF00268074_CR3","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/69622.357189","volume":"4","author":"H.J. Boom","year":"1982","unstructured":"Boom, H.J.: A Weaker Precondition for Loops. ACM Trans. Program. Lang. Syst. 4, 668\u2013677 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"BF00268074_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":"BF00268074_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R.W. Floyd","year":"1967","unstructured":"Floyd, R.W.: Assigning meanings to programs. Amer. Math. Soc. Symposia Appl. Math. 19, 19\u201331 (1967)","journal-title":"Amer. Math. Soc. Symposia Appl. Math."},{"key":"BF00268074_CR6","first-page":"504","volume-title":"Lect. Notes Comput. Sci. Vol. 86","author":"D. Park","year":"1980","unstructured":"Park, D.: On the semantics of fair parallelism. Lect. Notes Comput. Sci. Vol. 86, pp. 504\u2013526. Berlin, Heidelberg, New York: Springer 1980"},{"key":"BF00268074_CR7","volume-title":"Lect. Notes Comput. Sci. Vol. 104","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. Lect. Notes Comput. Sci. Vol. 104, Berlin, Heidelberg, New York: Springer 1981"},{"key":"BF00268074_CR8","volume-title":"The Scott-Strachey Approach to Programming","author":"J. Stoy","year":"1977","unstructured":"Stoy, J.: Denotational Semantics. In: The Scott-Strachey Approach to Programming. Cambridge: MIT Press 1977"},{"key":"BF00268074_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A Lattice-theoretical Fixpoint Theorem and its Applications. Pac. J. Math. 5, 285\u2013309 (1955)","journal-title":"Pac. J. Math."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00268074\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T19:21:06Z","timestamp":1554319266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00268074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["BF00268074"],"URL":"https:\/\/doi.org\/10.1007\/bf00268074","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}