{"id":"https://openalex.org/W2140673956","doi":"https://doi.org/10.1145/2535838.2535860","title":"A constraint-based approach to solving games on infinite graphs","display_name":"A constraint-based approach to solving games on infinite graphs","publication_year":2014,"publication_date":"2014-01-08","ids":{"openalex":"https://openalex.org/W2140673956","doi":"https://doi.org/10.1145/2535838.2535860","mag":"2140673956"},"language":"en","primary_location":{"id":"doi:10.1145/2535838.2535860","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2535838.2535860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086773616","display_name":"Tewodros A. Beyene","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tewodros Beyene","raw_affiliation_strings":["Technische Universtit\u00e4t Munchen, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universtit\u00e4t Munchen, Munich, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057341982","display_name":"Swarat Chaudhuri","orcid":"https://orcid.org/0000-0002-6859-1391"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swarat Chaudhuri","raw_affiliation_strings":["Rice University, Houston, USA"],"affiliations":[{"raw_affiliation_string":"Rice University, Houston, USA","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036625175","display_name":"Corneliu Popeea","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Corneliu Popeea","raw_affiliation_strings":["Technische Universtit\u00e4t Munchen, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universtit\u00e4t Munchen, Munich, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044737952","display_name":"Andrey Rybalchenko","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrey Rybalchenko","raw_affiliation_strings":["Microsoft Research Cambridge and Technische Universtit\u00e4t Munchen, Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge and Technische Universtit\u00e4t Munchen, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5086773616"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.7955,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.99079694,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"221","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9983999729156494,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.6842904090881348},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6094319820404053},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5448195934295654},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4755938947200775},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.47029873728752136},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4499899744987488},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4321509301662445},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4161560535430908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25037848949432373}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6842904090881348},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6094319820404053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5448195934295654},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4755938947200775},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.47029873728752136},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4499899744987488},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4321509301662445},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4161560535430908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25037848949432373},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2535838.2535860","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2535838.2535860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.685.9788","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.685.9788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rice.edu/%7Esc40/pubs/popl14-games.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6399999856948853,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W17381159","https://openalex.org/W96134206","https://openalex.org/W164930620","https://openalex.org/W1481109946","https://openalex.org/W1482244486","https://openalex.org/W1505081061","https://openalex.org/W1515174179","https://openalex.org/W1518419080","https://openalex.org/W1519020297","https://openalex.org/W1540129897","https://openalex.org/W1559445291","https://openalex.org/W1560374668","https://openalex.org/W1568797836","https://openalex.org/W1775468415","https://openalex.org/W1868359205","https://openalex.org/W1872701416","https://openalex.org/W1964528821","https://openalex.org/W1972850151","https://openalex.org/W1974368544","https://openalex.org/W2000589007","https://openalex.org/W2012436850","https://openalex.org/W2016206563","https://openalex.org/W2022228153","https://openalex.org/W2060375000","https://openalex.org/W2065353132","https://openalex.org/W2068462394","https://openalex.org/W2088846354","https://openalex.org/W2089003125","https://openalex.org/W2096608485","https://openalex.org/W2101432564","https://openalex.org/W2102178883","https://openalex.org/W2105315191","https://openalex.org/W2110783522","https://openalex.org/W2119467398","https://openalex.org/W2122735631","https://openalex.org/W2125267391","https://openalex.org/W2134469331","https://openalex.org/W2149236697","https://openalex.org/W2158493209","https://openalex.org/W2170933628","https://openalex.org/W2184273311","https://openalex.org/W2293098399","https://openalex.org/W2293708017","https://openalex.org/W2301645263","https://openalex.org/W2502103274","https://openalex.org/W2912423395","https://openalex.org/W3022006420","https://openalex.org/W3023554972","https://openalex.org/W4212901716","https://openalex.org/W4248784701","https://openalex.org/W6672608052","https://openalex.org/W6686223999"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2884574904","https://openalex.org/W1554767603","https://openalex.org/W2130664212","https://openalex.org/W1565729639","https://openalex.org/W4382045631","https://openalex.org/W2746280673","https://openalex.org/W2152996796","https://openalex.org/W1594593035","https://openalex.org/W2560415449"],"abstract_inverted_index":{"We":[0,97],"present":[1],"a":[2,67,74,83,87,132],"constraint-based":[3],"approach":[4],"to":[5],"computing":[6],"winning":[7,48,84],"strategies":[8],"in":[9,25,116],"two-player":[10],"graph":[11],"games":[12,21,46],"over":[13],"the":[14,31,78,123],"state":[15],"space":[16],"of":[17,33,40,77,122,140],"infinite-state":[18,34,41],"programs.":[19,42],"Such":[20],"have":[22],"numerous":[23],"applications":[24],"program":[26,157],"verification":[27,39],"and":[28,37,54,94,142,159],"synthesis,":[29],"including":[30,131],"synthesis":[32],"reactive":[35],"programs":[36],"branching-time":[38],"Our":[43,90],"method":[44],"handles":[45],"with":[47],"conditions":[49],"given":[50],"by":[51,105,145],"safety,":[52],"reachability,":[53],"general":[55],"Linear":[56],"Temporal":[57],"Logic":[58],"(LTL)":[59],"properties.":[60],"For":[61],"each":[62],"property":[63],"class,":[64],"we":[65],"give":[66],"deductive":[68],"proof":[69],"rule":[70],"that":[71,99,112,136],"---":[72,81],"provided":[73],"symbolic":[75],"representation":[76],"game":[79],"players":[80],"describes":[82],"strategy":[85],"for":[86],"particular":[88],"player.":[89],"rules":[91,101,124],"are":[92],"sound":[93],"relatively":[95],"complete.":[96],"show":[98],"these":[100],"can":[102],"be":[103],"automated":[104],"using":[106],"an":[107],"off-the-shelf":[108],"Horn":[109],"constraint":[110],"solver":[111],"supports":[113],"existential":[114],"quantification":[115],"clause":[117],"heads.":[118],"The":[119],"practical":[120],"promise":[121],"is":[125],"demonstrated":[126],"through":[127],"several":[128],"case":[129],"studies,":[130],"challenging":[133],"\"Cinderella-Stepmother":[134],"game\"":[135],"allows":[137],"infinite":[138],"alternation":[139],"discrete":[141],"continuous":[143],"choices":[144],"two":[146],"players,":[147],"as":[148,150],"well":[149],"examples":[151],"derived":[152],"from":[153],"prior":[154],"work":[155],"on":[156],"repair":[158],"synthesis.":[160]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
