{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:30:08Z","timestamp":1778520608630,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540156703","type":"print"},{"value":"9783540395935","type":"electronic"}],"license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985]]},"DOI":"10.1007\/3-540-15670-4_6","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:23:58Z","timestamp":1330194238000},"page":"111-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":76,"title":["Executing temporal logic programs"],"prefix":"10.1007","author":[{"given":"Ben","family":"Moszkowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/0205029","volume":"5","author":"E. A. Ashcroft","year":"1976","unstructured":"E. A. Ashcroft and W. W. Wadge. Lucid: A formal system for writing and proving programs. SIAM Journal of Computing 5, 3 (September 1976), 336\u2013354.","journal-title":"SIAM Journal of Computing"},{"issue":"7","key":"6_CR2","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/359636.359715","volume":"20","author":"E. A. Ashcroft","year":"1977","unstructured":"E. A. Ashcroft and W. W. Wadge. \u201cLucid, a nonprocedural language with iteration.\u201d Communications of the ACM 20, 7 (July 1977), 519\u2013526.","journal-title":"Communications of the ACM"},{"key":"6_CR3","unstructured":"E. A. Ashcroft and W. W. Wadge. Lucid, the Data Flow Programming Language, to be published."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"A. Chandra, J. Halpern, A. Meyer, and R. Parikh. Equations between regular terms and an application to process logic. Proceedings of the 13-th Annual ACM Symposium on Theory of Computing, Milwaukee, Wisconsin, May, 1981, pages 384\u2013390.","DOI":"10.1145\/800076.802493"},{"key":"6_CR5","unstructured":"J. Halpern, Z. Manna and B. Moszkowski. A hardware semantics based on temporal intervals. Proceedings of the 10-th International Colloquium on Automata, Languages and Programming, Barcelona, Spain, July, 1983."},{"key":"6_CR6","series-title":"in the series Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09237-4","volume-title":"First-Order Dynamic Logic","author":"D. Harel","year":"1979","unstructured":"D. Harel. First-Order Dynamic Logic. Number 68 in the series Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1979."},{"issue":"2","key":"6_CR7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(82)90003-4","volume":"25","author":"D. Harel","year":"1982","unstructured":"D. Harel, D. Kozen, and R. Parikh. \u201cProcess logic: Expressiveness, decidability, completeness.\u201d Journal of Computer and System Sciences 25, 2 (October 1982), pages 144\u2013170.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"6_CR8","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/69610.357988","volume":"27","author":"E. C. R. R. Hehner","year":"1984","unstructured":"E. C. R. Hehner. \u201cPredicative programming (parts I and II).\u201d Communications of the ACM 27, 2 (February 1984), pages 134\u2013151.","journal-title":"Communications of the ACM"},{"issue":"10","key":"6_CR9","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. R. Hoare","year":"1969","unstructured":"C. A. R. Hoare. \u201cAn axiomatic basis for computer programming.\u201d Communications of the ACM 12, 10 (October 1969), pages 576\u2013580, 583.","journal-title":"Communications of the ACM"},{"key":"6_CR10","first-page":"61","volume-title":"Operating Systems Techniques","author":"C. A. R. R. Hoare","year":"1972","unstructured":"C. A. R. Hoare. Towards a theory of parallel programming. In C. A. R. Hoare and R. H. Perrott, editors, Operating Systems Techniques, pages 61\u201371. Academic Press, London, 1972."},{"issue":"8","key":"6_CR11","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. R. Hoare","year":"1978","unstructured":"C. A. R. Hoare. \u201cCommunicating sequential processes.\u201d Communications of the ACM 21, 8 (August 1978), pages 666\u2013677.","journal-title":"Communications of the ACM"},{"key":"6_CR12","first-page":"215","volume-title":"The Correctness Problem in Computer Science","author":"Z. Manna","year":"1981","unstructured":"Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. S. Boyer and J. S. Moore, editors, The Correctness Problem in Computer Science, pages 215\u2013273, Academic Press, New York, 1981."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. How to cook your favorite programming language in temporal logic. Proceedings of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, January, 1983, pages 141\u2013154.","DOI":"10.1145\/567067.567082"},{"issue":"1","key":"6_CR14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","volume":"6","author":"Z. Manna","year":"1984","unstructured":"Z. Manna and P. L. Wolper. \u201cSynthesis of computing processes from temporal logic specifications.\u201d ACM Transactions on Programming Languages and Systems 6, 1 (January 1984), pages 68\u201393.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR15","unstructured":"B. Mishra and E. M. Clarke, Automatic and hierarchical verification of asynchronous circuits using temporal logic. Technical report CMU-CS-83-155, Department of Computer Science, Carnegie-Mellon University, September, 1983."},{"key":"6_CR16","unstructured":"B. Moszkowski. Reasoning about Digital Circuits. PhD Thesis, Department of Computer Science, Stanford University, 1983."},{"key":"6_CR17","unstructured":"B. Moszkowski. A temporal analysis of some concurrent systems. To appear in the proceedings of the STL Workshop on Concurrency, Cambridge, England, September, 1983."},{"key":"6_CR18","unstructured":"B. Moszkowski and Z. Manna. Reasoning in interval temporal logic. Technical report STAN-CS-83-969, Department of Computer Science, Stanford University, July, 1983."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"V. R. Pratt, Semantical considerations on Floyd-Hoare logic. Proceedings of the 17-th Annual IEEE Symposium on Foundations of Computer Science, Houston, Texas, October, 1976, pages 109\u2013121.","DOI":"10.1109\/SFCS.1976.27"},{"key":"6_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-7664-1","volume-title":"Temporal Logic","author":"N. Rescher","year":"1971","unstructured":"N. Rescher and A. Urquart. Temporal Logic. Springer-Verlag, New York, 1971."},{"key":"6_CR21","first-page":"425","volume-title":"Proceedings of IFIP Congress 83","author":"C. Tang","year":"1983","unstructured":"C. Tang. Toward a unified logic basis for programming languages. Proceedings of IFIP Congress 83, Elsevier Science Publishers B.V. (North-Holland), Amsterdam, 1983, pages 425\u2013429."}],"container-title":["Lecture Notes in Computer Science","Seminar on Concurrency"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15670-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:22:54Z","timestamp":1742588574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15670-4_6"}},"subtitle":["preliminary version"],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156703","9783540395935"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-15670-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}