{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:22Z","timestamp":1725663682731},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512851"},{"type":"electronic","value":"9783540461845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51285-3_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:51:50Z","timestamp":1330185110000},"page":"406-423","source":"Crossref","is-referenced-by-count":0,"title":["Compositionality in the temporal logic of concurrent systems"],"prefix":"10.1007","author":[{"given":"F. S.","family":"Boer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, A. Pnueli (1984). Now you may compose temporal logic specifications, Proc. 16th ACM Symp. on Theory of Computing, pp. 51\u201363.","DOI":"10.1145\/800057.808665"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, A. Pnueli (1986) A really abstract concurrent model and its temporal logic, Proc. 13th ACM Symp. on Principles of Programming Languages, pp. 173\u2013183.","DOI":"10.1145\/512644.512660"},{"key":"27_CR3","unstructured":"E.W. Dijkstra (1976). A discipline of programming, Prentice Hall."},{"issue":"8","key":"27_CR4","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1981","unstructured":"C.A.R. Hoare (1981). Communicating sequential processes, CACM, Vol. 21, No. 8, pp. 666\u2013677.","journal-title":"CACM"},{"key":"27_CR5","unstructured":"D. Harel, D. Kozen, R. Parikh (1980). Process logic: expressiveness, decidability, completeness, 21th Symp. on Foundations of Comp. Sc., Syracus, New York, pp. 129\u2013142."},{"key":"27_CR6","unstructured":"J. Halpern, Z. Manna, B. Moszkowski (1983). A hardware semantics based on temporal intervals, Automata Languages and Programming, 10th Colloquium, No. 154, pp. 278\u2013291."},{"key":"27_CR7","volume-title":"Logics and Models of Concurrent Systems","author":"L. Lamport","year":"1985","unstructured":"L. Lamport (1985). An axiomatic semantics of concurrent programming languages, Logics and Models of Concurrent Systems, edited by K.R. Apt, Springer-Verlag Berlin Heidelberg."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF00289062","volume":"14","author":"L. Lamport","year":"1980","unstructured":"L. Lamport (1980). The Hoare logic of concurrent programs, Acta Informatica, Vol. 14, pp 21\u201337.","journal-title":"Acta Informatica"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli (1983). How to cook a temporal proof system for your pet language, Proc. 10th ACM POPL.","DOI":"10.1145\/567067.567082"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"V. Nguyen, D. Gries, S. Owicki (1985), A model and temporal proof system for network of processes, 12th ACM Symp. on Principles of Programming, pp. 121\u2013131.","DOI":"10.1145\/318593.318624"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki, D. Gries (1976), An axiomatic proof technique for concurrent parallel programs, Acta Informatica, No. 6, pp. 319\u2013340.","journal-title":"Acta Informatica"},{"key":"27_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198243113.001.0001","volume-title":"Past, present and future","author":"A. Prior","year":"1967","unstructured":"A. Prior (1967). Past, present and future, Oxford University Press, London."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"A. Pnueli (1977). The temporal logic of programs, 18th IEEE Symp. Foundations of Computer Science, pp.46\u201357.","DOI":"10.1109\/SFCS.1977.32"},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski (1955), A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math., No. 5, pp. 285\u2013309.","journal-title":"Pacific J. Math."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"P. Wolper (1981), Temporal logic can be more expressive, 22th Annual Symp. on Foundations of Computer Science, pp. 340\u2013347.","DOI":"10.1109\/SFCS.1981.44"},{"key":"27_CR16","first-page":"509","volume":"194","author":"J. Zwiers","year":"1985","unstructured":"J. Zwiers, W.P. de Roever, P. van Emde Boas (1985). Compositionality and concurrent networks: soundness and completeness of a proof system, Automata, Languages and Programming (ICALP), 12th Colloquium, Napflion, Greece, Vol. 194, pp. 509\u2013519.","journal-title":"Automata, Languages and Programming (ICALP)"}],"container-title":["Lecture Notes in Computer Science","PARLE '89 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51285-3_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:02:31Z","timestamp":1619557351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51285-3_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512851","9783540461845"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-51285-3_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}