{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:19Z","timestamp":1725663259516},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156703"},{"type":"electronic","value":"9783540395935"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15670-4_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:23:39Z","timestamp":1330194219000},"page":"131-150","source":"Crossref","is-referenced-by-count":1,"title":["The static derivation of concurrency and its mechanized certification"],"prefix":"10.1007","author":[{"given":"Christian","family":"Lengauer","sequence":"first","affiliation":[]},{"given":"Chua-Huang","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/MC.1982.1653938","volume":"15","author":"W. B. Ackerman","year":"1982","unstructured":"Ackerman, W. B. \"Data Flow Languages.\" Computer 15, 2 (Feb. 1982), 15\u201325.","journal-title":"Computer"},{"key":"7_CR2","unstructured":"Bates, J. L., and Constable, R. L. Proofs as Programs. Tech. Rept. TR 82-530, Cornell University, 1982."},{"key":"7_CR3","unstructured":"Boyer, R. S., and Moore, J S. A Computational Logic. Academic Press, 1979."},{"key":"7_CR4","unstructured":"Boyer, R. S., and Moore, J S. A Theorem Prover for Recursive Functions, a User's Manual. Computer Science Laboratory, SRI International, 1979."},{"key":"7_CR5","unstructured":"Dijkstra, E. W. A Discipline of Programming. Series in Automatic Computation, Prentice-Hall, 1976."},{"key":"7_CR6","unstructured":"Huang, C.-H., and Lengauer, C. The Automated Proof of a Trace Transformation for a Bitonic Sort. Tech. Rept. TR-84-30, Department of Computer Sciences, The University of Texas at Austin, 1984."},{"key":"7_CR7","unstructured":"Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, 1973. Sect. 5.3.4."},{"issue":"1","key":"7_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/356683.356686","volume":"9","author":"D. J. Kuck","year":"1977","unstructured":"Kuck, D. J. \"A Survey of Parallel Machine Organization and Programming.\" Computing Surveys 9, 1 (Mar. 1977), 29\u201359.","journal-title":"Computing Surveys"},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(82)90002-8","volume":"2","author":"C. Lengauer","year":"1982","unstructured":"Lengauer, C., and Hehner, E. C. R. \"A Methodology for Programming with Concurrency: An Informal Presentation.\" Science of Computer Programming 2, 1 (Oct. 1982), 1\u201318.","journal-title":"Science of Computer Programming"},{"issue":"1","key":"7_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6423(82)90003-X","volume":"2","author":"C. Lengauer","year":"1982","unstructured":"Lengauer, C. \"A Methodology for Programming with Concurrency: The Formalism.\" Science of Computer Programming 2, 1 (Oct. 1982), 19\u201352.","journal-title":"Science of Computer Programming"},{"key":"7_CR11","unstructured":"Lengauer, C. A Methodology for Programming with Concurrency. Tech. Rept. CSRG-142, Computer Systems Research Group, University of Toronto, Apr., 1982."},{"key":"7_CR12","unstructured":"Lengauer, C. \"On the Role of Automated Theorem Proving in the Compile-Time Derivation of Concurrency.\" Journal of Automated Reasoning 1 (1985). To appear. Earlier version: On the Mechanical Transformation of Program Executions to Derive Concurrency. Tech. Rept. TR-83-20, Department of Computer Sciences, The University of Texas at Austin, Oct., 1983."},{"issue":"1","key":"7_CR13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/357084.357090","volume":"2","author":"Z. Manna","year":"1980","unstructured":"Manna, Z., and Waldinger, R. \"A Deductive Approach to Program Synthesis.\" ACM TOPLAS 2, 1 (Jan. 1980), 90\u2013121.","journal-title":"ACM TOPLAS"}],"container-title":["Lecture Notes in Computer Science","Seminar on Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15670-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:06Z","timestamp":1619557206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15670-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156703","9783540395935"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-15670-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}