{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:31:04Z","timestamp":1770273064303,"version":"3.49.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031210365","type":"print"},{"value":"9783031210372","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-21037-2_4","type":"book-chapter","created":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T00:05:14Z","timestamp":1669334714000},"page":"67-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["RHLE: Modular Deductive Verification of\u00a0Relational $$\\forall \\exists $$ Properties"],"prefix":"10.1007","author":[{"given":"Robert","family":"Dickerson","sequence":"first","affiliation":[]},{"given":"Qianchuan","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Michael K.","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Delaware","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. In: [1988] Proceedings. Third Annual Symposium on Logic in Computer Science, pp. 165\u2013175 (1988)","DOI":"10.1109\/LICS.1988.5115"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aguirre, A., Barthe, G., Gaboardi, M., Garg, D., Strub, P.Y.: A relational logic for higher-order programs. Proc. ACM Program. Lang. 1(ICFP), 21:1\u201321:29 (Aug 2017)","DOI":"10.1145\/3110265"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Appel, A.W.: Verified software toolchain. In: Barthe, G. (ed.) Programming Languages and Systems, vol. 6602, pp. 1\u201317. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19718-5_1","DOI":"10.1007\/978-3-642-19718-5_1"},{"key":"4_CR4","unstructured":"Banerjee, A., Nagasamudram, R., Naumann, D.A., Nikouei, M.: A relational program logic with data abstraction and dynamic framing. arXiv preprint arXiv:1910.14560 (2019)"},{"key":"4_CR5","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"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Barthe, G., Crespo, J.M., Kunz, C.: Beyond 2-safety: asymmetric product programs for relational program verification. In: International Symposium on Logical Foundations of Computer Science, pp. 29\u201343. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-35722-0_3","DOI":"10.1007\/978-3-642-35722-0_3"},{"issue":"6","key":"4_CR7","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. Math. Struct. Comput. Sci. 21(6), 1207\u20131252 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1594834.1480894","volume":"44","author":"G Barthe","year":"2009","unstructured":"Barthe, G., Gr\u00e9goire, B., Zanella B\u00e9guelin, S.: Formal certification of code-based cryptographic proofs. SIGPLAN Not. 44(1), 90\u2013101 (2009)","journal-title":"SIGPLAN Not."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 14\u201325. POPL \u201904, ACM, New York, NY, USA (2004)","DOI":"10.1145\/964001.964003"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-58043-3_19","volume-title":"A Decade of Concurrency Reflections and Perspectives","author":"E Clarke","year":"1994","unstructured":"Clarke, E., Grumberg, O., Long, D.: Verification tools for finite-state concurrent systems. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 124\u2013175. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58043-3_19"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., S\u00e1nchez, C.: Temporal logics for hyperproperties. In: International Conference on Principles of Security and Trust, pp. 265\u2013284. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-54792-8_15","DOI":"10.1007\/978-3-642-54792-8_15"},{"issue":"6","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Coenen, N., Finkbeiner, B., S\u00e1nchez, C., Tentrup, L.: Verifying hyperliveness, pp. 121\u2013139 (07 2019)","DOI":"10.1007\/978-3-030-25540-4_7"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Cook, B., Koskinen, E.: Reasoning about nondeterminism in programs. In: Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation, pp. 219\u2013230 (2013)","DOI":"10.1145\/2499370.2491969"},{"key":"4_CR15","unstructured":"Dickerson, R., Ye, Q., Zhang, M.K., Delaware, B.: Rhle: modular deductive verification of relational $$\\forall \\exists $$ properties (extended paper) (2020). 10.48550\/ARXIV.2002.02904"},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7058107","author":"R Dickerson","year":"2022","unstructured":"Dickerson, R., Ye, Q., Zhang, M.K., Delaware, B.: ORHLE (2022). https:\/\/doi.org\/10.5281\/zenodo.7058107","journal-title":"ORHLE"},{"key":"4_CR17","unstructured":"Dickerson, R., Ye, Q., Zhang, M.K., Delaware, B.: RHLE Benchmarks (2022). https:\/\/github.com\/rcdickerson\/rhle-benchmarks"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Dillig, I., Dillig, T., Li, B., McMillan, K.: Inductive invariant generation via abductive inference. In: Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages and Applications, pp. 443\u2013456. OOPSLA \u201913, Association for Computing Machinery, New York, NY, USA (2013)","DOI":"10.1145\/2509136.2509511"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Leino, K.R.M.: Houdini, an Annotation Assistant for ESC\/Java. In: Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity, pp. 500\u2013517. FME \u201901, Springer-Verlag, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-45251-6_29"},{"issue":"10","key":"4_CR20","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)","journal-title":"Commun. ACM"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Jung, R., Jourdan, J.H., Krebbers, R., Dreyer, D.: Rustbelt: securing the foundations of the rust programming language. Proc. ACM Program. Lang. 2(POPL), 1\u201334 (dec 2017)","DOI":"10.1145\/3158154"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Jung, R., et al.: The future is ours: prophecy variables in separation logic. Proc. ACM Program. Lang. 4(POPL), 1\u201332 (Dec 2019)","DOI":"10.1145\/3371113"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, M., Seidl, H., Finkbeiner, B.: Relational abstract interpretation for the verification of 2-hypersafety properties, pp. 211\u2013222 (11 2013)","DOI":"10.1145\/2508859.2516721"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Lam, W., Oei, R., Shi, A., Marinov, D., Xie, T.: idflakies: a framework for detecting and partially classifying flaky tests. In: 2019 12th IEEE Conference on Software Testing, Validation and Verification (ICST), pp. 312\u2013322 (2019)","DOI":"10.1109\/ICST.2019.00038"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Lamport, L., Schneider, F.B.: Verifying Hyperproperties with TLA. In: 2021 IEEE 34th Computer Security Foundations Symposium (CSF), pp. 1\u201316. iSSN: 2374\u20138303 (Jun 2021)","DOI":"10.1109\/CSF51468.2021.00012"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"McLean, J.: A general theory of composition for a class of \"possibilistic\" properties. IEEE Trans. Softw. Eng. 22(1), 53\u201367 (Jan 1996)","DOI":"10.1109\/32.481534"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Nagasamudram, R., Naumann, D.A.: Alignment completeness for relational hoare logics. In: 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313 (2021)","DOI":"10.1109\/LICS52264.2021.9470690"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P.W.: Resources, concurrency, and local reasoning. Theor. Comput. Sci. 375(1), 271\u2013307 (2007), festschrift for John C. Reynolds\u2019s 70th birthday","DOI":"10.1016\/j.tcs.2006.12.035"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P.W.: Incorrectness logic. Proc. ACM Program. Lang. 4(POPL) 1\u201332 (Dec 2019)","DOI":"10.1145\/3371078"},{"issue":"6","key":"4_CR30","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/2980983.2908099","volume":"51","author":"S Padhi","year":"2016","unstructured":"Padhi, S., Sharma, R., Millstein, T.: Data-driven precondition inference with learned features. ACM SIGPLAN Notices 51(6), 42\u201356 (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR31","unstructured":"Padhi, S., Sharma, R., Millstein, T.: Loopinvgen: a loop invariant generator based on precondition inference (2017)"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Poetzsch-Heffter, A., M\u00fcller, P.: A Programming Logic for Sequential Java. In: Swierstra, S.D. (ed.) Programming Languages and Systems, vol. 1576, pp. 162\u2013176. Springer, Berlin Heidelberg, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49099-X_11","DOI":"10.1007\/3-540-49099-X_11"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical consideration on Floyd-Hoare logic. In: 17th Annual Symposium on Foundations of Computer Science (sfcs 1976), pp. 109\u2013121. IEEE (1976)","DOI":"10.1109\/SFCS.1976.27"},{"key":"4_CR34","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp. 55\u201374 (2002)"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Shi, A., Gyori, A., Legunsen, O., Marinov, D.: Detecting assumptions on deterministic implementations of non-deterministic specifications. In: 2016 IEEE International Conference on Software Testing, Verification and Validation (ICST), pp. 80\u201390 (2016)","DOI":"10.1109\/ICST.2016.40"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Sousa, M., Dillig, I.: Cartesian hoare logic for verifying k-safety properties. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 57\u201369. PLDI \u201916, ACM, New York, NY, USA (2016)","DOI":"10.1145\/2908080.2908092"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"Terauchi, T., Aiken, A.: Secure information flow as a safety problem. In: Hankin, C., Siveroni, I. (eds.) Static Analysis, vol. 3672, pp. 352\u2013367. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11547662_24","DOI":"10.1007\/11547662_24"},{"key":"4_CR38","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":"4_CR39","doi-asserted-by":"publisher","unstructured":"de Vries, E., Koutavas, V.: Reverse hoare logic. In: Proceedings of the 9th International Conference on Software Engineering and Formal Methods, pp. 155\u2013171. SEFM\u201911, Springer-Verlag, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_12","DOI":"10.1007\/978-3-642-24690-6_12"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21037-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T14:31:25Z","timestamp":1728484285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21037-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210365","9783031210372"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21037-2_4","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":"25 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","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":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","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":"10","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":"0","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":"45% - 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":"4","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)"}}]}}