{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:55Z","timestamp":1725456115532},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022501","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"142-153","source":"Crossref","is-referenced-by-count":0,"title":["Proof of a concurrent program finding Euler paths"],"prefix":"10.1007","author":[{"given":"E.","family":"Best","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Best, E.: Atomicity of Activities. In: Proceedings of the Advanced Course in General Net Theory, Springer Lecture Notes in Computer Science, to appear in 1980.","DOI":"10.1007\/3-540-10001-6_25"},{"key":"10_CR2","unstructured":"Di jkstra, E.W.: A Discipline of Programming. Prentice Hall 1976."},{"key":"10_CR3","unstructured":"iDijkstra, E.W.: Finding the Correctness Proof of a Concurrent Program. Proc. of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, Series A, Vol. 81(2), June 1978."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S. and Steffens, E.F.M.: On-the-Fly Garbage Collection: An Exercise in Co-operation. CACM 21\/11, November 1978, pp. 966\u2013975.","DOI":"10.1145\/359642.359655"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of Graphs. American Mathematical Society, Colloquium Publications, Vol. XXXVIII, Rhode Island 1962.","DOI":"10.1090\/coll\/038"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki, S. and Gries, D.: An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6\/1976, pp. 319\u2013340.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022501.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:43Z","timestamp":1607550523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0022501","relation":{},"subject":[]}}