{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T16:04:36Z","timestamp":1750089876433,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319478456"},{"type":"electronic","value":"9783319478463"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-47846-3_16","type":"book-chapter","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T02:53:57Z","timestamp":1476413637000},"page":"243-260","source":"Crossref","is-referenced-by-count":2,"title":["Formal Verification of the rank Algorithm for Succinct Data Structures"],"prefix":"10.1007","author":[{"given":"Akira","family":"Tanaka","sequence":"first","affiliation":[]},{"given":"Reynald","family":"Affeldt","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Garrigue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,15]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","first-page":"346","volume-title":"Advances in Computer Science - ASIAN 2006","author":"R Affeldt","year":"2008","unstructured":"Affeldt, R., Marti, N.: An approach to formal verification of arithmetic functions in assembly. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol. 4435, pp. 346\u2013360. Springer, Heidelberg (2008)"},{"key":"16_CR2","unstructured":"Agarwal, R., Khandelwal, A., Stoica, I.: Succinct: enabling queries on compressed data. In: NSDI 2015, pp. 337\u2013350. USENIX Association (2015). Technical report: http:\/\/people.eecs.berkeley.edu\/~rachit\/succinct-techreport.pdf"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-14052-5_8","volume-title":"Interactive Theorem Proving","author":"M Armand","year":"2010","unstructured":"Armand, M., Gr\u00e9goire, B., Spiwack, A., Th\u00e9ry, L.: Extending Coq with imperative features and its application to SAT verification. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 83\u201398. Springer, Heidelberg (2010)"},{"key":"16_CR4","unstructured":"Clark, D.: Compact pat trees. Doctoral dissertation, University of Waterloo (1996)"},{"key":"16_CR5","unstructured":"The Coq Development Team: Reference Manual. Version 8.5. INRIA (2004\u20132016). http:\/\/coq.inria.fr"},{"key":"16_CR6","unstructured":"Free Software Foundation: GCC 4.9.2 Manual (2014). http:\/\/gcc.gnu.org\/onlinedocs\/gcc-4.9.2\/gcc"},{"key":"16_CR7","unstructured":"Gonthier, G., Mahboubi, A., Tassi, E.: A small scale reflection extension for the Coq system. Version 16. Technical report RR-6455, INRIA (2015)"},{"key":"16_CR8","unstructured":"Intel Advanced Vector Extensions Programming Reference, June 2011"},{"key":"16_CR9","unstructured":"Intel 64 and IA-32 Architectures Optimization Reference Manual, September 2015"},{"key":"16_CR10","unstructured":"Intel SSE4 Programming Reference, April 2007"},{"key":"16_CR11","unstructured":"Jacobson, G.: Succinct static data structures. Doctoral dissertation, Carnegie Mellon University (1988)"},{"key":"16_CR12","unstructured":"Jones, R.W.M.: A beginners guide to OCaml internals (2009). https:\/\/rwmj.wordpress.com\/2009\/08\/04\/ocaml-internals"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","first-page":"315","volume-title":"Experimental and Efficient Algorithms","author":"D-K Kim","year":"2005","unstructured":"Kim, D.-K., Na, J.C., Kim, J.E., Park, K.: Efficient implementation of rank and select functions for succinct representation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 315\u2013327. Springer, Heidelberg (2005)"},{"issue":"6","key":"16_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. Commun. ACM 53(6), 107\u2013115 (2010)","journal-title":"Commun. ACM"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-319-22102-1_21","volume-title":"Interactive Theorem Proving","author":"T Nipkow","year":"2015","unstructured":"Nipkow, T.: Amortized complexity verified. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 310\u2013324. Springer, Berlin (2015)"},{"key":"16_CR16","unstructured":"SDSL: Succinct Data Structure Library. https:\/\/github.com\/simongog\/sdsl-lite"},{"key":"16_CR17","unstructured":"OUnit: Unit test framework for OCaml. http:\/\/ounit.forge.ocamlcore.org\/"},{"key":"16_CR18","unstructured":"Okanohara, D.: The world of fast character string analysis. Iwanami Shoten (2012). (in Japanese)"},{"key":"16_CR19","unstructured":"Tanaka, A., Affeldt, R., Garrigue, J.: Formal Verification of the Rank Function for Succinct Data Structures. https:\/\/staff.aist.go.jp\/tanaka-akira\/succinct\/index.html"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47846-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:08:03Z","timestamp":1498338483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47846-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319478456","9783319478463"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47846-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}