{"id":"https://openalex.org/W2146072020","doi":"https://doi.org/10.1007/978-3-540-89439-1_22","title":"On Bounded Reachability of Programs with Set Comprehensions","display_name":"On Bounded Reachability of Programs with Set Comprehensions","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2146072020","doi":"https://doi.org/10.1007/978-3-540-89439-1_22","mag":"2146072020"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-89439-1_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-89439-1_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5060114046","display_name":"Margus Veanes","orcid":"https://orcid.org/0009-0008-8427-7977"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Margus Veanes","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058867828","display_name":"Ando Saabas","orcid":"https://orcid.org/0009-0001-9449-0404"},"institutions":[{"id":"https://openalex.org/I111112146","display_name":"Tallinn University of Technology","ror":"https://ror.org/0443cwa12","country_code":"EE","type":"education","lineage":["https://openalex.org/I111112146"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Ando Saabas","raw_affiliation_strings":["Institute of Cybernetics, Tallinn University of Technology, Tallinn, Estonia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Cybernetics, Tallinn University of Technology, Tallinn, Estonia","institution_ids":["https://openalex.org/I111112146"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"317"},"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.9991000294685364,"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.9986000061035156,"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/reachability","display_name":"Reachability","score":0.8477941155433655},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.820286214351654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8106114864349365},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.726607084274292},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.7036590576171875},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.683987021446228},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.6818807125091553},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6426261067390442},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6142498254776001},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.6134572625160217},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5885528922080994},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5746868848800659},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5529202222824097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45570406317710876},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.42934244871139526},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4105342626571655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2566538453102112},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15651410818099976}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8477941155433655},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.820286214351654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8106114864349365},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.726607084274292},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.7036590576171875},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.683987021446228},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.6818807125091553},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6426261067390442},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6142498254776001},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.6134572625160217},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5885528922080994},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5746868848800659},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5529202222824097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45570406317710876},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.42934244871139526},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4105342626571655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2566538453102112},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15651410818099976},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":1,"locations":[{"id":"doi:10.1007/978-3-540-89439-1_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-89439-1_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W148542191","https://openalex.org/W179373627","https://openalex.org/W341687455","https://openalex.org/W421997344","https://openalex.org/W1480600454","https://openalex.org/W1480909796","https://openalex.org/W1493089824","https://openalex.org/W1511737804","https://openalex.org/W1549008998","https://openalex.org/W1556566737","https://openalex.org/W1556844982","https://openalex.org/W1606177908","https://openalex.org/W1606436461","https://openalex.org/W1744728944","https://openalex.org/W1767788337","https://openalex.org/W1787074469","https://openalex.org/W1793366261","https://openalex.org/W1800123991","https://openalex.org/W1821489642","https://openalex.org/W1834186039","https://openalex.org/W1850275321","https://openalex.org/W1859059663","https://openalex.org/W1860618800","https://openalex.org/W1969402593","https://openalex.org/W2002089154","https://openalex.org/W2033342015","https://openalex.org/W2069486211","https://openalex.org/W2080841971","https://openalex.org/W2098353690","https://openalex.org/W2107308446","https://openalex.org/W2116637775","https://openalex.org/W2117587600","https://openalex.org/W2123814724","https://openalex.org/W2125705730","https://openalex.org/W2136877520","https://openalex.org/W2146072020","https://openalex.org/W2156915267","https://openalex.org/W2158395308","https://openalex.org/W2158829089","https://openalex.org/W2163482209","https://openalex.org/W2164778826","https://openalex.org/W2164822567","https://openalex.org/W2168838065","https://openalex.org/W2170145744","https://openalex.org/W2479999086","https://openalex.org/W2486208154","https://openalex.org/W2504100651","https://openalex.org/W2561675875","https://openalex.org/W2604845086","https://openalex.org/W4233607861","https://openalex.org/W4285719527","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1562908040","https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W1505872263","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}