{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:50Z","timestamp":1725456050662},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566625"},{"type":"electronic","value":"9783540476238"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bfb0024635","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T10:09:15Z","timestamp":1132740555000},"page":"19-41","source":"Crossref","is-referenced-by-count":3,"title":["Using relative refinement for fault tolerance"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Cau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem-Paul","family":"de Roever","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Lamport. The existence of refinement mappings. In Third annual symposium on Logic in Computer Science, pages 165\u2013175, July 1988.","DOI":"10.1109\/LICS.1988.5115"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"B. Alpern and F.B. Schneider. Defining liveness. Information Processing Letters, 21(4):181\u2013185, 1985.","journal-title":"Information Processing Letters"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"A. Cau, R. Kuiper, and W.-P. de Roever. Formalising Dijkstra's development strategy within Stark's formalism. In R. C. Shaw C. B. Jones and Tim Denvir, editors, Proc. 5th. BCS-FACS Refinement Workshop, 1992.","DOI":"10.1007\/978-1-4471-3550-0_3"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"E. Diepstraten and R. Kuiper. Abadi & Lamport and Stark: towards a proof theory for stuttering, dense domains and refinements mappings. In LNCS 430:Proc. of the REX Workshop on Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, pages 208\u2013238. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52559-9_66"},{"key":"2_CR5","unstructured":"E.W. Dijkstra. A tutorial on the split binary semaphore, 1979. EWD 703."},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"P.A. Lee and T. Anderson. Fault Tolerance Principles and Practice, volume 3 of Dependable Computing and Fault-Tolerant Systems. Springer-Verlag, second, revised edition, 1990.","DOI":"10.1007\/978-3-7091-8990-0"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"S. Lee, S. Gerhart, and W.-P. de Roever. The evolution of list-copying algorithms and the need for structured program verification. In Proc. of 6th POPL, 1979.","DOI":"10.1145\/567752.567758"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"P.R.H. Place, W.G. Wood, and M. Tudball. Survey of formal specification techniques for reactive systems. Technical Report, 1990.","DOI":"10.21236\/ADA232045"},{"key":"2_CR10","unstructured":"H. Schepers. Terminology and Paradigms for Fault Tolerance. Computing Science Notes 91\/08 of the Department of Mathematics and Computing Science Eindhoven University of Technology, 1991."},{"key":"2_CR11","unstructured":"E.W. Stark. Foundations of a Theory of Specification for Distributed Systems. PhD thesis, Massachusetts Inst. of Technology, 1984. Available as Report No. MIT\/LCS\/TR-342."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"E.W. Stark. A Proof Technique for Rely\/Guarantee Properties. In LNCS 206: Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, pages 369\u2013391. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-16042-6_21"}],"container-title":["Lecture Notes in Computer Science","FME '93: Industrial-Strength Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:53:24Z","timestamp":1586580804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566625","9783540476238"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0024635","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}