{"id":"https://openalex.org/W7168289114","doi":"https://doi.org/10.48550/arxiv.2607.11582","title":"A Separation Logic for Parallel Time Complexity with Work and Span Credits","display_name":"A Separation Logic for Parallel Time Complexity with Work and Span Credits","publication_year":2026,"publication_date":"2026-07-13","ids":{"openalex":"https://openalex.org/W7168289114","doi":"https://doi.org/10.48550/arxiv.2607.11582"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.11582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.11582","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.11582","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140686521","display_name":"Alexandre Moine","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moine, Alexandre","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140747600","display_name":"Sam Westrick","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Westrick, Sam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140707051","display_name":"Joseph Tassarotti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tassarotti, Joseph","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.3407000005245209,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.3407000005245209,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.3312000036239624,"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.1623000055551529,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5073999762535095},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.4390999972820282},{"id":"https://openalex.org/keywords/span","display_name":"Span (engineering)","score":0.4255000054836273},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4074999988079071},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4065000116825104},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.40369999408721924},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.3871999979019165},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.33230000734329224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7432000041007996},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5073999762535095},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.4390999972820282},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4291999936103821},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.4255000054836273},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4065000116825104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35249999165534973},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.33230000734329224},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27880001068115234},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.11582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.11582","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.11582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.11582","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,220],"present":[1],"Parcas,":[2],"a":[3,97,103,125,155,169,212,217,235],"concurrent":[4],"separation":[5,259],"logic":[6,197,260],"for":[7,28,106,151,157,206,214],"verifying":[8],"the":[9,21,24,38,41,47,50,61,73,130,133,140,143,146,247,253,257],"parallel":[10,29,119,134,208,213,228,231],"time":[11,26,63,101,108],"complexity":[12,27,109],"of":[13,23,35,44,53,67,100,110,132,136,142,145,237],"fork-join":[14],"programs.":[15],"In":[16],"order":[17],"to":[18,91,187,193,201],"abstract":[19],"from":[20],"specifics":[22],"machine,":[25],"programs":[30],"is":[31,78,139,198],"given":[32],"in":[33,252],"terms":[34],"two":[36,58,137,147],"metrics:":[37],"work,":[39],"measuring":[40,49],"total":[42],"number":[43,66],"operations,":[45],"and":[46,75,83,113,216,234],"span,":[48,76],"longest":[51],"chain":[52],"sequential":[54,111,191],"dependencies.":[55],"Together,":[56],"these":[57],"metrics":[59],"determine":[60],"running":[62],"on":[64,72,223],"any":[65],"processors.":[68],"For":[69],"proving":[70],"bounds":[71],"work":[74,81],"Parcas":[77,222],"equipped":[79],"with":[80,164,244],"credits":[82,95,160,186],"span":[84,131,144,159,185],"credits,":[85,102,122],"logical":[86,170],"devices":[87],"that":[88,173,241],"represent":[89],"permissions":[90],"incur":[92],"costs.":[93],"Work":[94],"are":[96,250],"straightforward":[98],"adaptation":[99],"standard":[104],"tool":[105],"bounding":[107],"programs,":[112],"can":[114],"be":[115,188],"split":[116],"additively":[117],"between":[118],"tasks.":[120,148,195],"Span":[121],"however,":[123],"require":[124],"fundamentally":[126],"different":[127],"treatment.":[128],"Indeed,":[129],"composition":[135],"tasks":[138],"maximum":[141],"To":[149],"account":[150],"this,":[152],"we":[153],"propose":[154],"rule":[156,182],"duplicating":[158],"at":[161],"fork":[162],"points,":[163],"each":[165],"copy":[166],"tagged":[167],"by":[168],"task":[171,176],"identifier":[172],"restricts":[174],"which":[175],"may":[177],"spend":[178],"them.":[179],"A":[180],"transfer":[181],"allows":[183],"unused":[184],"forwarded":[189],"across":[190],"compositions":[192],"subsequent":[194],"The":[196],"expressive":[199],"enough":[200],"give":[202],"modular,":[203],"higher-order":[204],"specifications":[205],"common":[207],"primitives":[209],"such":[210],"as":[211],"loop":[215],"tabulate":[218],"function.":[219],"demonstrate":[221],"several":[224],"case":[225],"studies,":[226],"including":[227],"prefix":[229],"sums,":[230],"merge":[232],"sort,":[233],"variant":[236],"Treiber's":[238],"lock-free":[239],"stack":[240],"mixes":[242],"concurrency":[243],"parallelism.":[245],"All":[246],"presented":[248],"results":[249],"mechanized":[251],"Rocq":[254],"prover":[255],"using":[256],"Iris":[258],"framework.":[261]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-15T00:00:00"}