{"id":"https://openalex.org/W6910556822","doi":"https://doi.org/10.4230/lipics.concur.2023.2","title":"On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk)","display_name":"On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk)","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6910556822","doi":"https://doi.org/10.4230/lipics.concur.2023.2"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:18996","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol279-concur2023/LIPIcs.CONCUR.2023.2/LIPIcs.CONCUR.2023.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol279-concur2023/LIPIcs.CONCUR.2023.2/LIPIcs.CONCUR.2023.2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bouajjani, Ahmed","orcid":"https://orcid.org/0000-0002-2060-3592"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bouajjani, Ahmed","raw_affiliation_strings":["Universit\u00e9 Paris Cit\u00e9, CNRS, IRIF, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Cit\u00e9, CNRS, IRIF, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3335015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.7156999707221985,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.7156999707221985,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.11890000104904175,"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.059300001710653305,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/consistency-model","display_name":"Consistency model","score":0.83160001039505},{"id":"https://openalex.org/keywords/weak-consistency","display_name":"Weak consistency","score":0.8029999732971191},{"id":"https://openalex.org/keywords/sequential-consistency","display_name":"Sequential consistency","score":0.7853000164031982},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7179999947547913},{"id":"https://openalex.org/keywords/causal-consistency","display_name":"Causal consistency","score":0.5874000191688538},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5667999982833862},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5317999720573425},{"id":"https://openalex.org/keywords/strong-consistency","display_name":"Strong consistency","score":0.4959000051021576},{"id":"https://openalex.org/keywords/memory-model","display_name":"Memory model","score":0.37880000472068787}],"concepts":[{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.83160001039505},{"id":"https://openalex.org/C122377713","wikidata":"https://www.wikidata.org/wiki/Q4422799","display_name":"Weak consistency","level":4,"score":0.8029999732971191},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.7853000164031982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7404999732971191},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7179999947547913},{"id":"https://openalex.org/C175652121","wikidata":"https://www.wikidata.org/wiki/Q4379351","display_name":"Causal consistency","level":5,"score":0.5874000191688538},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5667999982833862},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5317999720573425},{"id":"https://openalex.org/C31388003","wikidata":"https://www.wikidata.org/wiki/Q7624548","display_name":"Strong consistency","level":3,"score":0.4959000051021576},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4465000033378601},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.37880000472068787},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35830000042915344},{"id":"https://openalex.org/C77781355","wikidata":"https://www.wikidata.org/wiki/Q223335","display_name":"Structured programming","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C34422012","wikidata":"https://www.wikidata.org/wiki/Q6125872","display_name":"Eventual consistency","level":4,"score":0.3133000135421753},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3109000027179718},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.30809998512268066},{"id":"https://openalex.org/C141917322","wikidata":"https://www.wikidata.org/wiki/Q1025017","display_name":"Cache coherence","level":5,"score":0.3050999939441681},{"id":"https://openalex.org/C93361087","wikidata":"https://www.wikidata.org/wiki/Q4426698","display_name":"Data consistency","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.2556000053882599},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.25209999084472656},{"id":"https://openalex.org/C33762810","wikidata":"https://www.wikidata.org/wiki/Q461671","display_name":"Data integrity","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:18996","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol279-concur2023/LIPIcs.CONCUR.2023.2/LIPIcs.CONCUR.2023.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.concur.2023.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.concur.2023.2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:18996","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol279-concur2023/LIPIcs.CONCUR.2023.2/LIPIcs.CONCUR.2023.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6910556822.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Developing":[0],"correct":[1],"and":[2,68,100,207,224],"performant":[3],"concurrent":[4,32],"systems":[5],"is":[6,27,113,130,216],"a":[7,15,18,86,127,166,187,193,201],"major":[8],"challenge.":[9],"When":[10],"programming":[11],"an":[12,118,161,174,184],"application":[13,108,145,162,175],"using":[14],"memory":[16,25,50,87,92],"system,":[17],"natural":[19],"expectation":[20],"would":[21],"be":[22,47,59],"that":[23,129,183],"each":[24,63,124],"update":[26],"immediately":[28],"visible":[29,61],"to":[30,36,62,90,116,133,140,149],"all":[31],"threads":[33],"(which":[34],"corresponds":[35,89],"strong":[37,138],"consistency).":[38],"However,":[39],"for":[40,123],"performance":[41],"reasons,":[42],"only":[43],"weaker":[44],"guarantees":[45,192],"can":[46,58],"ensured":[48],"by":[49,53,69,85],"systems,":[51],"defined":[52],"what":[54],"sets":[55],"of":[56,107,121,143,152,160,173,186,204],"updates":[57],"made":[60,76],"thread":[64],"at":[65],"any":[66],"moment,":[67],"the":[70,81,105,144,150,158,171,181,227],"order":[71,83],"in":[72,210],"which":[73,103],"they":[74],"are":[75],"visible.":[77],"The":[78,198,214],"conditions":[79],"on":[80,218],"visibility":[82],"guaranteed":[84],"system":[88,188],"its":[91],"consistency":[93,96,122,168,178,196],"model.":[94,197],"Weak":[95],"models":[97],"admit":[98],"complex":[99],"unintuitive":[101],"behaviors,":[102],"makes":[104],"task":[106],"programmers":[109],"extremely":[110],"hard.":[111],"It":[112],"therefore":[114],"important":[115,154],"determine":[117],"adequate":[119],"level":[120,128],"given":[125,194],"application:":[126],"weak":[131,167],"enough":[132,139],"ensure":[134,141],"performance,":[135],"but":[136],"also":[137],"correctness":[142,159],"behaviors.":[146],"This":[147],"leads":[148],"consideration":[151],"several":[153,219],"verification":[155],"problems:":[156],"-":[157,170,180],"program":[163,176],"running":[164],"over":[165],"model;":[169],"robustness":[172],"w.r.t.":[177],"weakening;":[179],"fact":[182],"implementation":[185],"(memory,":[189],"storage":[190],"system)":[191],"(weak)":[195],"talk":[199,215],"gives":[200],"broad":[202],"presentation":[203],"these":[205],"issues":[206],"some":[208],"results":[209],"this":[211],"research":[212],"area.":[213],"based":[217],"joint":[220],"works":[221],"with":[222],"students":[223],"colleagues":[225],"during":[226],"last":[228],"few":[229],"years.":[230]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}