{"id":"https://openalex.org/W1850275321","doi":"https://doi.org/10.1007/978-3-540-68855-6_4","title":"An SMT Approach to Bounded Reachability Analysis of Model Programs","display_name":"An SMT Approach to Bounded Reachability Analysis of Model Programs","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1850275321","doi":"https://doi.org/10.1007/978-3-540-68855-6_4","mag":"1850275321"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-68855-6_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68855-6_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/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","Microsoft Research, , Redmond, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, , Redmond, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091080723","display_name":"Nikolaj Bj\u00f8rner","orcid":"https://orcid.org/0000-0002-1695-2810"},"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":"Nikolaj Bj\u00f8rner","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA","Microsoft Research, , Redmond, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, , Redmond, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078330103","display_name":"Alexander Raschke","orcid":"https://orcid.org/0000-0002-6088-8393"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Raschke","raw_affiliation_strings":["University of Ulm, Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"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":28,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"53","last_page":"68"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9991999864578247,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8926409482955933},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8872174620628357},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7937902212142944},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7410087585449219},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7073944211006165},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6397144794464111},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5445681810379028},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5077213048934937},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.492180734872818},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.46408650279045105},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4600053131580353},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4240444004535675},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.415962815284729},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09736934304237366}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8926409482955933},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8872174620628357},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7937902212142944},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7410087585449219},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7073944211006165},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6397144794464111},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5445681810379028},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5077213048934937},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.492180734872818},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.46408650279045105},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4600053131580353},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4240444004535675},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.415962815284729},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09736934304237366},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-68855-6_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68855-6_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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.547.1658","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.547.1658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://research.microsoft.com/pubs/77640/mpc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W179373627","https://openalex.org/W1480600454","https://openalex.org/W1480909796","https://openalex.org/W1511737804","https://openalex.org/W1519878813","https://openalex.org/W1552077729","https://openalex.org/W1556566737","https://openalex.org/W1581842094","https://openalex.org/W1606436461","https://openalex.org/W1787074469","https://openalex.org/W1821489642","https://openalex.org/W1859059663","https://openalex.org/W1969402593","https://openalex.org/W2029835355","https://openalex.org/W2042082434","https://openalex.org/W2069486211","https://openalex.org/W2108329019","https://openalex.org/W2109381127","https://openalex.org/W2110780548","https://openalex.org/W2113043472","https://openalex.org/W2114306296","https://openalex.org/W2116637775","https://openalex.org/W2117587600","https://openalex.org/W2123814724","https://openalex.org/W2125705730","https://openalex.org/W2132638915","https://openalex.org/W2136877520","https://openalex.org/W2148672079","https://openalex.org/W2156915267","https://openalex.org/W2158829089","https://openalex.org/W2163482209","https://openalex.org/W2164778826","https://openalex.org/W2170145744","https://openalex.org/W2494986075","https://openalex.org/W2500028186","https://openalex.org/W2561675875","https://openalex.org/W2763801910","https://openalex.org/W4242177437"],"related_works":["https://openalex.org/W93625746","https://openalex.org/W2884574904","https://openalex.org/W2578463151","https://openalex.org/W4281812495","https://openalex.org/W2810367355","https://openalex.org/W2293855260","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300","https://openalex.org/W4302330337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}