{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:23:28Z","timestamp":1736659408218,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"},{"type":"electronic","value":"9783540472933"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992]]},"DOI":"10.1007\/bfb0084791","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"176-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Preserving specific properties in program development"],"prefix":"10.1007","author":[{"given":"F. A.","family":"Stomp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Lamport. The existence of refinement mappings. In Proc. of the 3rd IEEE Conference on Logic in Computer Science, pages 165\u2013175, 1988.","DOI":"10.1109\/LICS.1988.5115"},{"key":"14_CR2","unstructured":"R. J. R. Back. Changing data representation in the refinement calculus. In 21st Hawaii International Conference on System Sciences, 1989."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"R. J. R. Back. A method for refining atomicity in parallel algorithms. In PARLE89, pages 199\u201316, 1989.","DOI":"10.1007\/3-540-51285-3_42"},{"key":"14_CR4","unstructured":"R. J. R. Back. Refinement calculus, part ii: Parallel and reactive programs. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS, pages 67\u201393, 1990."},{"key":"14_CR5","unstructured":"R. J. R. Back and R. Kurki-Suonio. Superposition and fairness in action system refinement. Unpublished Manuscript, 1991."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"R. J. R. Back and K. Sere. Stepwise refinement of action systems. In Proc. of Math. of Program Construction, volume 375 of LNCS, 1989.","DOI":"10.1007\/3-540-51305-1_7"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF00291051","volume":"25","author":"R.J.R. Back","year":"1988","unstructured":"R.J.R. Back. A calculus of refinements for program derivations. Acta Informatica, 25:593\u2013624, 1988.","journal-title":"Acta Informatica"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/579.587","volume":"6","author":"M. Ben-Ari","year":"1984","unstructured":"M. Ben-Ari. Algorithms for on-the-fly garbage collection. Transactions of Programming Languages and Systems, 6(3):333\u2013344, 1984.","journal-title":"Transactions of Programming Languages and Systems"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. on Comp. Syst., 3(1):63\u201375, 1985.","journal-title":"ACM Trans. on Comp. Syst."},{"key":"14_CR10","unstructured":"K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley Publishing Company, Inc., 1988."},{"key":"14_CR11","series-title":"volume 430 of LNCS","volume-title":"Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness","year":"1990","unstructured":"J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors. Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS. Springer Verlag (Berlin), 1990."},{"key":"14_CR12","unstructured":"E. Diepstraten and R. Kuiper. Abadi & Lamport and Stark: Toward a proof theory for stuttering, dense domains and refinement mappings. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS, pages 208\u2013238, 1990."},{"issue":"11","key":"14_CR13","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1145\/359642.359655","volume":"21","author":"E. W. Dijkstra","year":"1987","unstructured":"E. W. Dijkstra, L. Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. On the fly garbage collection: An exercise in cooperation. Communications of the ACM, 21(11):966\u2013975, 1987.","journal-title":"Communications of the ACM"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E. W. Dijkstra","year":"1980","unstructured":"E. W. Dijkstra and C. S. Scholten. Termination detecting for diffusing computations. Information Processing Letters, 11(1):1\u20134, 1980.","journal-title":"Information Processing Letters"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and Srinivasan J. Branching time temporal logic. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, volume 354 of LNCS, pages 123\u2013172, 1988.","DOI":"10.1007\/BFb0013022"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"N. Francez. Distributed termination. Transactions of Programming Languages and Systems, 2(1):42\u201355, 1980.","journal-title":"Transactions of Programming Languages and Systems"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"R. Gerth. Foundations of compositional program refinement. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS, pages 777\u2013808, 1990.","DOI":"10.1007\/3-540-52559-9_87"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C. A. R. Hoare","year":"1972","unstructured":"C. A. R. Hoare. Proofs of correctness of data representations. Acta Informatica, 1(4):271\u2013281, 1972.","journal-title":"Acta Informatica"},{"key":"14_CR20","unstructured":"C. B. Jones. Software Development. Prentice-Hall International, 1980."},{"key":"14_CR21","volume-title":"PhD thesis","author":"B. Jonsson","year":"1987","unstructured":"B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Department of Computer Science, Uppsala University, Uppsala, Sweden, 1987."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"S. Katz and D. Peled. Interleaving set temporal logic. In Proc. of the 6th ACM Symposium on Distributed Computing, pages 178\u2013190, 1987.","DOI":"10.1145\/41840.41855"},{"issue":"5","key":"14_CR23","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/TSE.1987.233199","volume":"13","author":"S. Katz","year":"1987","unstructured":"S. Katz and O. Shmueli. Cooperative distributed algorithms for dynamic cycle prevention. IEEE Transactions on Software Engeneering, 13(5):540\u2013552, 1987.","journal-title":"IEEE Transactions on Software Engeneering"},{"key":"14_CR24","volume-title":"PhD thesis","author":"N. Klarlund","year":"1990","unstructured":"N. Klarlund. Progress Measures and Finite Arguments for Infinite Computations. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, USA, 1990. Also published as Technical Report 90-1153, Cornell University."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"S. S. Lam and A. U. Shankar. Refinement and projection of relational projections. In J. W. de Bakker, W. P. de Roever, and Rozenberg G., editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS, pages 454\u2013487, 1990.","DOI":"10.1007\/3-540-52559-9_75"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"L. A. Lynch. Multivalued possibility mappings. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS, pages 519\u2013543, 1990.","DOI":"10.1007\/3-540-52559-9_77"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"L. A. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. of the 6th ACM Symposium on Distributed Computing, pages 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"14_CR28","unstructured":"Z. Manna and A. Pnueli. Verification of concurrent programs: A temporal proof system. foundations of computer science iv, part 2. MC-tracts, 159, 1983."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"R. Meritt. Completeness theorems for automata. In J. W. de Bakker, W. P. de Roever, and Rozenberg G., editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS, pages 544\u2013560, 1990.","DOI":"10.1007\/3-540-52559-9_78"},{"issue":"3","key":"14_CR30","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/44501.44503","volume":"10","author":"C. Morgan","year":"1988","unstructured":"C. Morgan. The specification statement. Transactions of Programming Languages and Systems, 10(3):403\u2013419, 1988.","journal-title":"Transactions of Programming Languages and Systems"},{"key":"14_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61512-2","volume-title":"Specification and Transformation of Programs \u2014 A Formal Approach to Software Development","author":"H. Partsch","year":"1990","unstructured":"H. Partsch. Specification and Transformation of Programs \u2014 A Formal Approach to Software Development. Springer Verlag (Berlin), 1990."},{"key":"14_CR32","unstructured":"B. Sanders. Stepwise refinement of mixed specifications of concurrent programs. In M. Broy and C. B. Jones, editors, Proceedings of the IFIP TC2 Conference on Programming Concepts and Methods. Elsevier Science Publishers B. V., 1990."},{"key":"14_CR33","volume-title":"PhD thesis","author":"K. Sere","year":"1990","unstructured":"K. Sere. Stepwise Refinement of Parallel Programs. PhD thesis, Department of Computer Science, \u00c5bo Akademi, Turku, Finland, 1990."},{"key":"14_CR34","volume-title":"Technical Report SFB 124-07\/1991","author":"Z. Shengzong","year":"1991","unstructured":"Z. Shengzong. Compositional temporal logic specifications. Technical Report SFB 124-07\/1991, Universit\u00e4t des Saarlandes, Deparment of Computer Science, Saarbr\u00fccken, Germany, 1991."},{"key":"14_CR35","volume-title":"Technical Report SFB 124-06\/1991","author":"Z. Shengzong","year":"1991","unstructured":"Z. Shengzong. UNITY-like logic programming. Technical Report SFB 124-06\/1991, Universit\u00e4t des Saarlandes, Deparment of Computer Science, Saarbr\u00fccken, Germany, 1991."},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"A. K. Singh. Program refinement in fair transition systems. In E. H. L. Aarts, J. van Leeuwen, and M. Rem, editors, Parallel Architectures and Languages Europe 1991, volume 506 of LNCS, pages 128\u2013147, 1991.","DOI":"10.1007\/3-540-54152-7_62"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"F. A. Stomp. A derivation of a broadcasting protocol using sequentially phased reasoning. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of LNCS, pages 696\u2013730, 1990.","DOI":"10.1007\/3-540-52559-9_84"},{"key":"14_CR38","volume-title":"Protocol Specification, Testing, and Verification, X","author":"F. A. Stomp","year":"1990","unstructured":"F. A. Stomp. A derivation of a broadcasting protocol using sequentially phased reasoning (extended abstract). In L. Logrippo, R. L. Probert H., and Ural, editors, Protocol Specification, Testing, and Verification, X. Elsevier Science Publishers B. V. (North-Holland), 1990."},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"F. A. Stomp. Preserving specific properties in program development-How to debug programs-(journal version). In preparation, 1992.","DOI":"10.1007\/BFb0084791"},{"key":"14_CR40","volume-title":"Technical report","author":"F. A. Stomp","year":"1992","unstructured":"F. A. Stomp. Preserving specific properties in program development-How to debug programs-. Technical report, Christian Albrechts Universit\u00e4t, Kiel, Germany, 1992. To appear."},{"issue":"4","key":"14_CR41","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0020-0190(87)90135-9","volume":"24","author":"J. Snepscheut van de","year":"1987","unstructured":"J. van de Snepscheut. \u201cAlgorithms for on-the-fly garbage collection\u201d revisited. Information Processing Letters, 24(4):211\u2013216, 1987.","journal-title":"Information Processing Letters"},{"key":"14_CR42","doi-asserted-by":"crossref","unstructured":"J. L. Welch, L. Lamport, and N. A. Lynch. A lattice-structured proof of a minimum spanning tree algorithm. In Proc. of the 7th ACM Symposium on Distributed Computing, pages 28\u201343, 1988.","DOI":"10.21236\/ADA198312"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:54Z","timestamp":1736654154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084791"}},"subtitle":["How to debug programs (Conference version)"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558224","9783540472933"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/bfb0084791","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"30 September 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}