{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299296},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156482"},{"type":"electronic","value":"9783540395270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15648-8_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:20:09Z","timestamp":1330194009000},"page":"1-15","source":"Crossref","is-referenced-by-count":15,"title":["Nonclausal temporal deduction"],"prefix":"10.1007","author":[{"given":"Martin","family":"Abadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zohar","family":"Manna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Cavalli, A., \u201cA method of automatic proof for the specification and verification of protocols,\u201d ACM SIGCOMM 84 Symposium, Montreal, Canada, 1984.","DOI":"10.1145\/800056.802066"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Cavalli, A., and L. Fari\u00f1as del Cerro, \u201cA decision method for linear temporal logic,\u201d Seventh Conference on Automated Deduction, Napa, CA, May 1984, pp. 113\u2013127.","DOI":"10.1007\/978-0-387-34768-4_7"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Gabbay, D., A. Pnueli, S. Shelah and J. Stavi, \u201cThe temporal analysis of fairness,\u201d Seventh ACM Symposium on Principles of Programming Languages, Las Vegas, NV, January 1980, pp. 163\u2013173.","DOI":"10.1145\/567446.567462"},{"key":"1_CR4","unstructured":"Huet, G. P., \u201cConstrained resolution: a complete method for higher order logic,\u201d Ph.D. Thesis, Case Western University, Jennings Computing Center Report 1117, August 1972."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Huet, G. P., \u201cA unification algorithm for typed \u03bb-calculus,\u201d Theoretical Computer Science, Vol. 1, No. 1, pp. 27\u201357.","DOI":"10.1016\/0304-3975(75)90011-0"},{"key":"1_CR6","first-page":"215","volume-title":"The Correctness Problem in Computer Science","author":"Z. Manna","year":"1982","unstructured":"Manna, Z. and A. Pnueli, \u201cVerification of concurrent programs: The temporal framework,\u201d in The Correctness Problem in Computer Science (R.S. Boyer and J S. Moore, eds.), International Lecture Series in Computer Science, Academic Press, London, 1982, pp. 215\u2013273."},{"issue":"1","key":"1_CR7","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/357084.357090","volume":"2","author":"Z. Manna","year":"1980","unstructured":"Manna, Z. and R. Waldinger, \u201cA deductive approach to program synthesis,\u201d ACM Transactions on Programming Languages and Systems, Vol. 2, No. 1, January 1980, pp. 92\u2013121.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"1_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0004-3702(82)90011-X","volume":"18","author":"N. V. Murray","year":"1982","unstructured":"Murray, N. V., \u201cCompletely nonclausal theorem proving,\u201d Artificial Intelligence, Vol. 18, No. 1, pp. 67\u201385, January 1982.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"1_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"J. A. Robinson, \u201cA machine-oriented logic based on the resolution principle,\u201d Journal of the ACM, Vol. 12, No. 1, January 1965, pp. 23\u201341.","journal-title":"Journal of the ACM"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Wolper, P., \u201cTemporal logic can be more expressive,\u201d Proc. 22nd IEEE Symp. on Foundations of Computer Science, Nashville, 1981, pp. 340\u2013348.","DOI":"10.1109\/SFCS.1981.44"}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15648-8_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:31Z","timestamp":1605643711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15648-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156482","9783540395270"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-15648-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}