{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:39:57Z","timestamp":1649209197214},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T00:00:00Z","timestamp":1264377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci. China"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11704-009-0067-6","type":"journal-article","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T16:15:37Z","timestamp":1264436137000},"page":"65-77","source":"Crossref","is-referenced-by-count":0,"title":["Formal verification of concurrent programs with read-write locks"],"prefix":"10.1007","volume":"4","author":[{"given":"Ming","family":"Fu","sequence":"first","affiliation":[]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,25]]},"reference":[{"issue":"1\u20133","key":"67_CR1","first-page":"271","volume":"375","author":"O. P. W. Hearn","year":"2007","unstructured":"Hearn O P W. Resources, concurrency, and local reasoning. Theoretical Computer Science, 2007, 375(1\u20133): 271\u2013307","journal-title":"Theoretical Computer Science"},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Hoare C A R. Towards a theory of parallel programming. In: Hoare C A R and Perrott R H, eds. Operating Systems Techniques. Academic Press, 1972, 61\u201371","DOI":"10.1007\/978-1-4757-3472-0_6"},{"key":"67_CR3","unstructured":"The Coq Development Team. The Coq proof assistant reference manual. The Coq release v8.0, October 2004"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Necula G. Proof-carrying code. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languges. ACM Press, January 1997, 106\u2013119","DOI":"10.1145\/263699.263712"},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"Reynolds J C. Separation logic: A logic for shared mutable data structures. In: Proceedings of the 17th IEEE Symposium on Logic in Computer Science, July 2002, 55\u201374","DOI":"10.1109\/LICS.2002.1029817"},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Yu D C, Shao Z. Verification of safety properties for concurrent assembly code. In: Proceedings of the 9th ACM SIGPLAN International Conference on Functional Programming, September 2004, 19\u201321","DOI":"10.21236\/ADA436482"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Hearn O PW. Resources, concurrency and local reasoning. In: Proceedings of the 15th International Conference on Concurrency Theory, 2004, LNCS, 3170: 49\u201367","DOI":"10.1007\/978-3-540-28644-8_4"},{"issue":"1","key":"67_CR8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A. K. Wright","year":"1994","unstructured":"Wright A K, Felleisen M. A syntactic approach to type soundness. Information and Computation, 1994, 115(1): 38\u201394","journal-title":"Information and Computation"},{"key":"67_CR9","unstructured":"The Coq Development Team. The Coq proof assistant reference manual. The Coq release v7.1, October 2001"},{"issue":"5","key":"67_CR10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"S. Owicki","year":"1976","unstructured":"Owicki S, Gries D. Verifying properties of parallel programs: an axiomatic approach. Communications of the ACM, 1976, 19(5): 279\u2013285","journal-title":"Communications of the ACM"},{"issue":"4","key":"67_CR11","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"C. B. Jones","year":"1983","unstructured":"Jones C B. Tentative steps toward a development method for interfering programs. ACM Transactions on Programming Languages and Systems, 1983, 5(4): 596\u2013619","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"67_CR12","doi-asserted-by":"crossref","unstructured":"Feng X, Shao Z. Modular verification of concurrent assembly code with dynamic thread creation and termination. In: Proceedings of the 10th ACM SIGPLAN international conference on Functional programming, 2005, 26\u201328","DOI":"10.1145\/1086365.1086399"},{"key":"67_CR13","doi-asserted-by":"crossref","unstructured":"Feng X, Ferreira R, Shao Z. On the relationship between concurrent separation logic and assume-guarantee reasoning. In: Proceedings of the 16th European Symposium on Programming, 2007, 173\u2013188","DOI":"10.1007\/978-3-540-71316-6_13"},{"key":"67_CR14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.tcs.2006.12.034","volume":"375","author":"S. Brookes","year":"2007","unstructured":"Brookes S. A semantics for concurrent separation logic. Theoretical Computer Science, 2007, 375: 227\u2013270","journal-title":"Theoretical Computer Science"},{"key":"67_CR15","doi-asserted-by":"crossref","unstructured":"Ishtiaq S S, Hearn O P W. BI as an assertion language for mutable data structures. In: Proceedings of the 28th ACM SIGPLANSIGACT symposium on Principles of Programming Languages, 2001, 14\u201326","DOI":"10.1145\/360204.375719"},{"key":"67_CR16","doi-asserted-by":"crossref","unstructured":"Vafeiadis V, Parkinson M J. A marriage of rely\/guarantee and separation logic. In: Proceedings of the 18th International Conference on Concurrency Theory, 2007, 256\u2013271","DOI":"10.1007\/978-3-540-74407-8_18"},{"key":"67_CR17","doi-asserted-by":"crossref","unstructured":"Bornat R, Calcagno C, Hearn O PW, et al. Permission accounting in separation logic. In: Proceedings of the 32nd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2005, 259\u2013270","DOI":"10.1145\/1040305.1040327"}],"container-title":["Frontiers of Computer Science in China"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-009-0067-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-009-0067-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-009-0067-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:01:14Z","timestamp":1559408474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-009-0067-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,25]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s11704-009-0067-6","relation":{},"ISSN":["1673-7350","1673-7466"],"issn-type":[{"value":"1673-7350","type":"print"},{"value":"1673-7466","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,25]]}}}