{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:09Z","timestamp":1725664449978},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-58715-2_141","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:41:57Z","timestamp":1330256517000},"page":"402-413","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extending the limits of sequentially phased reasoning"],"prefix":"10.1007","author":[{"given":"M.","family":"Siegel","sequence":"first","affiliation":[]},{"given":"F. A.","family":"Stomp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2), 1991.","DOI":"10.1016\/0304-3975(91)90224-P"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, and A. Pnueli. Now you may compose temporal logic specifications. In Proc. of the 16th Annual ACM Symp. on Theory of Computing, 1984.","DOI":"10.1145\/800057.808665"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unifyied lattice model for the static analysis of programs. In 4th ACM POPL, 1977.","DOI":"10.1145\/512950.512973"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the ACM, 17(11), 1974.","DOI":"10.1145\/361179.361202"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"T. Elrad and N. Francez. Decomposition of distributed programs into communication closed layers. Science of Computer Programming, 2, 1982.","DOI":"10.1016\/0167-6423(83)90013-8"},{"key":"33_CR6","unstructured":"L. Fix, N. Francez, and O. Grumberg. Semantics driven decompositions for the verification of distributed programs. In IFIP TC2 workshop on programming concepts and methods, 1990."},{"key":"33_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"N. Francez. Fairness. Springer Verlag, New York, 1986."},{"key":"33_CR8","unstructured":"R. Gerth, R. Kuiper, and J. Segers. Interface refinement in reactive systems. volume 630 of LNCS. Springer Verlag, 1992."},{"key":"33_CR9","unstructured":"S. Ghosh and M.H. Karaata. A self stabilizing algorithm for graph coloring. In Proceedings of the 29th Allerton Conference on Control, Communication, and Computing, October 1991."},{"key":"33_CR10","unstructured":"F. Harary. Graph Theory. Addison Wesley, 1980."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"W. Janssen, M. Poel, and J. Zwiers. Action systems and action refinement in the development of parallel systems. volume 527 of LNCS. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54430-5_96"},{"key":"33_CR12","unstructured":"W. Janssen, M. Poel, and J. Zwiers. The compositional approach to sequential consistency and lazy caching. In R. Gerth, editor, Verifying sequentially consistent memory. 1993. To be published in a special issue of Distributed Computing."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"W. Janssen and J. Zwiers. From sequential layers to distributed processes \u2014 deriving a minimum weight spanning tree algorithm. In Proceedings of the ACM Symposium on Principles of Distributed Computing, 1992.","DOI":"10.1145\/135419.135461"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"W. Janssen and J. Zwiers. Protocol design by layered decomposition, a compositional approach. In Proceedings Formal Techniques in Real Time and Fault Tolerant Systems, volume 571 of LNCS, 1992.","DOI":"10.1007\/3-540-55092-5_17"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75(3), 1990.","DOI":"10.1016\/0304-3975(90)90096-Z"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"S. Katz and D. Peled. Defining conditional independence using collapses. Theoretical Computer Science, 101, 1992.","DOI":"10.1016\/0304-3975(92)90054-J"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"S. Katz and D. Peled. Verification of distributed programs using representative interleaving sequences. Distributed Computing, 6, 1992.","DOI":"10.1007\/BF02252682"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"33_CR19","unstructured":"A. Mazurkiewicz. Trace semantics, proceedings of an advanced course. volume 354 of LNCS, Bad Honnef, 1989."},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6, 1976.","DOI":"10.1007\/BF00268134"},{"key":"33_CR21","unstructured":"M. Raynal and J.-P. Helary. Synchronization and control of distributed systems and programs. Wiley, 1990."},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"M. Siegel and F. Stomp. Extending the limits of sequentially phased reasoning. Technical Report 9411, University of Kiel, 1994.","DOI":"10.1007\/3-540-58715-2_141"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"F. Stomp. Derivation of a broadcasting protocol using sequentially phased reasoning. volume 430 of LNCS, 1990.","DOI":"10.1007\/3-540-52559-9_84"},{"key":"33_CR24","unstructured":"F. Stomp. Structured design of self-stabilizing programs. Proc. of the 2nd Isreal Symposium on Theory of Computing and Systems, 1993."},{"key":"33_CR25","unstructured":"F. Stomp and W.P. de Roever. A correctness proof of a distributed minimum weight spanning tree algorithm. Proc. of the 7th ICDCS, 1987."},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"F. Stomp and W.P. de Roever. A principle for sequential phased reasoning about distributed algorithms. to appear in: Formal Aspects of Computing, 1994.","DOI":"10.1007\/BF03259394"}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:19:47Z","timestamp":1578507587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_141"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_141","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}