{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:36:26Z","timestamp":1725539786513},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642045691"},{"type":"electronic","value":"9783642045707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04570-7_5","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T04:51:23Z","timestamp":1257223883000},"page":"37-52","source":"Crossref","is-referenced-by-count":2,"title":["Verifying Cryptographic Software Correctness with Respect to Reference Implementations"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Bacelar","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Barbosa","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Sousa Pinto","sequence":"additional","affiliation":[]},{"given":"B\u00e1rbara","family":"Vieira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/503272.503274","volume-title":"POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"T. Ball","year":"2002","unstructured":"Ball, T., Rajamani, S.K.: The slam project: debugging system software via static analysis. In: POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 1\u20133. ACM, New York (2002)"},{"key":"5_CR2","first-page":"100","volume-title":"CSFW","author":"G. Barthe","year":"2004","unstructured":"Barthe, G., D\u2019Argenio, P.R., Rezk, T.: Secure information flow by self-composition. In: CSFW, pp. 100\u2013114. IEEE Computer Society, Los Alamitos (2004)"},{"key":"5_CR3","unstructured":"Baudin, P., Filli\u00e2tre, J.-C., March\u00e9, C., Monate, B., Moy, Y., Prevosto, V.: ACSL: ANSI\/ISO C Specfication Language. In: CEA LIST and INRIA, 2008. Preliminary design (version 1.4), December 12 (2008)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/964001.964003","volume-title":"POPL","author":"N. Benton","year":"2004","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Jones, N.D., Leroy, X. (eds.) POPL, pp. 14\u201325. ACM, New York (2004)"},{"key":"5_CR5","unstructured":"Computer Aided Cryptography Engineering. EU FP7, \n                    \n                      http:\/\/www.cace-project.eu\/"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/10930755_18","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Chrzaszcz","year":"2003","unstructured":"Chrzaszcz, J.: Implementation of modules in the Coq system. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 270\u2013286. Springer, Heidelberg (2003)"},{"key":"5_CR7","unstructured":"Conchon, S., Contejean, E., Kanig, J.: Ergo: a theorem prover for polymorphic first-order logic modulo theories (2006)"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"S.A. Cook","year":"1978","unstructured":"Cook, S.A.: Soundness and completeness of an axiom system for program verification. SIAM J. Comput.\u00a07(1), 70\u201390 (1978)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/1066100.1066102","volume":"52","author":"D. Detlefs","year":"2005","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. J. ACM\u00a052(3), 365\u2013473 (2005)","journal-title":"J. ACM"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-73368-3_21","volume-title":"Computer Aided Verification","author":"J.-C. Filli\u00e2tre","year":"2007","unstructured":"Filli\u00e2tre, J.-C., March\u00e9, C.: The Why\/Krakatoa\/Caduceus platform for deductive program verification. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 173\u2013177. Springer, Heidelberg (2007)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/503272.503279","volume-title":"POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"T.A. Henzinger","year":"2002","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 58\u201370. ACM, New York (2002)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM\u00a012, 576\u2013580 (1969)","journal-title":"Communications of the ACM"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Logical and mathematical reasoning about imperative programs. In: POPL, pp. 132\u2013140 (1985)","DOI":"10.1145\/318593.318625"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/1040305.1040319","volume-title":"POPL 2005: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"P. Li","year":"2005","unstructured":"Li, P., Zdancewic, S.: Downgrading policies and relaxed noninterference. In: POPL 2005: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 158\u2013170. ACM Press, New York (2005)"},{"key":"5_CR15","unstructured":"The OpenSSL Project, \n                    \n                      http:\/\/www.openssl.org"},{"key":"5_CR16","volume-title":"Applied cryptography: protocols, algorithms, and source code in C","author":"B. Schneier","year":"1996","unstructured":"Schneier, B.: Applied cryptography: protocols, algorithms, and source code in C, 2nd edn. Wiley, New York (1996)","edition":"2"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11547662_24","volume-title":"Static Analysis","author":"T. Terauchi","year":"2005","unstructured":"Terauchi, T., Aiken, A.: Secure information flow as a safety problem. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 352\u2013367. Springer, Heidelberg (2005)"},{"key":"5_CR18","unstructured":"The Coq Development Team. The Coq Proof Assistant Reference Manual \u2013 Version V8.2 (2008), \n                    \n                      http:\/\/coq.inria.fr"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04570-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:07:42Z","timestamp":1619780862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04570-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642045691","9783642045707"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04570-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}