{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T18:22:06Z","timestamp":1746728526677},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164883"},{"type":"electronic","value":"9783540398271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/bfb0027049","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:34:05Z","timestamp":1132392845000},"page":"669-716","source":"Crossref","is-referenced-by-count":7,"title":["Concepts for concurrent programming"],"prefix":"10.1007","author":[{"given":"Fred B.","family":"Schneider","sequence":"first","affiliation":[]},{"given":"Gregory R.","family":"Andrews","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., and F.B. Schneider. Defining liveness. Information Processing Letters 21, (Oct. 1985), 181\u2013185.","journal-title":"Information Processing Letters"},{"issue":"1","key":"12_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/356901.356903","volume":"15","author":"G. Andrews","year":"1983","unstructured":"Andrews, G. and F.B. Schneider. Concepts and notations for concurrent programming. ACM Computing Surveys 15, 1 (March 1983), 3\u201343.","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"12_CR3","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0022-0000(75)80018-3","volume":"10","author":"E. Ashcroft","year":"1975","unstructured":"Ashcroft, E. Proving Assertions about Parallel Programs. Journal of Computer and System Sciences 10 1 (Feb. 1975), 110\u2013135.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR4","series-title":"Technical Report","volume-title":"Program verification tableaus","author":"E. Ashcroft","year":"1976","unstructured":"Ashcroft, E. Program verification tableaus. Technical Report CS-76-01. University of Waterloo, Waterloo, Ontario, Canada, Jan. 1976."},{"key":"12_CR5","first-page":"17","volume":"6","author":"E. Ashcroft","year":"1971","unstructured":"Ashcroft, E., and Z. Manna. Formalization of properties of parallel programs. Machine Intelligence 6, (1971), Edinburgh University Press, 17\u201341.","journal-title":"Machine Intelligence"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-15239-3","volume-title":"A Survey of Verification Techniques for Parallel Programs","author":"H. Barringer","year":"1985","unstructured":"Barringer, Howard. A Survey of Verification Techniques for Parallel Programs. Lecture Notes in Computer Science Volume 191, Springer-Verlag, New York, 1985."},{"key":"12_CR7","volume-title":"Principles of Concurrent Programming","author":"M. Ben Ari","year":"1982","unstructured":"Ben Ari, M. Principles of Concurrent Programming. Prentice Hall International, Englewood Cliffs, N.J., 1982."},{"issue":"4","key":"12_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356622.356624","volume":"5","author":"P. Brinch Hansen","year":"1973","unstructured":"Brinch Hansen, P. Concurrent programming concepts. ACM Computing Surveys 5, 4 (Dec. 1973), 223\u2013245.","journal-title":"ACM Computing Surveys"},{"key":"12_CR9","volume-title":"The Architecture of Concurrent Programs","author":"P. Brinch Hansen","year":"1977","unstructured":"Brinch Hansen, P. The Architecture of Concurrent Programs, Prentice Hall, Englewood Cliffs, N.J., 1977."},{"key":"12_CR10","series-title":"Experimental Programming Reports","volume-title":"Proving properties of programs by structural induction","author":"R.M. Burstall","year":"1968","unstructured":"Burstall, R.M. Proving properties of programs by structural induction. Experimental Programming Reports, No. 17. DMIP, Edinburgh, 1968."},{"issue":"1","key":"12_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF00571463","volume":"2","author":"M. Clint","year":"1973","unstructured":"Clint, M. Program proving: Coroutines. Acta Informatica 2, 1 (1973), 50\u201363.","journal-title":"Acta Informatica"},{"key":"12_CR12","volume-title":"A Programming Logic","author":"R.L. Constable","year":"1978","unstructured":"Constable, R.L. and M.J. O'Donnell. A Programming Logic. Winthrop Publishers, Cambridge, Mass., 1978."},{"key":"12_CR13","volume-title":"Axiomatics of simple assignment statements. M.R. 94","author":"J.W. Bakker de","year":"1968","unstructured":"de Bakker, J.W. Axiomatics of simple assignment statements. M.R. 94, Mathematisch Centrum, Amsterdam, 1968."},{"key":"12_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5695-3","volume-title":"Selected Writings on Computing: A Personal Perspective","author":"E.W. Dijkstra","year":"1982","unstructured":"Dijkstra, E.W. A personal summary of the Gries-Owicki theory. EWD 554, in Selected Writings on Computing: A Personal Perspective, E.W. Dijkstra, Springer Verlag, New York, 1982."},{"key":"12_CR15","unstructured":"On making solutions more and more fine-grained. EWD 622, in Selected Writings on Computing: A Personal Perspective, E.W. Dijkstra, Springer Verlag, New York, 1982."},{"key":"12_CR16","unstructured":"Dijkstra, E.W. An Assertional Proof of a Protocol by G.L. Peterson. Technical Report EWD 779, Burroughs, Corp. Feb. 1981."},{"key":"12_CR17","volume-title":"Coordinated Computing Tools and Techniques for Distributed Software","author":"R.E. Fillman","year":"1983","unstructured":"Fillman, R.E. and D.P. Friedman. Coordinated Computing Tools and Techniques for Distributed Software. McGraw Hill, New York, New York, 1983."},{"key":"12_CR18","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 meanings to programs. Proc. of Symposia in Applied Mathematics 19, 1967, 19\u201331.","journal-title":"Proc. of Symposia in Applied Mathematics"},{"key":"12_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N. Fairness. To appear. Springer Verlag, New York, 1986."},{"key":"12_CR20","unstructured":"Goldstine, H.H. and J. von Neumann. Planning and coding of problems for an electronic computing instrument. Report for U.S. Ord. Dept. In A. Taub (ed.) Collected Works of J. von Neumann, New York, Pergamon, Vol. 5, 1965, 80\u2013151."},{"issue":"2","key":"12_CR21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/TSE.1978.231479","volume":"SE-4","author":"D. Gries","year":"1978","unstructured":"Gries, D. The multiple assignment statement. IEEE Trans. on Software Engineering SE-4, 2 (March 1978), 87\u201393.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-11205-7","volume-title":"Verifying Concurrent Processes Using Temporal Logic","author":"Halpern","year":"1982","unstructured":"Halpern, Brent T. Verifying Concurrent Processes Using Temporal Logic. Lecture Notes in Computer Science Volume 129, Springer-Verlag, New York, 1982."},{"issue":"10","key":"12_CR23","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. CACM 12, 10 (Oct. 1969), 576\u2013580.","journal-title":"CACM"},{"key":"12_CR24","volume-title":"Operating Systems Techniques","author":"C.A.R. Hoare","year":"1972","unstructured":"Hoare, C.A.R. Towards a theory of parallel programming. In Operating Systems Techniques, C.A.R. Hoare and R. Perrot (eds.), Academic Press, New York, 1972."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R. Parallel programming: An axiomatic approach. Computer Languages 1, 1975, Pergamon Press, 151\u2013160.","DOI":"10.1016\/0096-0551(75)90014-4"},{"key":"12_CR26","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R. Communicating Sequential Processes. Prentice Hall, International, New Jersey, 1985."},{"key":"12_CR27","unstructured":"Concurrent Euclid, The UNIX System, and Tunis. Addison-Wesley, Reading, Mass., 1983."},{"key":"12_CR28","volume-title":"Structured Concurrent Programming with Operating Systems Applications","author":"R.C. Holt","year":"1978","unstructured":"Holt, R.C., G.S. Graham, E.D. Lazowska, and M.A. Scott. Structured Concurrent Programming with Operating Systems Applications. Addison-Wesley, Reading, Mass., 1978."},{"key":"12_CR29","unstructured":"Igarashi, S. An axiomatic approach to equivalence problems of algorithms with applications. Ph.D. thesis, University of Tokoyo, 1964."},{"key":"12_CR30","series-title":"Technical Report","volume-title":"Towards a theory of correctness for multi-user data base systems","author":"L. Lamport","year":"1976","unstructured":"Lamport, L. Towards a theory of correctness for multi-user data base systems. Technical Report CA-7610-0712, Massachusetts Computer Associates, Wakefield, Mass., Oct. 1976."},{"issue":"2","key":"12_CR31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"SE-3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L. Proving the correctness of multiprocess programs. IEEE Trans. on Software Engineering SE-3, 2 (March 1977), 125\u2013143.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"12_CR32","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF00289062","volume":"14","author":"L. Lamport","year":"1980","unstructured":"Lamport, L. The \u201cHoare Logic\u201d of concurrent programs. Acta Informatica 14, (1980), 21\u201337.","journal-title":"Acta Informatica"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"The \u201cHoare Logic\u201d of CSP and all that. ACM TOPLAS 6, 2 (April 1984), 281\u2013296.","DOI":"10.1145\/2993.357247"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"Distributed Systems\u2014Methods and Tools for Specification","author":"L. Lamport","year":"1985","unstructured":"Lamport, L. Logical foundation. In Distributed Systems\u2014Methods and Tools for Specification. (M. Paul and H.J. Siegert eds.), Lecture Notes in Computer Science Volume 190, Springer-Verlag, New York, 1985."},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Lehman, D., A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. Proc. Eighth Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science Volume 115, Springer-Verlag, 1981, 264\u2013277.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Levitt, K.N. The application of program-proving techniques to the verification of synchronization processes. Proc. AFIPS Fall Joint Computer Conference, AFIPS Press, 1972, 33\u201347.","DOI":"10.1145\/1479992.1479997"},{"key":"12_CR37","first-page":"21","volume-title":"Proc IFIP Congress 1962","author":"J. McCarthy","year":"1962","unstructured":"McCarthy, J. Towards a mathematical science of computation. Proc IFIP Congress 1962, North Holland, Amsterdam, 1962, 21\u201328."},{"issue":"2","key":"12_CR38","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/MAHC.1984.10017","volume":"6","author":"F.L. Morris","year":"1984","unstructured":"Morris, F.L. and C.B. Jones. An early program proof by Alan Turing. Annals of the History of Computing 6, 2 (April 1984), 139\u2013143.","journal-title":"Annals of the History of Computing"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Naur, P. Proof of algorithms by general snapshots. BIT 6, 4, 310\u2013316.","DOI":"10.1007\/BF01966091"},{"key":"12_CR40","unstructured":"Axiomatic proof techniques for parallel programs. Ph.D. Thesis, Computer Science Department, Cornell University, Ithaca, New York, 1975."},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"An axiomatic proof technique for parallel programs I. Acta Informatica 6, (1976), 319\u2013340.","DOI":"10.1007\/BF00268134"},{"key":"12_CR42","series-title":"Lecture Notes in Computer Science","volume-title":"Distributed Systems\u2014Methods and Tools for Specification","year":"1985","unstructured":"Paul, M. and H.J. Siegert (eds.). Distributed Systems\u2014Methods and Tools for Specification. Lecture Notes in Computer Science Volume 190, Springer-Verlag, New York, 1985."},{"issue":"3","key":"12_CR43","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G.L. Peterson","year":"1981","unstructured":"Peterson, G.L. Myths about the mutual exclusion problem. Information Processing Letters 12, 3 (June 1981), 115\u2013116.","journal-title":"Information Processing Letters"},{"key":"12_CR44","unstructured":"Turing, A.M. Checking a large routine. Report of a Conference on High Speed Automatic Calculating Machines, University Mathematics Laboratory, Cambridge, 67\u201369."},{"key":"12_CR45","unstructured":"Yanov, Yu I. Logical operator schemes. Kybernetika 1 (1958)."}],"container-title":["Lecture Notes in Computer Science","Current Trends in Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:46:46Z","timestamp":1586569606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164883","9783540398271"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/bfb0027049","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}