{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T03:47:11Z","timestamp":1777348031341,"version":"3.51.4"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031077265","type":"print"},{"value":"9783031077272","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07727-2_6","type":"book-chapter","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T01:12:12Z","timestamp":1654045932000},"page":"86-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Certified Verification of\u00a0Relational Properties"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9058-2005","authenticated-orcid":false,"given":"Lionel","family":"Blatter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1557-2813","authenticated-orcid":false,"given":"Nikolai","family":"Kosmatov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7203-0968","authenticated-orcid":false,"given":"Virgile","family":"Prevosto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8955-6835","authenticated-orcid":false,"given":"Pascale","family":"Le Gall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,1]]},"reference":[{"key":"6_CR1","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-745-5","volume-title":"Verification of Sequential and Concurrent Programs","author":"K Apt","year":"2009","unstructured":"Apt, K., de Boer, F., Olderog, E.: Verification of Sequential and Concurrent Programs. Texts in Computer Science, Springer, London (2009). https:\/\/doi.org\/10.1007\/978-1-84882-745-5"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-21437-0_17","volume-title":"FM 2011: Formal Methods","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Crespo, J.M., Kunz, C.: Relational verification using product programs. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 200\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21437-0_17"},{"issue":"6","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1017\/S0960129511000193","volume":"21","author":"G Barthe","year":"2011","unstructured":"Barthe, G., D\u2019Argenio, P.R., Rezk, T.: Secure information flow by self-composition. J. Math. Struct. Comput. Sci. 21(6), 1207\u20131252 (2011). https:\/\/doi.org\/10.1017\/S0960129511000193","journal-title":"J. Math. Struct. Comput. Sci."},{"key":"6_CR4","unstructured":"Baudin, P., et al.: ACSL: ANSI\/ISO C Specification Language (2021). https:\/\/frama-c.com\/html\/acsl.html"},{"key":"6_CR5","unstructured":"Beckert, B., Bormer, T., Kirsten, M., Neuber, T., Ulbrich, M.: Automated verification for functional and relational properties of voting rules. In: Proceedings of the 6th International Workshop on Computational Social Choice (COMSOC 2016) (2016)"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on of Programming Languages (POPL 2004), pp. 14\u201325. ACM (2004). https:\/\/doi.org\/10.1145\/964001.964003","DOI":"10.1145\/964001.964003"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-030-30942-8_34","volume-title":"Formal Methods \u2013 The Next 30 Years","author":"L Beringer","year":"2019","unstructured":"Beringer, L., Appel, A.W.: Abstraction and subsumption in modular verification of C programs. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) FM 2019. LNCS, vol. 11800, pp. 573\u2013590. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8_34"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Bishop, P.G., Bloomfield, R.E., Cyra, L.: Combining testing and proof to gain high assurance in software: a case study. In: Proceedings of the 24th International Symposium on Software Reliability Engineering (ISSRE 2013), pp. 248\u2013257. IEEE (2013). https:\/\/doi.org\/10.1109\/ISSRE.2013.6698924","DOI":"10.1109\/ISSRE.2013.6698924"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-662-54577-5_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Blatter","year":"2017","unstructured":"Blatter, L., Kosmatov, N., Le Gall, P., Prevosto, V.: RPP: automatic proof of relational properties by self-composition. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 391\u2013397. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_22"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-92994-1_3","volume-title":"Tests and Proofs","author":"L Blatter","year":"2018","unstructured":"Blatter, L., Kosmatov, N., Le Gall, P., Prevosto, V., Petiot, G.: Static and dynamic verification of relational properties on self-composed C code. In: Dubois, C., Wolff, B. (eds.) TAP 2018. LNCS, vol. 10889, pp. 44\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92994-1_3"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Blazy, S., Maroneze, A., Pichardie, D.: Verified validation of program slicing. In: Proceedings of the 2015 Conference on Certified Programs and Proofs (CPP 2015), pp. 109\u2013117. ACM (2015). https:\/\/doi.org\/10.1145\/2676724.2693169","DOI":"10.1145\/2676724.2693169"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/11532231_9","volume-title":"Automated Deduction \u2013 CADE-20","author":"G Dufay","year":"2005","unstructured":"Dufay, G., Felty, A., Matwin, S.: Privacy-sensitive information flow with JML. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 116\u2013130. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11532231_9"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-89884-1_18","volume-title":"Programming Languages and Systems","author":"M Eilers","year":"2018","unstructured":"Eilers, M., M\u00fcller, P., Hitz, S.: Modular product programs. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 502\u2013529. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_18"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Saxe, J.B.: Avoiding exponential explosion: generating compact verification conditions. In: Proceedings of the 28th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2001), pp. 193\u2013205. ACM (2001). https:\/\/doi.org\/10.1145\/360204.360220","DOI":"10.1145\/360204.360220"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Floyd, R.W.: Assigning meanings to programs. In: Proceedings of Symposia in Applied Mathematics. Mathematical Aspects of Computer Science, vol. 19, pp. 19\u201332 (1967). https:\/\/doi.org\/10.1090\/psapm\/019\/0235771","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-38574-2_20","volume-title":"Automated Deduction \u2013 CADE-24","author":"C Hawblitzel","year":"2013","unstructured":"Hawblitzel, C., Kawaguchi, M., Lahiri, S.K., Reb\u00ealo, H.: Towards modularly comparing programs using automated theorem provers. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 282\u2013299. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_20"},{"key":"6_CR17","unstructured":"Herms, P.: Certification of a tool chain for deductive program verification. Ph.D. thesis, Universit\u00e9 Paris Sud - Paris XI, January 2013. https:\/\/tel.archives-ouvertes.fr\/tel-00789543"},{"issue":"10","key":"6_CR18","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969). https:\/\/doi.org\/10.1145\/363235.363259","journal-title":"Commun. ACM"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Jourdan, J., Laporte, V., Blazy, S., Leroy, X., Pichardie, D.: A formally-verified C static analyzer. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2015), pp. 247\u2013259. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676966","DOI":"10.1145\/2676726.2676966"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"e20","DOI":"10.1017\/S0956796818000151","volume":"28","author":"R Jung","year":"2018","unstructured":"Jung, R., Krebbers, R., Jourdan, J., Bizjak, A., Birkedal, L., Dreyer, D.: Iris from the ground up: a modular foundation for higher-order concurrent separation logic. J. Funct. Program. 28, e20 (2018). https:\/\/doi.org\/10.1017\/S0956796818000151","journal-title":"J. Funct. Program."},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10817-017-9433-5","volume":"60","author":"M Kiefer","year":"2017","unstructured":"Kiefer, M., Klebanov, V., Ulbrich, M.: Relational program reasoning using compiler IR. J. Autom. Reason. 60(3), 337\u2013363 (2017). https:\/\/doi.org\/10.1007\/s10817-017-9433-5","journal-title":"J. Autom. Reason."},{"key":"6_CR22","volume-title":"Assembly Language for x86 Processors","author":"I Kip","year":"2014","unstructured":"Kip, I.: Assembly Language for x86 Processors, 7th edn. Prentice Hall Press, Upper Saddle River (2014)","edition":"7"},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00165-014-0326-7","volume":"27","author":"F Kirchner","year":"2015","unstructured":"Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-C: a software analysis perspective. Formal Aspects Comput. 27(3), 573\u2013609 (2015). https:\/\/doi.org\/10.1007\/s00165-014-0326-7","journal-title":"Formal Aspects Comput."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-319-08970-6_36","volume-title":"Interactive Theorem Proving","author":"R Krebbers","year":"2014","unstructured":"Krebbers, R., Leroy, X., Wiedijk, F.: Formal C semantics: CompCert and the C standard. In: Klein, G., Gamboa, R. (eds.) ITP 2014. LNCS, vol. 8558, pp. 543\u2013548. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08970-6_36"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-008-9099-0","volume":"41","author":"X Leroy","year":"2008","unstructured":"Leroy, X., Blazy, S.: Formal verification of a C-like memory model and its uses for verifying program transformations. J. Autom. Reason. 41(1), 1\u201331 (2008). https:\/\/doi.org\/10.1007\/s10817-008-9099-0","journal-title":"J. Autom. Reason."},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Maillard, K., Hritcu, C., Rivas, E., Van Muylder, A.: The next 700 relational program logics. In: Proceedings of the 47th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2020), vol. 4, pp. 4:1\u20134:33 (2020). https:\/\/doi.org\/10.1145\/3371072","DOI":"10.1145\/3371072"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-61470-6_7","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles","author":"DA Naumann","year":"2020","unstructured":"Naumann, D.A.: Thirty-seven years of relational Hoare logic: remarks on its principles and history. In: Margaria, T., Steffen, B. (eds.) ISoLA 2020. LNCS, vol. 12477, pp. 93\u2013116. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61470-6_7"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-81688-9_33","volume-title":"Computer Aided Verification","author":"G Parthasarathy","year":"2021","unstructured":"Parthasarathy, G., M\u00fcller, P., Summers, A.J.: Formally validating a practical verification condition generator. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12760, pp. 704\u2013727. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_33"},{"key":"6_CR29","unstructured":"Pierce, B.C., et al.: Logical Foundations. Software Foundations series, vol. 1, Electronic Textbook (2018). http:\/\/www.cis.upenn.edu\/~bcpierce\/sf"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-319-06410-9_39","volume-title":"FM 2014: Formal Methods","author":"C Scheben","year":"2014","unstructured":"Scheben, C., Schmitt, P.H.: Efficient self-composition for weakest precondition calculi. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 579\u2013594. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_39"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-030-25540-4_9","volume-title":"Computer Aided Verification","author":"R Shemer","year":"2019","unstructured":"Shemer, R., Gurfinkel, A., Shoham, S., Vizel, Y.: Property directed self composition. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 161\u2013179. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_9"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Sousa, M., Dillig, I.: Cartesian hoare logic for verifying k-safety properties. In: Proceedings of the 37th Conference on Programming Language Design and Implementation (PLDI 2016), pp. 57\u201369. ACM (2016). https:\/\/doi.org\/10.1145\/2908080.2908092","DOI":"10.1145\/2908080.2908092"},{"key":"6_CR33","unstructured":"The Coq Development Team: The Coq Proof Assistant (2021). https:\/\/coq.inria.fr\/"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-030-81685-8_35","volume-title":"Computer Aided Verification","author":"H Unno","year":"2021","unstructured":"Unno, H., Terauchi, T., Koskinen, E.: Constraint-based relational verification. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 742\u2013766. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_35"},{"key":"6_CR35","unstructured":"Wils, S., Jacobs, B.: Certifying C program correctness with respect to CompCert with VeriFast. CoRR abs\/2110.11034 (2021). https:\/\/arxiv.org\/abs\/2110.11034"},{"key":"6_CR36","series-title":"Foundation of Computing Series","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages - An Introduction","author":"G Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages - An Introduction. Foundation of Computing Series, MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07727-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T19:19:21Z","timestamp":1654629561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07727-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031077265","9783031077272"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07727-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lugano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ifmconference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Also includes: 1 abstract of an invited talk, 2 invited papers, 7 extended abstracts of presentations accepted at PhD symposium","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}