{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:53:08Z","timestamp":1743072788170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319406473"},{"type":"electronic","value":"9783319406480"}],"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-40648-0_22","type":"book-chapter","created":{"date-parts":[[2016,6,3]],"date-time":"2016-06-03T13:42:13Z","timestamp":1464961333000},"page":"291-306","source":"Crossref","is-referenced-by-count":4,"title":["Specification and Proof of High-Level Functional Properties of Bit-Level Programs"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Fumex","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Dross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Gerlach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"March\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,4]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139696616","volume-title":"Programming in Ada 2012","author":"J Barnes","year":"2014","unstructured":"Barnes, J.: Programming in Ada 2012. Cambridge University Press, Cambridge (2014)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., M. Leino, K.R.: Boogie: a modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364\u2013387. Springer, Heidelberg (2006)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-642-22110-1_14","volume-title":"Computer Aided Verification","author":"C Barrett","year":"2011","unstructured":"Barrett, C., Conway, C.L., Deters, M., Hadarean, L., Jovanovi\u0107, D., King, T., Reynolds, A., Tinelli, C.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171\u2013177. Springer, Heidelberg (2011)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Barrett, C.W., Dill, D.L., Levitt, J.R.: A decision procedure for bit-vector arithmetic. In: Design Automation Conference. pp. 522\u2013527. ACM (1998)","DOI":"10.1145\/277044.277186"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.7551\/mitpress\/5641.003.0021","volume-title":"Proof, Language, and Interaction, Essays in Honour of Robin Milner","author":"G Berry","year":"2000","unstructured":"Berry, G.: The foundations of esterel. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 425\u2013454. The MIT Press, Cambridge (2000)"},{"key":"22_CR6","unstructured":"Bobot, F., Conchon, S., Contejean, E., Iguernelala, M., Lescuyer, S., Mebsout, A.: The Alt-Ergo automated theorem prover (2008). http:\/\/alt-ergo.lri.fr\/"},{"issue":"6","key":"22_CR7","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10009-014-0314-5","volume":"17","author":"F Bobot","year":"2015","unstructured":"Bobot, F., Filli\u00e2tre, J.C., March\u00e9, C., Paskevich, A.: Let\u2019s verify this with Why3. Int. J. Softw. Tools Technol. Transf. 17(6), 709\u2013727 (2015)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s11786-011-0099-9","volume":"5","author":"S Boldo","year":"2011","unstructured":"Boldo, S., March\u00e9, C.: Formal verification of numerical programs: from C annotated programs to mechanical proofs. Math. Comput. Sci. 5, 377\u2013393 (2011)","journal-title":"Math. Comput. Sci."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Brain, M., Tinelli, C., Ruemmer, P., Wahl, T.: An automatable formal semantics for IEEE-754 floating-point arithmetic. In: ARITH. pp. 160\u2013167 (2015)","DOI":"10.1109\/ARITH.2015.26"},{"issue":"2","key":"22_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10009-009-0101-x","volume":"11","author":"RE Bryant","year":"2009","unstructured":"Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.A.: An abstraction-based decision procedure for bit-vector arithmetic. Int. J. Softw. Tools Technol. Transf. 11(2), 95\u2013104 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-319-08970-6_2","volume-title":"Interactive Theorem Proving","author":"R Chapman","year":"2014","unstructured":"Chapman, R., Schanda, F.: Are we there yet? 20 years of industrial theorem proving with SPARK. In: Klein, G., Gamboa, R. (eds.) ITP 2014. LNCS, vol. 8558, pp. 17\u201326. Springer, Heidelberg (2014)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/3-540-63166-6_9","volume-title":"Computer Aided Verification","author":"D Cyrluk","year":"1997","unstructured":"Cyrluk, D., Rue\u00df, H., M\u00f6ller, O.: An efficient decision procedure for the theory of fixed-sized bit-vectors. In: Grumberg, O. (ed.) Computer Aided Verification. LNCS, vol. 1254, pp. 60\u201371. Springer, Heidelberg (1997)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Dahlweid, M., Moskal, M., Santen, T., Tobies, S., Schulte, W.: VCC: contract-based modular verification of concurrent C. In: ICSE. pp. 429\u2013430. IEEE Computer Society Press (2009)","DOI":"10.1109\/ICSE-COMPANION.2009.5071046"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Dross, C., Fumex, C., Gerlach, J., March\u00e9, C.: High-level functional properties of bit-level programs: Formal specifications and automated proofs. Research Report 8821, Inria (2015)","DOI":"10.1007\/978-3-319-40648-0_22"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-27705-4_8","volume-title":"Verified Software: Theories, Tools, Experiments","author":"J-C Filli\u00e2tre","year":"2012","unstructured":"Filli\u00e2tre, J.-C.: Verifying two lines of C with Why3: an exercise in program verification. In: Joshi, R., M\u00fcller, P., Podelski, A. (eds.) VSTTE 2012. LNCS, vol. 7152, pp. 83\u201397. Springer, Heidelberg (2012)"},{"key":"22_CR16","unstructured":"Gerlach, J.: Validation and verification of implementation\/code. Technical report D4.3.2, OpenETCS (2015). https:\/\/github.com\/openETCS\/governance\/wiki\/State-of-Deliverables"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Kanig, J., Schonberg, E., Dross, C.: Hi-Lite: the convergence of compiler technology and program verification. In: HILT. pp. 27\u201334. ACM Press (2012)","DOI":"10.1145\/2402676.2402690"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-3-642-21437-0_14","volume-title":"FM 2011: Formal Methods","author":"V Klebanov","year":"2011","unstructured":"Klebanov, V., M\u00fcller, P., Shankar, N., Leavens, G.T., W\u00fcstholz, V., Alkassar, E., Arthan, R., Bronish, D., Chapman, R., Cohen, E., Hillebrand, M., Jacobs, B., Leino, K.R.M., Monahan, R., Piessens, F., Polikarpova, N., Ridge, T., Smans, J., Tobies, S., Tuerk, T., Ulbrich, M., Wei\u00df, B.: The 1st verified software competition: experience report. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 154\u2013168. Springer, Heidelberg (2011)"},{"key":"22_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.4204\/EPTCS.149.2","volume":"149","author":"KRM Leino","year":"2014","unstructured":"Leino, K.R.M., W\u00fcstholz, V.: The Dafny integrated development environment. F-IDE. EPTCS 149, 3\u201315 (2014)","journal-title":"F-IDE. EPTCS"},{"key":"22_CR20","unstructured":"Lomont, C.: Fast inverse square root. Technical report, Indiana: Purdue University (2003). http:\/\/www.lomont.org\/Math\/Papers\/2003\/InvSqrt.pdf"},{"key":"22_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139629294","volume-title":"Building High Integrity Applications with SPARK","author":"JW McCormick","year":"2015","unstructured":"McCormick, J.W., Chapin, P.C.: Building High Integrity Applications with SPARK. Cambridge University Press, Cambridge (2015)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"22_CR23","unstructured":"Nguyen, T.M.T.: Taking architecture and compiler into account in formal proofs of numerical programs. Th\u00e8se de doctorat, Universit\u00e9 Paris-Sud (2012)"},{"key":"22_CR24","volume-title":"Hackers\u2019s Delight","author":"HS Warren","year":"2003","unstructured":"Warren, H.S.: Hackers\u2019s Delight. Addison-Wesley, Boston (2003)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40648-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T10:00:18Z","timestamp":1718618418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40648-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319406473","9783319406480"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40648-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}