{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:10Z","timestamp":1725663250661},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156703"},{"type":"electronic","value":"9783540395935"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15670-4_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:23:22Z","timestamp":1330194202000},"page":"35-61","source":"Crossref","is-referenced-by-count":15,"title":["Hierarchical development of concurrent systems in a temporal logic framework"],"prefix":"10.1007","author":[{"given":"Howard","family":"Barringer","sequence":"first","affiliation":[]},{"given":"Ruurd","family":"Kuiper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"2_CR1","unstructured":"P.Aczel On an Inference Rule for Parallel Composition Internal Memo Department of Mathematics, University of Manchester, 1983."},{"key":"2_CR2","unstructured":"H.Barringer and R.Kuiper Towards the Hierarchical, Temporal Logic, Specification of Concurrent Systems Proc. of the STL\/SERC Workshop on the Analysis of Concurrent Systems Cambridge, September 1983."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"H.Barringer, R.Kuiper and A.Pnueli Now You May Compose Temporal Logic Specifications Proc. of the 16th ACM Symposium on the Theory of Computing Washington, May 1984.","DOI":"10.1145\/800057.808665"},{"key":"2_CR4","unstructured":"H.Barringer, R.Kuiper and A.Pnueli A Compositional Temporal Approach to a CSP-like Language Internal Report Department of Computer Science, University of Manchester, Oct. 1984."},{"key":"2_CR5","unstructured":"G.D.Gough Decision Procedures for Temporal Logic M.Sc. Dissertation Department of Computer Science, University of Manchester, Oct. 1984."},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TCOM.1983.1095720","volume":"COM-31","author":"B. T. Hailpern","year":"1983","unstructured":"B.T. Hailpern and S.S. Owicki Modular Verification of Computer Communication Protocols IEEE Trans. on Commun. COM-31, 1, Jan. 1983, pp56\u201368.","journal-title":"IEEE Trans. on Commun."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6423(81)90005-8","volume":"1","author":"C. A. R. R. Hoare","year":"1981","unstructured":"C.A.R. Hoare A Calculus of Total Correctness for Communicating Processes Science of Computer Programming, 1, 1981, pp49\u201372.","journal-title":"Science of Computer Programming"},{"key":"2_CR8","first-page":"321","volume-title":"Specification and Design of (Parallel) Programs Proc. IFIP 83","author":"C. B. Jones","year":"1983","unstructured":"C.B. Jones Specification and Design of (Parallel) Programs Proc. IFIP 83, Paris, North Holland, 1983, pp321\u2013332."},{"issue":"2","key":"2_CR9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"L. Lamport Specifying Concurrent Program Modules ACM TOPLAS, Apr 1983, Vol. 5, No. 2, 1983, pp190\u2013222.","journal-title":"ACM TOPLAS"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF00289266","volume":"15","author":"G. M. Levin","year":"1981","unstructured":"G.M. Levin and D. Gries A Proof Technique for Communicating Sequential Processes Acta Informatica 15, 1981, pp281\u2013302.","journal-title":"Acta Informatica"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J.Misra and K.M.Chandy Proofs about Networks of Processes IEEE TOSE Vol SE-7, No. 4, July 1981.","DOI":"10.1109\/TSE.1981.230844"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"J.Misra, K.M.Chandy and T.Smith Proving Safety and Liveness of Communicating Processes with Examples Proc. 1st ACM SIGACP\/SIGOPS Symp. on PODC, Ottawa, Aug. 1982.","DOI":"10.1145\/800220.806698"},{"key":"2_CR13","series-title":"International Lecture Notes in Computer Science","first-page":"215","volume-title":"Verification of Concurrent Programs: The Temporal Framework","author":"Z. Manna","year":"1982","unstructured":"Z. Manna and A. Pnueli Verification of Concurrent Programs: The Temporal Framework in \u201cThe Correctness Problem in Computer Science\u201d ed. R.S. Boyer and J.S. Moore International Lecture Notes in Computer Science, pp215\u2013273 Academic Press, London, 1982."},{"key":"2_CR14","unstructured":"Z.Manna and A.Pnueli Verification of Concurrent Programs: A Temporal Proof System Computer Science Report, Stanford University, 1983."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. S. Owicki","year":"1976","unstructured":"S.S. Owicki and D. Gries An Axiomatic Proof Technique for Parallel Programs 1 Acta Informatica, 6, 1976, pp319\u2013340.","journal-title":"Acta Informatica"},{"issue":"3","key":"2_CR16","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. S. Owicki","year":"1982","unstructured":"S.S. Owicki and L. Lamport Proving Liveness Properties of Concurrent Programs ACM TOPLAS, Vol. 4, No. 3, July 1982, pp455\u2013495.","journal-title":"ACM TOPLAS"},{"key":"2_CR17","unstructured":"The Temporal Semantics of Concurrent Computation Proc. of the Symp. on Semantics of Concurrent Computation Evian, France, July 1979 Springer-Verlag, LNCS Vol. 70, pp1\u201320."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"A.Prior Past, Present and Future Oxford University Press, 1967.","DOI":"10.1093\/acprof:oso\/9780198243113.001.0001"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"A.P.Sistla, E.M.Clarke, N.Francez and Y.Gurevich Can Buffers be Specified in Linear Temporal Logic? Proc. 1st ACM SIGACP\/SICOPS Symp. on PODC, Ottawa, Aug. 1982.","DOI":"10.1145\/800220.806692"},{"key":"2_CR20","unstructured":"Sa Jin Temporal Logic Specification of Communication Protocols Ph.D. Transfer Report Department of Computer Science, University of Manchester, Sep. 1984."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"P.Wolper Temporal Logic can be more Expressive Proc. of the 22nd Symp. on FOCS, Oct. 1981.","DOI":"10.1109\/SFCS.1981.44"},{"key":"2_CR22","unstructured":"Zhou Chao Chen and C.A.R.Hoare Partial Correctness of Communicating Processes and Protocols Proc. of 2nd Int. Conf. on Distributed Computing Systems, 1981."}],"container-title":["Lecture Notes in Computer Science","Seminar on Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15670-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:43Z","timestamp":1605643723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15670-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156703","9783540395935"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-15670-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}