{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:36:08Z","timestamp":1725903368077},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319630458"},{"type":"electronic","value":"9783319630465"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63046-5_1","type":"book-chapter","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T13:34:07Z","timestamp":1499693647000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning About Concurrency in High-Assurance, High-Performance Software Systems"],"prefix":"10.1007","author":[{"given":"June","family":"Andronick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,11]]},"reference":[{"key":"1_CR1","unstructured":"eChronos model and proofs. https:\/\/github.com\/echronos\/echronos-proofs"},{"key":"1_CR2","unstructured":"The eChronos OS. http:\/\/echronos.systems"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/3018610.3018627","volume-title":"CPP","author":"S Amani","year":"2017","unstructured":"Amani, S., Andronick, J., Bortin, M., Lewis, C., Christine, R., Tuong, J.: Complx: a verification framework for concurrent imperative programs. In: Bertot, Y., Vafeiadis, V. (eds.) CPP, pp. 138\u2013150. ACM, Paris (2017)"},{"key":"1_CR4","first-page":"9","volume-title":"SSV","author":"J Andronick","year":"2010","unstructured":"Andronick, J., Greenaway, D., Elphinstone, K.: Towards proving security in the presence of large untrusted components. In: Huuck, R., Klein, G., Schlich, B. (eds.) SSV, p. 9. USENIX, Vancouver (2010)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Andronick, J., Klein, G.: Formal system verification - extension 2, final report AOARD #FA2386-12-1-4022. Technical report, NICTA, Sydney, Australia, August 2012","DOI":"10.21236\/ADA570949"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-43144-4_4","volume-title":"Interactive Theorem Proving","author":"J Andronick","year":"2016","unstructured":"Andronick, J., Lewis, C., Matichuk, D., Morgan, C., Rizkallah, C.: Proof of OS scheduling behavior in the presence of interrupt-induced concurrency. In: Blanchette, J.C., Merz, S. (eds.) ITP 2016. LNCS, vol. 9807, pp. 52\u201368. Springer, Cham (2016). doi: 10.1007\/978-3-319-43144-4_4"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Andronick, J., Lewis, C., Morgan, C.: Controlled Owicki-gries concurrency: reasoning about the preemptible eChronos embedded operating system. In: van Glabbeek, R.J., Groote, J.F., H\u00f6fner, P. (eds.) Workshop on Models for Formal Analysis of Real Systems (MARS 2015), pp. 10\u201324, Suva, Fiji, November 2015","DOI":"10.4204\/EPTCS.196.2"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19718-5_1","volume-title":"Programming Languages and Systems","author":"AW Appel","year":"2011","unstructured":"Appel, A.W.: Verified software toolchain. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 1\u201317. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19718-5_1"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H., Wu, X.N., Shao, Z., Lockerman, J., Gu, R.: Toward compositional verification of interruptible OS kernels and device drivers. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, pp. 431\u2013447. ACM, New York (2016)","DOI":"10.1145\/2908080.2908101"},{"key":"1_CR10","unstructured":"COMPLX entry in the Archive of Formal Proofs. https:\/\/www.isa-afp.org\/entries\/Complx.shtml"},{"key":"1_CR11","unstructured":"Gu, R., Shao, Z., Chen, H., Wu, X.N., Kim, J., Sj\u00f6berg, V., Costanzo, D.: CertiKOS: an extensible architecture for building certified concurrent OS kernels. In: OSDI, November 2016"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Heiser, G., Andronick, J., Elphinstone, K., Klein, G., Kuz, I., Ryzhyk, L.: The road to trustworthy systems. In: ACMSTC, pp. 3\u201310. ACM, October 2010","DOI":"10.1145\/1867635.1867638"},{"issue":"4","key":"1_CR13","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"CB Jones","year":"1983","unstructured":"Jones, C.B.: Tentative steps towards a development method for interfering programs. Trans. Program. Lang. Syst. 5(4), 596\u2013619 (1983)","journal-title":"Trans. Program. Lang. Syst."},{"issue":"6","key":"1_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1743546.1743574","volume":"53","author":"G Klein","year":"2010","unstructured":"Klein, G., Andronick, J., Elphinstone, K., Heiser, G., Cock, D., Derrin, P., Elkaduwe, D., Engelhardt, K., Kolanski, R., Norrish, M., Sewell, T., Tuch, H., Winwood, S.: seL4: formal verification of an operating-system kernel. CACM 53(6), 107\u2013115 (2010)","journal-title":"CACM"},{"issue":"1","key":"1_CR15","first-page":"2:1","volume":"32","author":"G Klein","year":"2014","unstructured":"Klein, G., Andronick, J., Elphinstone, K., Murray, T., Sewell, T., Kolanski, R., Heiser, G.: Comprehensive formal verification of an OS microkernel. Trans. Comput. Syst. 32(1), 2:1\u20132:70 (2014)","journal-title":"Trans. Comput. Syst."},{"key":"1_CR16","first-page":"42","volume-title":"33rd POPL","author":"X Leroy","year":"2006","unstructured":"Leroy, X.: Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In: Morrisett, J.G., Jones, S.L.P. (eds.) 33rd POPL, pp. 42\u201354. ACM, Charleston (2006)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45949-9"},{"issue":"1\u20133","key":"1_CR18","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.tcs.2006.12.035","volume":"375","author":"PW OHearn","year":"2007","unstructured":"OHearn, P.W.: Resources, concurrency, and local reasoning. Theor. Comput. Sci. 375(1\u20133), 271\u2013307 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S Owicki","year":"1976","unstructured":"Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica 6, 319\u2013340 (1976)","journal-title":"Acta Informatica"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Peters, S., Danis, A., Elphinstone, K., Heiser, G.: For a microkernel, a big lock is fine. In: APSys, Tokyo, JP, July 2015","DOI":"10.1145\/2797022.2797042"},{"key":"1_CR21","unstructured":"Potts, D., Bourquin, R., Andresen, L., Andronick, J., Klein, G., Heiser, G.: Mathematically verified software kernels: raising the bar for high assurance implementations. Technical report, NICTA, Sydney, Australia, July 2014"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Schirmer, N.: Verification of sequential imperative programs in Isabelle\/HOL. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2006)","DOI":"10.1007\/978-3-540-32275-7_26"},{"key":"1_CR23","unstructured":"von Tessin, M.: The clustered multikernel: an approach to formal verification of multiprocessor operating-system kernels. Ph.D. thesis, School Comp. Sci. & Engin., UNSW, Sydney, Australia, December 2013"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1190216.1190234","volume-title":"POPL","author":"H Tuch","year":"2007","unstructured":"Tuch, H., Klein, G., Norrish, M.: Types, bytes, and separation logic. In: Hofmann, M., Felleisen, M. (eds.) POPL, pp. 97\u2013108. ACM, Nice (2007)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 26"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63046-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T11:21:06Z","timestamp":1692876066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63046-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319630458","9783319630465"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63046-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}