{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:47Z","timestamp":1725456107354},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540112129"},{"type":"electronic","value":"9783540390473"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bfb0025787","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:23:41Z","timestamp":1132395821000},"page":"282-299","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A note on equivalences among logics of programs"],"prefix":"10.1007","author":[{"given":"Albert R.","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Tiuryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"18_CR1","first-page":"7","volume-title":"Mathematical Foundations of Computer Science, Banach Center Publichations, vol. 2","author":"L. Banachowski","year":"1977","unstructured":"BANACHOWSKI, L. et al. An Introduction to Algorithmic Logic; Metamathematical Investigations in the Theory of Programs, Mathematical Foundations of Computer Science, Banach Center Publichations, vol. 2, (ed A. Mazurkiewicz and Z. Pawlak), Polish Scientific Publishers, Warsaw, 1977, 7\u2013100."},{"key":"18_CR2","unstructured":"BERGSTRA, J., TIURYN, J. and TUCKER, J., Floyd's Principle, Correctness Theories and Program Equivalence, Mathematisch Centrum, IW145\/80. To appear in Theoretical Computer Science, 1981."},{"key":"18_CR3","unstructured":"CONSTABLE, R.L., and O'DONNELL, M.J., A Programming Logic, Winthrop Publishers, 1978."},{"key":"18_CR4","unstructured":"DE BAKKER, J., Mathematical Theory of Program Correctness, Prentice-Hall, 1980."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01705528","volume":"1","author":"E. Engeler","year":"1967","unstructured":"ENGELER, E. Algorithmic Properties of Structures, Mathematical Systems Theory, 1, 1967, 183\u2013195.","journal-title":"Mathematical Systems Theory"},{"key":"18_CR6","unstructured":"ENGELER, E., Algorithmic Logic. In de Bakker (ed.) Mathematical Centre Tracts (63) Amsterdam 1975, 57\u201385."},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(81)90039-6","volume":"13","author":"J.H. Gallier","year":"1981","unstructured":"GALLIER, J.H. Nondeterministic flowchart programs with recursive procedures: semantics and correctness, Theoretical Computer Science, 13, 2(1981), 193\u2013224.","journal-title":"Theoretical Computer Science"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"GREIBACH, S. Theory of Program Structures: Schemes, Semantics, Verification, Lecture Notes in Computer Science, 36, Springer Verlag, 1975.","DOI":"10.1007\/BFb0023017"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"HAREL, D., First-Order Dynamic Logic, Lecture Notes in Computer Science 68, Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09237-4"},{"key":"18_CR10","first-page":"261","volume-title":"Computability and Completeness in Logics of Programs: Preliminary Report","author":"D. Harel","year":"1977","unstructured":"10.HAREL, D., A.R. MEYER and V. PRATT, Computability and Completeness in Logics of Programs: Preliminary Report, 9th ACM Symp. on Theory of Computing, Boulder, Colorado, (May, 1977), 261\u2013268. Revised version, M.I.T. Lab. for Computer Science TM-97, (Feb. 1978), 16 pp."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"HAREL, D., and PRATT, V. Nondeterminism in logics of programs, 5th Annual Symposium on Principles of Programming Languages, January 1978, 203\u2013213.","DOI":"10.1145\/512760.512782"},{"key":"18_CR12","first-page":"225","volume-title":"Automata, Languages and Programming","author":"P. Hitchcock","year":"1973","unstructured":"HITCHCOCK, P. AND PARK, D. Induction Rules and Termination Proofs, Automata, Languages and Programming, (ed M. Nivat), American Elsevier, New York, 1973, 225\u2013251."},{"key":"18_CR13","volume-title":"Model Theory for Infinitary Logic","author":"H.J. Keisler","year":"1972","unstructured":"KEISLER, H.J., Model Theory for Infinitary Logic. North-Holland Publ. Co., Amsterdam 1972."},{"key":"18_CR14","first-page":"253","volume-title":"Automata, Languages and Programming","author":"D.J. Kfoury","year":"1972","unstructured":"KFOURY, D.J., Comparing Algebraic Structures up to Algorithmic Equivalence. In Nivat (ed.) Automata, Languages and Programming. North-Holland Publ. Co., Amsterdam 1972, 253\u2013264."},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0022-0000(74)80030-9","volume":"8","author":"D.J. Kfoury","year":"1974","unstructured":"KFOURY, D.J., Translatability of schemes over restricted interpretations. Journal of Comp. and Syst. Sc. 8 (1974), 387\u2013408.","journal-title":"Journal of Comp. and Syst. Sc."},{"key":"18_CR16","unstructured":"MEYER, A.R., Ten thousand and one logics of programming. EATCS Bulletin, 11\u201329; M.I.T. LCS TM 150, MIT Laboratory for Computer Science, Cambridge, Ma., February 1980."},{"key":"18_CR17","unstructured":"MEYER, A.R. and J. Y. HALPERN, Axiomatic Definitions of Programming Languages: A Theoretical Assessment, (Preliminary Report) Proc. of Seventh Annual POPL Conf., January 1980, 203\u2013212; M.I.T. LCS TM 163, April, 1980, 34 pp.; to appear JACM (1981)."},{"key":"#cr-split#-18_CR18.1","doi-asserted-by":"crossref","unstructured":"MEYER, ALBERT R., and ROHIT PARIKH, Definability in Dynamic Logic, Proc. of ACM Symp. on Theory of Computing, Los Angeles, Cal., April, 1980, 1-7","DOI":"10.1145\/800141.804646"},{"key":"#cr-split#-18_CR18.2","unstructured":"to appear Jour. Computer and System Science (1981)."},{"key":"#cr-split#-18_CR19.1","doi-asserted-by":"crossref","unstructured":"MEYER, A.R. and K. WINKLMANN, On the Expressive Power of Dynamic Logic, Preliminary Report, Proc. of the 11th Annual ACM Conf. on Theory of Computing, Atlanta, Ga., May 1979, 167-175","DOI":"10.1145\/800135.804410"},{"key":"#cr-split#-18_CR19.2","unstructured":"M.I.T. LCS TM 157, February, 1980, 36pp"},{"key":"#cr-split#-18_CR19.3","unstructured":"to appear Theoretical Computer Science (1981)."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"MIRKOWSKA, G., Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations, 12th Annual ACM Symp. on Theory of Computing (1980), 14\u201321.","DOI":"10.1145\/800141.804648"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(76)90022-0","volume":"3","author":"D. Park","year":"1976","unstructured":"D. PARK. Finiteness is mu-ineffable, Theoretical Computer Science 3, 1976, 173\u2013181.","journal-title":"Theoretical Computer Science"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"PRATT, V., Semantical considerations on Floyd-Hoare logic, Proceedings 17th Symposium on Foundations of Computer Science, Houston, Texas, October 1976, 109\u2013121.","DOI":"10.1109\/SFCS.1976.27"},{"key":"18_CR23","first-page":"227","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"SALWICKI, A. Formalized Algorithmic Languages, Bull. Acad. Pol. Sci.,Ser. Math. Astr. Phys. 18, 1970, 227\u2013232.","journal-title":"Bull. Acad. Pol. Sci.,Ser. Math. Astr. Phys."},{"key":"18_CR24","first-page":"403","volume-title":"To H. B. Curry: Essays on Combinatory Logic","author":"D. S. Scott","year":"1980","unstructured":"SCOTT, D. S. Relating Theories of the %1-Calculus, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, eds. Seldin and Hindley, Academic Press, New York, 1980, 403\u2013450."},{"key":"18_CR25","first-page":"445","volume-title":"Logic Colloquium 73","author":"J.C. Shepherdson","year":"1973","unstructured":"SHEPHERDSON, J.C., Computing over abstract structures: serial and parallel procedures and Friedman's effective definitional schemes, In Shepherdson and Rose (eds.) Logic Colloquium 73. North-Holland, Amsterdam, 1973, pp. 445\u2013513."},{"key":"18_CR26","unstructured":"TIURYN, J., A Survey of the Logic of Effective Definitions, MIT\/LCS\/TR-246, MIT, Laboratory For Computer Science, Cambridge, Mass., September"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"TIURYN, J., Unbounded program memory adds to expressive power of first-order Dynamic Logic, Proceedings 22nd IEEE Symposium on Foundations of Computer Science, Nashville, Tennessee, October 1981, to appear.","DOI":"10.1109\/SFCS.1981.54"}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:04:22Z","timestamp":1558271062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540112129","9783540390473"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0025787","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}