{"id":"https://openalex.org/W3094001500","doi":"https://doi.org/10.1145/3434319","title":"Automata and fixpoints for asynchronous hyperproperties","display_name":"Automata and fixpoints for asynchronous hyperproperties","publication_year":2021,"publication_date":"2021-01-04","ids":{"openalex":"https://openalex.org/W3094001500","doi":"https://doi.org/10.1145/3434319","mag":"3094001500"},"language":"en","primary_location":{"id":"doi:10.1145/3434319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434319","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3434319","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017476517","display_name":"Jens Oliver Gutsfeld","orcid":"https://orcid.org/0009-0007-5806-441X"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jens Oliver Gutsfeld","raw_affiliation_strings":["University of M\u00fcnster, Germany","University of M\u00fcnster, \u25a0\u25a0\u25a0, Germany"],"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]},{"raw_affiliation_string":"University of M\u00fcnster, \u25a0\u25a0\u25a0, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070224469","display_name":"Markus M\u00fcller-Olm","orcid":"https://orcid.org/0009-0001-2229-9651"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus M\u00fcller-Olm","raw_affiliation_strings":["University of M\u00fcnster, Germany","University of M\u00fcnster, \u25a0\u25a0\u25a0, Germany"],"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]},{"raw_affiliation_string":"University of M\u00fcnster, \u25a0\u25a0\u25a0, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004207399","display_name":"Christoph Ohrem","orcid":"https://orcid.org/0009-0009-1813-4596"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Ohrem","raw_affiliation_strings":["University of M\u00fcnster, Germany","University of M\u00fcnster, \u25a0\u25a0\u25a0, Germany"],"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]},{"raw_affiliation_string":"University of M\u00fcnster, \u25a0\u25a0\u25a0, Germany","institution_ids":["https://openalex.org/I22465464"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017476517"],"corresponding_institution_ids":["https://openalex.org/I22465464"],"apc_list":null,"apc_paid":null,"fwci":0.1398,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51168789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"5","issue":"POPL","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9995999932289124,"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/T11424","display_name":"Security and Verification in Computing","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9988999962806702,"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.9986000061035156,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.8055672645568848},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7727092504501343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7289467453956604},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.684301495552063},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6592682600021362},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6202683448791504},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5631121397018433},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.5157907009124756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5111411213874817},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.46215468645095825},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45486846566200256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3255314528942108},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31008708477020264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2254321277141571}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8055672645568848},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7727092504501343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7289467453956604},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.684301495552063},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6592682600021362},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6202683448791504},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5631121397018433},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.5157907009124756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5111411213874817},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.46215468645095825},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45486846566200256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3255314528942108},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31008708477020264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2254321277141571},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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.1145/3434319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434319","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:arXiv.org:2010.11605","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2010.11605","pdf_url":"https://arxiv.org/pdf/2010.11605","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:3094001500","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/2010.11605.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2010.11605","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2010.11605","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3434319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434319","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7799999713897705}],"awards":[{"id":"https://openalex.org/G7154572775","display_name":null,"funder_award_id":"MU 1508/3","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3094001500.pdf","grobid_xml":"https://content.openalex.org/works/W3094001500.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W89538287","https://openalex.org/W128674190","https://openalex.org/W136199325","https://openalex.org/W157431908","https://openalex.org/W1213177963","https://openalex.org/W1493367105","https://openalex.org/W1548500263","https://openalex.org/W1566206239","https://openalex.org/W1662711380","https://openalex.org/W1810796502","https://openalex.org/W1939061729","https://openalex.org/W1976437792","https://openalex.org/W1981996395","https://openalex.org/W1988030712","https://openalex.org/W1995105191","https://openalex.org/W2003773532","https://openalex.org/W2031575609","https://openalex.org/W2046213250","https://openalex.org/W2048963544","https://openalex.org/W2054801208","https://openalex.org/W2087403174","https://openalex.org/W2119397055","https://openalex.org/W2120360673","https://openalex.org/W2136153487","https://openalex.org/W2148778089","https://openalex.org/W2154938325","https://openalex.org/W2155756511","https://openalex.org/W2156423097","https://openalex.org/W2158126713","https://openalex.org/W2170933628","https://openalex.org/W2224844044","https://openalex.org/W2266382624","https://openalex.org/W2276682279","https://openalex.org/W2342178224","https://openalex.org/W2531307718","https://openalex.org/W2734853177","https://openalex.org/W2761734916","https://openalex.org/W2889050595","https://openalex.org/W2963698523","https://openalex.org/W2963829406","https://openalex.org/W2964335063","https://openalex.org/W2965215003","https://openalex.org/W2994155569","https://openalex.org/W3006415844","https://openalex.org/W3037049410","https://openalex.org/W3081601885","https://openalex.org/W3098700911","https://openalex.org/W3210476636","https://openalex.org/W4250728693","https://openalex.org/W4286447266"],"related_works":["https://openalex.org/W3209871473","https://openalex.org/W3007111305","https://openalex.org/W1998658600","https://openalex.org/W1809409010","https://openalex.org/W2255359486","https://openalex.org/W1581191281","https://openalex.org/W2386489222","https://openalex.org/W2806887588","https://openalex.org/W1501538285","https://openalex.org/W152742108","https://openalex.org/W658731987","https://openalex.org/W2753440510","https://openalex.org/W3193715586","https://openalex.org/W1841408358","https://openalex.org/W3093747400","https://openalex.org/W3121464555","https://openalex.org/W3144174489","https://openalex.org/W1493491893","https://openalex.org/W3173557304","https://openalex.org/W1499482550"],"abstract_inverted_index":{"Hyperproperties":[0],"have":[1,19],"received":[2],"increasing":[3],"attention":[4],"in":[5,26,71],"the":[6,55,62,77,81,88,109],"last":[7],"decade":[8],"due":[9],"to":[10],"their":[11],"importance":[12],"e.g.":[13],"for":[14,41,130],"security":[15],"analyses.":[16],"Past":[17],"approaches":[18],"focussed":[20],"on":[21],"synchronous":[22],"analyses,":[23],"i.e.":[24,119],"techniques":[25],"which":[27],"different":[28],"paths":[29],"are":[30,116],"compared":[31],"lockstepwise.":[32],"In":[33],"this":[34],"paper,":[35],"we":[36,126],"systematically":[37,68],"study":[38],"asynchronous":[39,73],"analyses":[40,129],"hyperproperties":[42,70],"by":[43,108],"introducing":[44],"both":[45,92,104,131],"a":[46,124],"novel":[47],"automata":[48],"model":[49],"(Alternating":[50],"Asynchronous":[51],"Parity":[52],"Automata)":[53],"and":[54,75],"temporal":[56],"fixpoint":[57,64],"calculus":[58,65],"H":[59],"\u00b5":[60],",":[61],"first":[63],"that":[66,87,111,133],"can":[67],"express":[69],"an":[72],"manner":[74],"at":[76],"same":[78],"time":[79],"subsumes":[80],"existing":[82],"logic":[83],"HyperLTL.":[84],"We":[85],"show":[86],"expressive":[89,101],"power":[90,102],"of":[91,103,114],"models":[93,105,132],"coincides":[94],"over":[95],"fixed":[96],"path":[97],"assignments.":[98],"The":[99],"high":[100],"is":[106],"evidenced":[107],"fact":[110],"decision":[112],"problems":[113],"interest":[115],"highly":[117],"undecidable,":[118],"not":[120],"even":[121],"arithmetical.":[122],"As":[123],"remedy,":[125],"propose":[127],"approximative":[128],"also":[134],"induce":[135],"natural":[136],"decidable":[137],"fragments.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}
