{"id":"https://openalex.org/W2966434214","doi":"https://doi.org/10.1145/3341709","title":"Mechanized relational verification of concurrent programs with continuations","display_name":"Mechanized relational verification of concurrent programs with continuations","publication_year":2019,"publication_date":"2019-07-26","ids":{"openalex":"https://openalex.org/W2966434214","doi":"https://doi.org/10.1145/3341709","mag":"2966434214"},"language":"en","primary_location":{"id":"doi:10.1145/3341709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3341709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3341709","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3341709","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030831735","display_name":"Amin Timany","orcid":"https://orcid.org/0000-0002-2237-851X"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Amin Timany","raw_affiliation_strings":["KU Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030831735"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":0.867,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.80983179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"3","issue":"ICFP","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8461174964904785},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7822138071060181},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6900559067726135},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.6824383735656738},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.6300991773605347},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5181552171707153},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4310978651046753},{"id":"https://openalex.org/keywords/concurrent-object-oriented-programming","display_name":"Concurrent object-oriented programming","score":0.42503416538238525},{"id":"https://openalex.org/keywords/hoare-logic","display_name":"Hoare logic","score":0.4197540879249573},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.3554683029651642},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.3117574453353882},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.26861268281936646}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8461174964904785},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7822138071060181},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6900559067726135},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.6824383735656738},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.6300991773605347},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5181552171707153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4310978651046753},{"id":"https://openalex.org/C3701939","wikidata":"https://www.wikidata.org/wiki/Q5159109","display_name":"Concurrent object-oriented programming","level":5,"score":0.42503416538238525},{"id":"https://openalex.org/C104949639","wikidata":"https://www.wikidata.org/wiki/Q1375924","display_name":"Hoare logic","level":3,"score":0.4197540879249573},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3554683029651642},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.3117574453353882},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.26861268281936646}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3341709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3341709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3341709","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/8d7e0e01-b5d5-48e8-a48a-8fcca5d2a8d5","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/8d7e0e01-b5d5-48e8-a48a-8fcca5d2a8d5","pdf_url":"https://pure.au.dk/ws/files/195350668/3341709.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Timany, A & Birkedal, L 2019, 'Mechanized relational verification of concurrent programs with continuations', Proceedings of the ACM on Programming Languages , vol. 3, no. ICFP, 105, pp. 1-28. https://doi.org/10.1145/3341709","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3341709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3341709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3341709","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3231420740","display_name":null,"funder_award_id":"postdoc","funder_id":"https://openalex.org/F4320321730","funder_display_name":"Fonds Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2966434214.pdf","grobid_xml":"https://content.openalex.org/works/W2966434214.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W34828567","https://openalex.org/W75891272","https://openalex.org/W143008620","https://openalex.org/W175195251","https://openalex.org/W1534339430","https://openalex.org/W1553136405","https://openalex.org/W1965602413","https://openalex.org/W1967996089","https://openalex.org/W1987454389","https://openalex.org/W1991984504","https://openalex.org/W2007270285","https://openalex.org/W2007759294","https://openalex.org/W2026879022","https://openalex.org/W2028861803","https://openalex.org/W2081281361","https://openalex.org/W2100747331","https://openalex.org/W2101443478","https://openalex.org/W2101939036","https://openalex.org/W2114834520","https://openalex.org/W2119916221","https://openalex.org/W2123329569","https://openalex.org/W2130505204","https://openalex.org/W2132761501","https://openalex.org/W2132818695","https://openalex.org/W2136739578","https://openalex.org/W2137554739","https://openalex.org/W2147323041","https://openalex.org/W2150224578","https://openalex.org/W2151716725","https://openalex.org/W2162091032","https://openalex.org/W2164719159","https://openalex.org/W2280241954","https://openalex.org/W2293168108","https://openalex.org/W2295840408","https://openalex.org/W2402209726","https://openalex.org/W2509578035","https://openalex.org/W2544417439","https://openalex.org/W2562833768","https://openalex.org/W2567502494","https://openalex.org/W2596377803","https://openalex.org/W2776685097","https://openalex.org/W2901454403","https://openalex.org/W2949578585","https://openalex.org/W3043991989","https://openalex.org/W3049422318","https://openalex.org/W4229652664","https://openalex.org/W4230665378","https://openalex.org/W4235454363","https://openalex.org/W4237730680","https://openalex.org/W4241333267","https://openalex.org/W4247598266"],"related_works":["https://openalex.org/W2096553703","https://openalex.org/W183428347","https://openalex.org/W4318145497","https://openalex.org/W1536810838","https://openalex.org/W2165970356","https://openalex.org/W3148010226","https://openalex.org/W2120897738","https://openalex.org/W3142658169","https://openalex.org/W2479659155","https://openalex.org/W4390603522"],"abstract_inverted_index":{"Concurrent":[0],"higher-order":[1,125],"imperative":[2,126],"programming":[3,17,57,127],"languages":[4,58],"with":[5,129,161,223],"continuations":[6,26,78,130],"are":[7,59],"very":[8,60],"flexible":[9],"and":[10,132,245],"allow":[11],"for":[12,114,193,204,228],"the":[13,49,67,75,82,85,91,96,109,175,185,205,208,241,252],"implementation":[14,157],"of":[15,48,51,66,77,88,95,101,119,147,155,158,207,243],"sophisticated":[16],"patterns.":[18],"For":[19],"instance,":[20],"it":[21],"is":[22,79,178],"well":[23],"known":[24],"that":[25,84,167,168,232],"can":[27,35,140,218],"be":[28,141,219],"used":[29,142,220],"to":[30,62,81,143,181,199,248],"implement":[31],"cooperative":[32,159],"concurrency.":[33],"Continuations":[34],"also":[36],"simplify":[37,45,249],"web":[38,171],"server":[39,172],"implementations.":[40],"This,":[41],"in":[42,70,74,122,221],"particular,":[43,151],"helps":[44],"keeping":[46],"track":[47],"state":[50],"server\u2019s":[52],"clients.":[53],"However,":[54],"such":[55],"advanced":[56],"challenging":[61],"reason":[63],"about.":[64],"One":[65],"main":[68],"challenges":[69],"reasoning":[71,99,191,202,216,229,247,250],"about":[72,230,251],"programs":[73,120,231],"presence":[76],"due":[80],"fact":[83],"non-local":[86,211,235],"flow":[87],"control":[89,212,236],"breaks":[90],"bind":[92],"rule,":[93],"one":[94,182],"important":[97],"modular":[98,201],"principles":[100,192,203,217],"Hoare":[102,226],"logic.":[103],"In":[104,150,163],"this":[105],"paper":[106],"we":[107,152,165,239],"present":[108],"first":[110],"completely":[111],"formalized":[112],"tool":[113],"interactive":[115],"mechanized":[116,145],"relational":[117,148],"verification":[118],"written":[121],"a":[123,169],"concurrent":[124],"language":[128,209],"(call/cc":[131],"throw).":[133],"We":[134,188],"develop":[135],"novel":[136,215],"logical":[137],"relations":[138],"which":[139,196],"give":[144],"proofs":[146],"properties.":[149],"prove":[153],"correctness":[154],"an":[156],"concurrency":[160],"continuations.":[162],"addition,":[164],"show":[166],"rudimentary":[170],"implemented":[173,183],"using":[174],"continuation-based":[176,186],"pattern":[177],"contextually":[179],"equivalent":[180],"without":[184,210],"pattern.":[187],"introduce":[189],"context-local":[190,244],"our":[194,224],"calculus":[195],"allows":[197],"us":[198],"regain":[200],"fragment":[206],"flow.":[213,237],"These":[214],"tandem":[222],"(non-context-local)":[225],"logic":[227],"do":[233],"feature":[234],"Indeed,":[238],"use":[240],"combination":[242],"non-context-local":[246],"examples.":[253]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}