{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:50:05Z","timestamp":1782953405400,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T00:00:00Z","timestamp":1484524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,16]]},"DOI":"10.1145\/3018610.3018627","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T21:20:29Z","timestamp":1482441629000},"page":"138-150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Complx: a verification framework for concurrent imperative programs"],"prefix":"10.1145","author":[{"given":"Sidney","family":"Amani","sequence":"first","affiliation":[{"name":"Data61 at CSIRO, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"June","family":"Andronick","sequence":"additional","affiliation":[{"name":"Data61 at CSIRO, Australia \/ UNSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maksym","family":"Bortin","sequence":"additional","affiliation":[{"name":"Data61 at CSIRO, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Corey","family":"Lewis","sequence":"additional","affiliation":[{"name":"Data61 at CSIRO, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christine","family":"Rizkallah","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA \/ Data61 at CSIRO, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph","family":"Tuong","sequence":"additional","affiliation":[{"name":"Data61 at CSIRO, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,1,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-013-9289-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-013-9289-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.196.2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43144-4_4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28891-3_2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/69575.69577"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676980"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951943"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1743546.1743574"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_25"},{"key":"e_1_3_2_1_12_1","volume-title":"The LEDA Platform for Combinatorial and Geometric Computing","author":"Mehlhorn K.","year":"1999","unstructured":"K. Mehlhorn and S. N\u00e4her . The LEDA Platform for Combinatorial and Geometric Computing . Cambridge University Press , 1999 . K. Mehlhorn and S. N\u00e4her. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35308-6_12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_16"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791547"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.035"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268134"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of Isabelle Workshop 2014","author":"Rizkallah C.","year":"2014","unstructured":"C. Rizkallah . A Simpl shortest path checker verification . In Proceedings of Isabelle Workshop 2014 , 2014 . C. Rizkallah. A Simpl shortest path checker verification. In Proceedings of Isabelle Workshop 2014, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2737964"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190234"},{"key":"e_1_3_2_1_23_1","volume-title":"http:\/\/www.verisoftxt.de","author":"XT.","year":"2010","unstructured":"Verisoft XT. Verisoft XT. http:\/\/www.verisoftxt.de , 2010 . Verisoft XT. Verisoft XT. http:\/\/www.verisoftxt.de, 2010."},{"key":"e_1_3_2_1_24_1","unstructured":"Introduction Background Verification of C in Isabelle\/HOL Verification of Concurrent Code in Isabelle\/HOL 99993em.5Complx: Syntax and Semantics Owicki-Gries Logic for 99993em.5Complx Annotations Owicki-Gries Rules Interference Freedom VCG Soundness Proof Case Study Related Work Conclusion and Future Work  Introduction Background Verification of C in Isabelle\/HOL Verification of Concurrent Code in Isabelle\/HOL 99993em.5Complx: Syntax and Semantics Owicki-Gries Logic for 99993em.5Complx Annotations Owicki-Gries Rules Interference Freedom VCG Soundness Proof Case Study Related Work Conclusion and Future Work"}],"event":{"name":"CPP '17: Certified Proofs and Programs","location":"Paris France","acronym":"CPP '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018610.3018627","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3018610.3018627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:59Z","timestamp":1750220639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018610.3018627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,16]]},"references-count":22,"alternative-id":["10.1145\/3018610.3018627","10.1145\/3018610"],"URL":"https:\/\/doi.org\/10.1145\/3018610.3018627","relation":{},"subject":[],"published":{"date-parts":[[2017,1,16]]},"assertion":[{"value":"2017-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}