{"id":"https://openalex.org/W3173557304","doi":"https://doi.org/10.1109/lics52264.2021.9470691","title":"Verifying higher-order concurrency with data automata","display_name":"Verifying higher-order concurrency with data automata","publication_year":2021,"publication_date":"2021-06-29","ids":{"openalex":"https://openalex.org/W3173557304","doi":"https://doi.org/10.1109/lics52264.2021.9470691","mag":"3173557304"},"language":"en","primary_location":{"id":"doi:10.1109/lics52264.2021.9470691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://hal.science/hal-03440079","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037923510","display_name":"Alex Dixon","orcid":"https://orcid.org/0000-0003-3048-5128"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Alex Dixon","raw_affiliation_strings":["Department of Computer Science, University of Warwick"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016064325","display_name":"Ranko Lazi\u0107","orcid":"https://orcid.org/0000-0003-3663-5182"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ranko Lazic","raw_affiliation_strings":["Department of Computer Science, University of Warwick"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000119795","display_name":"Andrzej S. Murawski","orcid":"https://orcid.org/0000-0002-4725-410X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrzej S. Murawski","raw_affiliation_strings":["Department of Computer Science, University of Oxford"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064757019","display_name":"Igor Walukiewicz","orcid":null},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Igor Walukiewicz","raw_affiliation_strings":["CNRS, Universit\u00e9 de Bordeaux"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 de Bordeaux","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5037923510"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.28220715,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62098288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":null,"first_page":"1","last_page":"13"},"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.9998000264167786,"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.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"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.7462215423583984},{"id":"https://openalex.org/keywords/finitary","display_name":"Finitary","score":0.6514484286308289},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.630907416343689},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5822576880455017},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5781413912773132},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5706729888916016},{"id":"https://openalex.org/keywords/game-semantics","display_name":"Game semantics","score":0.5571314692497253},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.49680784344673157},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4784717261791229},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.47699716687202454},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4463721513748169},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.42276760935783386},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.36545777320861816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3302597999572754},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.26522427797317505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20955684781074524},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19135954976081848},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.15663796663284302}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7462215423583984},{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.6514484286308289},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.630907416343689},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5822576880455017},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5781413912773132},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5706729888916016},{"id":"https://openalex.org/C9672783","wikidata":"https://www.wikidata.org/wiki/Q65122115","display_name":"Game semantics","level":5,"score":0.5571314692497253},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.49680784344673157},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4784717261791229},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.47699716687202454},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4463721513748169},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.42276760935783386},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.36545777320861816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3302597999572754},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.26522427797317505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20955684781074524},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19135954976081848},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.15663796663284302},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/lics52264.2021.9470691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:152057","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"},{"id":"pmh:oai:HAL:hal-03440079v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03440079","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"36th Annual Symposium on Logic in Computer Science, 2021, Rome (virtual), Italy. ⟨10.1109/LICS52264.2021.9470691⟩","raw_type":"Conference papers"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:b5b053d3-65c8-4c0a-bec3-cf77bf5742a4","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:b5b053d3-65c8-4c0a-bec3-cf77bf5742a4","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03440079v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03440079","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"36th Annual Symposium on Logic in Computer Science, 2021, Rome (virtual), Italy. ⟨10.1109/LICS52264.2021.9470691⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W173753855","https://openalex.org/W1560263126","https://openalex.org/W1590226281","https://openalex.org/W1595465781","https://openalex.org/W1646789098","https://openalex.org/W1662711380","https://openalex.org/W1841408358","https://openalex.org/W1862276852","https://openalex.org/W1920911435","https://openalex.org/W1981776739","https://openalex.org/W2030121500","https://openalex.org/W2031575609","https://openalex.org/W2036526834","https://openalex.org/W2060345611","https://openalex.org/W2073614038","https://openalex.org/W2092398161","https://openalex.org/W2124894117","https://openalex.org/W2153166150","https://openalex.org/W2154109182","https://openalex.org/W2163310156","https://openalex.org/W2277816930","https://openalex.org/W2571881501","https://openalex.org/W2734934908","https://openalex.org/W2949712613","https://openalex.org/W3009901397","https://openalex.org/W3104865824","https://openalex.org/W3142760835","https://openalex.org/W4232943206","https://openalex.org/W6633443848","https://openalex.org/W6635513180","https://openalex.org/W6682799263","https://openalex.org/W6731966548","https://openalex.org/W6789142659"],"related_works":["https://openalex.org/W147641928","https://openalex.org/W1491260278","https://openalex.org/W2742582826","https://openalex.org/W2021535402","https://openalex.org/W2162329184","https://openalex.org/W3194425546","https://openalex.org/W1968041547","https://openalex.org/W1554938010","https://openalex.org/W2141094540","https://openalex.org/W1981776739"],"abstract_inverted_index":{"Using":[0],"a":[1,10,43,97,117],"combination":[2],"of":[3,19,57,78,88,99,119],"automata-theoretic":[4],"and":[5,59,103],"game-semantic":[6],"techniques,":[7],"we":[8,81],"propose":[9],"method":[11],"for":[12,109],"analysing":[13],"higher-order":[14],"concurrent":[15],"programs.":[16],"Our":[17],"language":[18],"choice":[20],"is":[21,38,54],"Finitary":[22],"Idealised":[23],"Concurrent":[24],"Algol":[25],"(FICA)":[26],"due":[27],"to":[28,75,84,95,113,124],"its":[29],"relatively":[30],"simple":[31],"fully":[32],"abstract":[33],"game":[34,91],"model.Our":[35],"first":[36],"contribution":[37],"an":[39,72],"automata":[40],"model":[41],"over":[42],"tree-structured":[44],"infinite":[45],"data":[46],"alphabet,":[47],"called":[48],"split":[49,79],"automata,":[50,80],"whose":[51],"distinctive":[52],"feature":[53],"the":[55,76,89,114],"separation":[56],"control":[58],"memory.":[60],"We":[61],"show":[62],"that":[63],"every":[64],"FICA":[65,100],"term":[66],"can":[67],"be":[68,125],"translated":[69],"into":[70],"such":[71],"automaton.":[73],"Thanks":[74],"structure":[77],"are":[82],"able":[83],"observe":[85],"subtle":[86],"aspects":[87],"underlying":[90],"semantics.This":[92],"enables":[93],"us":[94],"identify":[96],"fragment":[98],"with":[101],"iteration":[102],"limited":[104],"synchronisation":[105],"(but":[106],"without":[107],"recursion),":[108],"which,":[110],"in":[111],"contrast":[112],"whole":[115],"FICA,":[116],"variety":[118],"verification":[120],"problems":[121],"turn":[122],"out":[123],"decidable.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}