{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:45:22Z","timestamp":1725486322363},"reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108276"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0105123","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T01:24:42Z","timestamp":1181611482000},"page":"259-270","source":"Crossref","is-referenced-by-count":0,"title":["A methodology for programming with concurrency"],"prefix":"10.1007","author":[{"given":"Christian","family":"Lengauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric C. R.","family":"Hehner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"139","volume":"24","author":"M.E. Conway","year":"1963","unstructured":"Conway, M.E. A Multiprocessor System Design AFIPS FJCC 24 (1963), 139\u2013146","journal-title":"AFIPS FJCC"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W. Co-operating Sequential Processes in \"Programming Languages\", F. Genuys (Ed.), Academic Press, 1968, 43\u2013112","DOI":"10.1007\/978-1-4757-3472-0_2"},{"key":"18_CR3","unstructured":"Dijkstra, E.W. A Discipline of Programming Prentice-Hall, Series in Automatic Computation, 1976, 217 p."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Good, D.I.; Cohen, R.M.; Keeton-Williams, J. Principles of Proving Concurrent Programs in Gypsy Proc. Principles of Programming Languages 1979, 42\u201352","DOI":"10.1145\/567752.567757"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Gries, D. An Exercise in Proving Parallel Programs Correct Comm. ACM 20, 12 (Dec 77), 921\u2013930 Corrigendum: Comm. ACM 21, 12 (Dec 78), 1048","DOI":"10.1145\/359897.359903"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Gries, D.; Levin, G. Assignment and Procedure Call Proof Rules ACM TOPLAS 2, 4 (Oct 80), 564\u2013579","DOI":"10.1145\/357114.357119"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00289091","volume":"11","author":"E.C.R. Hehner","year":"1979","unstructured":"Hehner, E.C.R. do considered od: A Contribution to the Programming Calculus Acta Informatica 11 (1979), 287\u2013304","journal-title":"Acta Informatica"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R. An Axiomatic Basis for Computer Programming Comm. ACM 12, 10 (Oct 69), 576\u2013580, 583","DOI":"10.1145\/363235.363259"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R. Parallel Programming: An Axiomatic Approach Computer Languages 1, 2 (June 75), 151\u2013160","DOI":"10.1016\/0096-0551(75)90014-4"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R. Communicating Sequential Processes Comm. ACM 21, 8 (Aug 78), 666\u2013677","DOI":"10.1145\/359576.359585"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Holt, R.C. Some Deadlock Properties of Computer Systems ACM Computing Surveys 4, 3 (Sept 72), 179\u2013196","DOI":"10.1145\/356603.356607"},{"key":"18_CR12","unstructured":"Knuth, D.E. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms Addison-Wesley, 1969, 624 p."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Lamport, L. Proving the Correctness of Multiprocess Programs IEEE Trans. on Soft. Eng. SE-3, 2 (Mar 77), 125\u2013143","DOI":"10.1109\/TSE.1977.229904"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S.S. Owicki","year":"1976","unstructured":"Owicki, S.S.; Gries, D. An Axiomatic Proof Technique for Parallel Programs I Acta Informatica 6 (1976), 319\u2013340","journal-title":"Acta Informatica"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Owicki, S.S.; Gries, D. Verifying Properties of Parallel Programs: An Axiomatic Approach Comm. ACM 19, 5 (May 76), 279\u2013285","DOI":"10.1145\/360051.360224"}],"container-title":["Lecture Notes in Computer Science","Conpar 81"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0105123.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:18:50Z","timestamp":1607534330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0105123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540108276"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0105123","relation":{},"subject":[]}}