{"id":"https://openalex.org/W147625861","doi":"https://doi.org/10.1007/978-3-642-41036-9_4","title":"Reachability Modulo Theories","display_name":"Reachability Modulo Theories","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W147625861","doi":"https://doi.org/10.1007/978-3-642-41036-9_4","mag":"147625861"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-41036-9_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-41036-9_4","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/A5029930688","display_name":"Akash Lal","orcid":"https://orcid.org/0009-0002-4359-9378"},"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":"Akash Lal","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072464909","display_name":"Shaz Qadeer","orcid":null},"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":"Shaz Qadeer","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0894,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.71426072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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.998199999332428,"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.8895602226257324},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.8412375450134277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.82718825340271},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7687262296676636},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5962474346160889},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5058372020721436},{"id":"https://openalex.org/keywords/signature","display_name":"Signature (topology)","score":0.4993929862976074},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.48054391145706177},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.469572514295578},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.45895227789878845},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.45492663979530334},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4527187943458557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35766786336898804},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21065497398376465},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1743474006652832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15397316217422485}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8895602226257324},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.8412375450134277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.82718825340271},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7687262296676636},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5962474346160889},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5058372020721436},{"id":"https://openalex.org/C2779696439","wikidata":"https://www.wikidata.org/wiki/Q7512811","display_name":"Signature (topology)","level":2,"score":0.4993929862976074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48054391145706177},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.469572514295578},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.45895227789878845},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.45492663979530334},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4527187943458557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35766786336898804},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21065497398376465},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1743474006652832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15397316217422485},{"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-642-41036-9_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-41036-9_4","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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W74317754","https://openalex.org/W101497066","https://openalex.org/W196827001","https://openalex.org/W1497571013","https://openalex.org/W1498946538","https://openalex.org/W1499072146","https://openalex.org/W1507006488","https://openalex.org/W1540815577","https://openalex.org/W1547512258","https://openalex.org/W1549699884","https://openalex.org/W1556566737","https://openalex.org/W1606177908","https://openalex.org/W1691700263","https://openalex.org/W1838348862","https://openalex.org/W1979619055","https://openalex.org/W1999468161","https://openalex.org/W2080220005","https://openalex.org/W2087046173","https://openalex.org/W2105614525","https://openalex.org/W2107794009","https://openalex.org/W2109861994","https://openalex.org/W2110503149","https://openalex.org/W2111050128","https://openalex.org/W2114067856","https://openalex.org/W2118424088","https://openalex.org/W2123636373","https://openalex.org/W2126123233","https://openalex.org/W2128453996","https://openalex.org/W2131123849","https://openalex.org/W2135108322","https://openalex.org/W2144271133","https://openalex.org/W2152492994","https://openalex.org/W2162284942","https://openalex.org/W2187566152","https://openalex.org/W2295903414","https://openalex.org/W2397041770","https://openalex.org/W2483649756","https://openalex.org/W2497180905","https://openalex.org/W2604845086","https://openalex.org/W2805366091","https://openalex.org/W4233804448","https://openalex.org/W4242057943","https://openalex.org/W4242397730"],"related_works":["https://openalex.org/W3043232031","https://openalex.org/W2128935480","https://openalex.org/W2177564498","https://openalex.org/W3014139035","https://openalex.org/W2296248291","https://openalex.org/W2408108908","https://openalex.org/W2146072020","https://openalex.org/W2397752352","https://openalex.org/W75225272","https://openalex.org/W3023596811"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}