{"id":"https://openalex.org/W7126386655","doi":"https://doi.org/10.1145/3779649","title":"Analysing a Library of Concurrency Primitives using CSP","display_name":"Analysing a Library of Concurrency Primitives using CSP","publication_year":2026,"publication_date":"2026-01-31","ids":{"openalex":"https://openalex.org/W7126386655","doi":"https://doi.org/10.1145/3779649"},"language":"en","primary_location":{"id":"doi:10.1145/3779649","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3779649","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3779649","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112337734","display_name":"Gavin Lowe","orcid":null},"institutions":[{"id":"https://openalex.org/I142767807","display_name":"St. Catherine University","ror":"https://ror.org/03x1f1d90","country_code":"US","type":"education","lineage":["https://openalex.org/I142767807"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gavin Lowe","raw_affiliation_strings":["St Catherine's College, Oxford University"],"raw_orcid":"https://orcid.org/0000-0002-6453-5675","affiliations":[{"raw_affiliation_string":"St Catherine's College, Oxford University","institution_ids":["https://openalex.org/I142767807"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112337734"],"corresponding_institution_ids":["https://openalex.org/I142767807"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19058296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"1","first_page":"1","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6841999888420105,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6841999888420105,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.17409999668598175,"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.03840000182390213,"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/concurrency","display_name":"Concurrency","score":0.8496999740600586},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8037999868392944},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.742900013923645},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6351000070571899},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.4794999957084656},{"id":"https://openalex.org/keywords/composition","display_name":"Composition (language)","score":0.47760000824928284},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.43320000171661377},{"id":"https://openalex.org/keywords/communicating-sequential-processes","display_name":"Communicating sequential processes","score":0.42879998683929443}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8496999740600586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8197000026702881},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8037999868392944},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.742900013923645},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6351000070571899},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.609000027179718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4921000003814697},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.4794999957084656},{"id":"https://openalex.org/C40231798","wikidata":"https://www.wikidata.org/wiki/Q1333743","display_name":"Composition (language)","level":2,"score":0.47760000824928284},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C155214134","wikidata":"https://www.wikidata.org/wiki/Q1120460","display_name":"Communicating sequential processes","level":4,"score":0.42879998683929443},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.40880000591278076},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.39899998903274536},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39500001072883606},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36970001459121704},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C95203288","wikidata":"https://www.wikidata.org/wiki/Q221682","display_name":"Semaphore","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C175971053","wikidata":"https://www.wikidata.org/wiki/Q827335","display_name":"Abstract data type","level":2,"score":0.25609999895095825}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3779649","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3779649","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3779649","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3779649","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488858096","https://openalex.org/W1560316555","https://openalex.org/W1840677318","https://openalex.org/W1975483972","https://openalex.org/W2036526834","https://openalex.org/W2038952689","https://openalex.org/W2039277865","https://openalex.org/W2042876806","https://openalex.org/W2078729172","https://openalex.org/W2090551028","https://openalex.org/W2101939036","https://openalex.org/W2128510433","https://openalex.org/W2147269402","https://openalex.org/W2155032609","https://openalex.org/W2561986775","https://openalex.org/W2960457378","https://openalex.org/W4206443926","https://openalex.org/W4384030679","https://openalex.org/W4393955129"],"related_works":[],"abstract_inverted_index":{"We":[0,21,38],"carry":[1],"out":[2,101],"an":[3,14,83,110,132],"analysis":[4,81,91,105],"of":[5,43,106,109,145],"message-passing":[6],"concurrency":[7],"primitives,":[8],"namely":[9],"a":[10,54,86,96,103,123,129,136],"synchronous":[11],"channel":[12,130],"and":[13,30,57,112,131,140,152],"alt":[15,111,133],"(alternation)":[16],"construct,":[17],"implemented":[18],"in":[19,77,85],"Scala.":[20],"model":[22,35],"these":[23,72,146],"primitives":[24],"using":[25,33],"the":[26,34,40,107,143],"process":[27],"algebra":[28],"CSP,":[29],"analyse":[31],"them":[32],"checker":[36],"FDR.":[37],"consider":[39],"correctness":[41],"properties":[42,73],"synchronisation":[44,150],"linearisation":[45,151],"(informally,":[46,59],"that":[47,60,102,128,142],"each":[48,134],"completed":[49],"operation":[50],"execution":[51],"corresponds":[52],"to":[53,94],"correct":[55,97],"synchronisation)":[56],"progressibility":[58],"executions":[61],"don\u2019t":[62],"get":[63],"stuck":[64],"if":[65],"they":[66],"could":[67],"synchronise):":[68],"we":[69,121,126],"show":[70,127,141],"how":[71],"can":[74],"be":[75],"captured":[76],"CSP.":[78],"Our":[79],"initial":[80],"discovered":[82],"error":[84],"previous":[87],"implementation;":[88],"our":[89],"subsequent":[90],"helped":[92],"us":[93],"produce":[95],"implementation.":[98],"It":[99],"turns":[100],"direct":[104],"composition":[108,144],"corresponding":[113],"channels":[114],"scales":[115],"quite":[116],"poorly.":[117],"To":[118],"overcome":[119],"this,":[120],"perform":[122],"compositional":[124],"analysis:":[125],"satisfies":[135,149],"more":[137],"abstract":[138,147],"description;":[139],"descriptions":[148],"progressibility.":[153]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-02-02T00:00:00"}