{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:21:19Z","timestamp":1648754479090},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","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":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bf00625282","type":"journal-article","created":{"date-parts":[[2004,11,26]],"date-time":"2004-11-26T04:08:10Z","timestamp":1101442090000},"page":"79-108","source":"Crossref","is-referenced-by-count":13,"title":["On termination problems for finitely interpreted ALGOL-like programs"],"prefix":"10.1007","volume":"18","author":[{"given":"Hans","family":"Langmaack","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Apt, K.R.: A sound and complete Hoare-like system for a fragment of PASCAL. Math. Centrum IW 96\/78, Amsterdam, 59 pp. 1978"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Apt, K.R.: Ten years of Hoare's logic: A survey-part I. Fac. Econom., Erasmus Univ. Rotterdam, 43 pp. 1979; ACM TOPLAS3, 431?483 (1981)","DOI":"10.1145\/357146.357150"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"J.R. B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, J.R.: Regular canonical systems. Arch. Math. Logik Grundlagenforsch.6, 91?111 (1964)","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"issue":"1","key":"CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/322108.322121","volume":"26","author":"E.M. Clarke Jr.","year":"1979","unstructured":"Clarke, E.M., Jr.: Programming Language constructs for which it is impossible to obtain good Hoare axiom systems. J. ACM26, 1, 129?147 (1979)","journal-title":"J. ACM"},{"key":"CR5","unstructured":"Clarke, E.M., Jr.: Private letter (1979)"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Jr., German, S.M., Halpern, J.Y.: Effective Axiomatizations of Hoare Logics. Manuscript 1981. Will be published in J. ACM","DOI":"10.1145\/582153.582186"},{"issue":"1","key":"CR7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"S.A. Cook","year":"1978","unstructured":"Cook, S.A.: Soundness and completeness of an axiomatic system for program verification. SIAM J. Comput.7, 1, 70?90 (1978)","journal-title":"SIAM J. Comput."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Damm, W., Fehr, E.: On the power of selfapplication and higher type recursion. In: Aussiello, G., B\u00f6hm, C. (Ed.): Automata, Languages and Programming, 5th Colloquium; Udine, July 1978, Springer LNCS, Vol. 68, 177?191 (1978)","DOI":"10.1007\/3-540-08860-1_14"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01386232","volume":"2","author":"E.W. Dijkstra","year":"1960","unstructured":"Dijkstra, E.W.: Recursive programming. Numer. Math.2, 312?318 (1960)","journal-title":"Numer. Math."},{"issue":"8","key":"CR10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"E.W. Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, non-determinacy and formal derivation of programs. Comm. ACM18, 8, 453?457 (1975)","journal-title":"Comm. ACM"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321371.321385","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: Stack automata and compiling. J. ACM14, 172?201 (1967)","journal-title":"J. ACM"},{"key":"CR12","unstructured":"Gorelick, G.A.: A complete axiomatic system for proving assertions about recursive and nonrecursive programs. Tech. Rep. 75, Dept. Comput. Sci. Univ. Toronto 1975"},{"key":"CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86937-2","volume-title":"Translation of ALGOL 60. Handbook for Automatic Computation, Ib","author":"A.A. Grau","year":"1967","unstructured":"Grau, A.A., Hill, U., Langmaack, H.: Translation of ALGOL 60. Handbook for Automatic Computation, Ib, Springer, Berlin, Heidelberg, New York 1967 14."},{"key":"CR14","series-title":"Lecture Notes Comput. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09237-4","volume-title":"First order dynamic logic","author":"D. Harel","year":"1979","unstructured":"Harel, D.: First order dynamic logic. Lecture Notes Comput. Sci. 68. Springer, Berlin, Heidelberg, New York 1979"},{"key":"CR15","volume-title":"PASCAL user manual and report","author":"K. Jensen","year":"1975","unstructured":"Jensen, K., Wirth, N.: PASCAL user manual and report. Springer, Berlin, Heidelberg, New York 1975"},{"key":"CR16","first-page":"97","volume-title":"Lectzre Notes Comput. Sci. 14","author":"P. Kandzia","year":"1974","unstructured":"Kandzia, P.: On the ?most recent? property of ALGOL-like programs. In: Lectzre Notes Comput. Sci. 14, (Ed.) J. Loeckx, 97?111. Springer, Berlin, Heidelberg, New York 1974"},{"key":"CR17","first-page":"110","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"Langmaack, H.: On correct procedure parameter transmission in higher programming languages. Acta Informat.2, 110?142 (1973)","journal-title":"Acta Informat."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289503","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"Langmaack, H.: On procedures as open subroutines I. Acta Informat.2, 311?333 (1973)","journal-title":"Acta Informat."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00288636","volume":"3","author":"H. Langmaack","year":"1974","unstructured":"Langmaack, H.: On procedures as open subroutines II. Acta Informat.3, 227?241 (1974)","journal-title":"Acta Informat."},{"key":"CR20","first-page":"1","volume-title":"Lecture Notes Comput. Sci. 7","author":"H. Langmaack","year":"1974","unstructured":"Langmaack, H.: Zum Begriff der Modularit\u00e4t von Programmiersprachen. In: Lecture Notes Comput. Sci. 7, (Eds.) B. Schlender, W. Frielinghaus, 1?12. Springer, Berlin, Heidelberg, New York 1974"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Langmaack, H.: On a theory of decision problems in programming languages. In: Blum, E.K., Takasu, S. (Ed.): Proceed. Internat. Conf. Math. Studies Information Processing. RIMS Kyoto University, August 1978; Springer Lecture Notes Comput. Sci.75, 538?559 (1979)","DOI":"10.1007\/3-540-09541-1_38"},{"key":"CR22","unstructured":"Langmaack, H.: A proof of a theorem of Lipton on Hoare logic and applications. Bericht 8003, Inst. Inf. Prakt. Math. Univ. Kiel 1980"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0020-0190(79)90058-9","volume":"9","author":"H. Langmaack","year":"1979","unstructured":"Langmaack, H., Lippe, W.M., Wagner, F.: The formal termination problem for programs with finite ALGOL 68-modes. Information Processing Lett.9, 155?159 (1979)","journal-title":"Information Processing Lett."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Langmaack, H., Olderog, E.R.: Present-day Hoare like Systems for Programming Languages with Procedures: Power, Limits, and most likely Extensions. In: J.W. de Bakker, J. van Leeuwen: Proceed. Autom. Lang. Progr., 7th Coll., Noordwijkerhout, July 1980. Springer LNCS,85, 363?373 (1980)","DOI":"10.1007\/3-540-10003-2_84"},{"key":"CR25","first-page":"141","volume-title":"Proceedings of the 3rd International Symposium on Programming in Paris: Program Transformation","author":"W.M. Lippe","year":"1978","unstructured":"Lippe, W.M., Simon, F.: A formal notion for equivalence of ALGOL-like programs. In: Proceedings of the 3rd International Symposium on Programming in Paris: Program Transformation. Ed. by B. Robinet. Dunod, Paris, 141?158 (1978)"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"Lipton, R.J.: A necessary and sufficient condition for the existence of Hoare logics. In: 18th Symp. Found. Comput. Sci., Ed. IEEE Comp. Soc, IEEE 77 CH1278-1C 1?6 (1977)","DOI":"10.1109\/SFCS.1977.1"},{"issue":"1","key":"CR27","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/942578.807085","volume":"7","author":"C.L. McGowan","year":"1972","unstructured":"McGowan, C.L.: The ?most recent? error: its causes and correction. SIGPLAN Notices7, 1, 191?202 (1972)","journal-title":"SIGPLAN Notices"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Naur, P. (ed.), et al.: Report on the algorithmic language ALGOL 60. Numer. Math.4, 420?453 (1963)","DOI":"10.1007\/BF01386340"},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"Olderog, E.R.: Sound and complete Hoare-like calculi based on copy rules. Bericht 7905, Inst. Inf. Prakt. Math. Univ. Kiel, 57 pp. 1979, Acta Informat.16, 161?197 (1981)","DOI":"10.1007\/BF00261258"},{"key":"CR30","volume-title":"ALGOL 60 implementation","author":"B. Randell","year":"1964","unstructured":"Randell, B., Russell, L.J.: ALGOL 60 implementation. London: Academic Press 1964"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"Wijngaarden, A. van, et al. (Ed.): Revised report on the algorithmic languages ALGOL 68. Acta Informat.5, 1?3, 1?236 (1975)","DOI":"10.1007\/BF00265077"},{"key":"CR32","volume-title":"Doct. Thesis","author":"K.A. Winklmann","year":"1977","unstructured":"Winklmann, K.A.: A theoretical study of some aspects of parameter passing in ALGOL 60 and in similar programming languages. Doct. Thesis, Purdue Univ., Lafayette, Ind. 1977"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00625282.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00625282\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00625282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T09:11:28Z","timestamp":1585991488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00625282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982]]}},"alternative-id":["BF00625282"],"URL":"https:\/\/doi.org\/10.1007\/bf00625282","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982]]}}}