{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:37Z","timestamp":1725663457901},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540541523"},{"type":"electronic","value":"9783540474722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54152-7_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:34:27Z","timestamp":1330191267000},"page":"128-147","source":"Crossref","is-referenced-by-count":2,"title":["Program refinement in fair transition systems"],"prefix":"10.1007","author":[{"given":"Ambuj K.","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., and L. Lamport, The Existence of Refinement Mappings, Proceedings of the 3rd IEEE Symposium on Logic in Computer Science, 1988, pp. 165\u2013175.","DOI":"10.1109\/LICS.1988.5115"},{"key":"8_CR2","unstructured":"Back, R. J. R., Correctness Preserving Program Refinements: Proof Theory and Applications, Mathematical Center Tracts, 131, Center for Mathematics and Computer Science (CWI), Amsterdam, 1980."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Back, R. J. R., A Method for Refining Atomicity in Parallel Algorithms, Parallel Architectures and Languages Europe 1989, Eindhoven, June 1989, pp. 199\u2013216.","DOI":"10.1007\/3-540-51285-3_42"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6423(90)90069-P","volume":"13","author":"R. J. R. Back","year":"1989","unstructured":"Back, R. J. R., and K. Sere, Stepwise Refinement of Parallel Algorithms, Science of Computer Programming, 13, 1989\u201390, pp. 133\u2013180.","journal-title":"Science of Computer Programming"},{"key":"8_CR5","volume-title":"Parallel Program Design: A Foundation","author":"K. M. Chandy","year":"1988","unstructured":"Chandy, K. M., and J. Misra, Parallel Program Design: A Foundation, Reading, Massachusetts: Addison-Wesley, 1988."},{"key":"8_CR6","volume-title":"A Discipline of Programming","author":"E. W. Dijkstra","year":"1976","unstructured":"Dijkstra, E. W., A Discipline of Programming, Englewood Cliffs, New Jersey: Prentice-Hall, 1976."},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E. A. Emerson","year":"1986","unstructured":"Emerson, E. A., and J. Y. Halpern, \u201cSometimes\u201d and \u201cNot Never\u201d Revisited: On Branching Time versus Linear Time Temporal Logic, Journal of the ACM, 33(1), January 1986, pp. 151\u2013178.","journal-title":"Journal of the ACM"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R. W. Floyd","year":"1967","unstructured":"Floyd, R. W., Assigning Meaning to Programs, Proceedings of American Mathematical Society Symposia in Applied Mathematics, 19, 1967, pp. 19\u201332.","journal-title":"Proceedings of American Mathematical Society Symposia in Applied Mathematics"},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"D. Gries","year":"1981","unstructured":"Gries, D., The Science of Programming, New York: Springer-Verlag, 1981."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare, C. A. R., An Axiomatic Basis for Computer Programming, Communications of the ACM, 12, 1969, pp. 576\u2013580.","journal-title":"Communications of the ACM"},{"issue":"4","key":"8_CR11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C. A. R. Hoare","year":"1972","unstructured":"Hoare, C. A. R., Proofs of Correctness of Data Representations, Acta Informatica, 1(4), 1972, pp. 271\u2013281.","journal-title":"Acta Informatica"},{"key":"8_CR12","volume-title":"Systematic Software Development Using VDM","author":"C. B. Jones","year":"1986","unstructured":"Jones, C. B., Systematic Software Development Using VDM, Englewood Cliffs, N.J.: Prentice Hall, 1986."},{"issue":"4","key":"8_CR13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TSE.1984.5010246","volume":"10","author":"S. S. Lam","year":"1984","unstructured":"Lam, S. S., and A. U. Shankar, Protocol Verification via Projections, IEEE Transactions on Software Engineering, 10(4), July 1984, pp. 325\u2013342.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"8_CR14","unstructured":"Lamport, L., and F. Schneider, Pretending Atomicity, Technical Report TR-89-1005, Department of computer Science, Cornell University, May 1989."},{"issue":"1","key":"8_CR15","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/63238.63240","volume":"32","author":"L. Lamport","year":"1989","unstructured":"Lamport, L., A Simple Approach to Specifying Concurrent Systems, Communications of the ACM, 32:1, Jan. 1989, pp. 32\u201347.","journal-title":"Communications of the ACM"},{"issue":"12","key":"8_CR16","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1145\/361227.361234","volume":"18","author":"R. J. Lipton","year":"1975","unstructured":"Lipton, R. J., Reduction: A Method For Proving Properties of Parallel Programs, Communications of the ACM, 18(12), Dec. 1975, pp. 717\u2013721.","journal-title":"Communications of the ACM"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Lynch, N., and M. R. Tuttle, Hierarchical Correctness Proofs for Distributed Algorithms, Proc. Sixth Annual ACM Symposium on the Principles of Distributed Computing, 1987, pp. 137\u2013151.","DOI":"10.1145\/41840.41852"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Manna, Z., and A. Pnueli, How to Cook a Temporal Proof System for Your Pet language, Proceedings of the 9th ACM Symposium on Principles of Programming Languages, 1983, pp. 141\u2013154.","DOI":"10.1145\/567067.567082"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0167-6423(84)90003-0","volume":"4","author":"Z. Manna","year":"1984","unstructured":"Manna, Z., and A. Pnueli, Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs, Science of Computer Programming, 4, 1984, pp. 257\u2013289.","journal-title":"Science of Computer Programming"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Martin, A. J., Compiling Communicating Processes into Delay-Insensitive VLSI Circuits, Journal of Distributed Computing, 1(3), 1986.","DOI":"10.1007\/BF01660034"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R., Calculi for Synchrony and Asynchrony, Theoretical Computer Science, 25,1983, pp. 267\u2013310.","journal-title":"Theoretical Computer Science"},{"key":"8_CR22","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., and D. Gries, An Axiomatic Proof Technique for Parallel Programs I, Acta Informatica, 6, 1976, pp. 319\u2013340.","journal-title":"Acta Informatica"},{"key":"8_CR23","unstructured":"Sanders, B., Stepwise Refinement of Mixed Specifications of Concurrent Programs, Proceedings of IFIP Conference on Programming Concepts and Methods, Israel, April 1990, eds. M. Broy and C. B. Jones, Elsevier Science Publishers B. V. 1990."},{"key":"8_CR24","volume-title":"System Timing, in Introduction to VLSI Systems","author":"C. Seitz","year":"1980","unstructured":"Seitz, C., System Timing, in Introduction to VLSI Systems, eds. C. Mead and L. Conway, Reading, Massachusetts: Addison-Wesley, 1980."},{"issue":"6","key":"8_CR25","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01381718","volume":"18","author":"A. K. Singh","year":"1989","unstructured":"Singh, A. K., and R. Overbeek, Derivation of Efficient Parallel Programs: An Example from Genetic Sequence Analysis, International Journal of Parallel Programming, 18(6), Dec. 1989, pp. 447\u2013484.","journal-title":"International Journal of Parallel Programming"},{"key":"8_CR26","unstructured":"Singh, A. K., Program Refinement in Fair Transition Systems, Technical Report 91-2, University of California at Santa Barbara, March 1991."},{"key":"8_CR27","volume-title":"Leads-to and Program Union, Notes on Unity: 06-89","author":"A. K. Singh","year":"1989","unstructured":"Singh, A. K., Leads-to and Program Union, Notes on Unity: 06-89, The University of Texas at Austin, Texas, May 1989."},{"key":"8_CR28","volume-title":"On Strengthening the Guard, Notes on Unity: 07-89","author":"A. K. Singh","year":"1989","unstructured":"Singh, A. K., On Strengthening the Guard, Notes on Unity: 07-89, The University of Texas at Austin, Texas, June 1989."}],"container-title":["Lecture Notes in Computer Science","PARLE '91 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54152-7_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:52:41Z","timestamp":1605628361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54152-7_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541523","9783540474722"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-54152-7_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}