{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:37Z","timestamp":1725663877436},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:12:23Z","timestamp":1330240343000},"page":"714-723","source":"Crossref","is-referenced-by-count":2,"title":["A calculus for higher order procedures with global variables"],"prefix":"10.1007","author":[{"given":"Werner","family":"Stephan","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wolpers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"62_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"K. R. Apt","year":"1981","unstructured":"K. R. Apt. Ten years of Hoare's Logic, a Survey\u2014Part 1. ACM TOPLAS, 3:431\u2013483, 1981.","journal-title":"ACM TOPLAS"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"E.M. Clarke. The Characterization Problem for Hoare Logics. In C. A. R. Hoare and J. C. Shepherdson, editors, Mathematical Logic and Programming Languages, International Series in Computer Science. Prentice Hall, 1984.","DOI":"10.1098\/rsta.1984.0068"},{"issue":"1","key":"62_CR3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"S. A. Cook","year":"1978","unstructured":"S. A. Cook. Soundness and Completeness of an Axiom System for Program Verification. SIAM Journal of Computing, 7(1):70\u201390, 1978.","journal-title":"SIAM Journal of Computing"},{"key":"62_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF00264295","volume":"20","author":"W. Damm","year":"1983","unstructured":"Werner Damm and Bernhard Josko. A Sound and Relatively Complete Axiomatization of Clarke's Language L4. Acta Informatica, 20:59\u2013101, 1983.","journal-title":"Acta Informatica"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Steven M. German, Edmund M. Clarke, and Joseph Y. Halpern. Reasoning about Procedures as Parameters in the Language L4. Information and Computation, pages 265\u2013359, 1989.","DOI":"10.1016\/0890-5401(89)90040-0"},{"key":"62_CR6","unstructured":"Robert Goldblatt. Axiomatising the Logic of Computer Programming. Number 130 in Lecture Notes in Computer Science. Springer-Verlag, 1982."},{"key":"62_CR7","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. Anthony","year":"1969","unstructured":"Charles Anthony Richard Hoare. An Axiomatic Basis for Computer Programming. Communications of hte ACM, 12:576\u2013580, 583, 1969.","journal-title":"Communications of hte ACM"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Maritta Heisel, Wolfgang Reif, and Werner Stephan. A Dynamic Logic for Program Verification. In Proceedings of Logic at Botik, number 363 in Lecture Notes in Computer Science, pages 134\u2013145. Springer Verlag, 1989.","DOI":"10.1007\/3-540-51237-3_12"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"R. J. Lipton. A Necessary and Sufficient Condition for the Existance of Hoare Logics. In Proceedings, 18th IEEE Symposium on Foundations of Computer Science, pages 1\u20136, 1977.","DOI":"10.1109\/SFCS.1977.1"},{"key":"62_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00261258","volume":"16","author":"E. R. Olderog","year":"1981","unstructured":"Ernst R\u00fcdiger Olderog. Sound and Complete Hoare-like Calculi based on Copy Rules. Acta Informatica, 16:161\u2013197, 1981.","journal-title":"Acta Informatica"},{"key":"62_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(84)90066-5","volume":"30","author":"E. Olderog","year":"1984","unstructured":"Ernst-R\u00fcdiger Olderog. Correctness of Programs with Pascal-like Procedures without Global Variables. Theoretical Computer Science, 30:49\u201390, 1984.","journal-title":"Theoretical Computer Science"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"V. R. Pratt. Semantical Considerations on Floyd-Hoare Logic. In Proc. 17th IEEE Symp. on Foundations of Computer Science, pages 109\u2013121, October 1976.","DOI":"10.1109\/SFCS.1976.27"},{"key":"62_CR13","unstructured":"A. Salwicki. Formalised Algorithmic Languages. Bull. Acad. Pol. Sci., Ser. Sci. Math. Astron. Phy., pages 227\u2013232, 1970."},{"key":"62_CR14","unstructured":"Werner Stephan. Axiomatisierung rekursiver Prozeduren in der Dynamischen Logik. Habilitationsschrift, Universit\u00e4t Karlsruhe, 1989."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:08:48Z","timestamp":1605629328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}