{"id":"https://openalex.org/W2112260148","doi":"https://doi.org/10.2168/lmcs-3(2:1)2007","title":"Predicate Abstraction via Symbolic Decision Procedures","display_name":"Predicate Abstraction via Symbolic Decision Procedures","publication_year":2007,"publication_date":"2007-04-24","ids":{"openalex":"https://openalex.org/W2112260148","doi":"https://doi.org/10.2168/lmcs-3(2:1)2007","mag":"2112260148"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-3(2:1)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:1)2007","pdf_url":"https://lmcs.episciences.org/2218/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2218/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Shuvendu K. Lahiri","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":true,"raw_author_name":"Shuvendu K. Lahiri","raw_affiliation_strings":["Microsoft Research, Redmond, WA 98052"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA 98052","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Thomas Ball","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":"Thomas Ball","raw_affiliation_strings":["Microsoft Research, Redmond, WA 98052"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA 98052","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":null,"display_name":"Byron Cook","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":"Byron Cook","raw_affiliation_strings":["Microsoft Research, Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.7534,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74314194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 3, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.4422999918460846,"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.4422999918460846,"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.4235999882221222,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.026000000536441803,"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/predicate-abstraction","display_name":"Predicate abstraction","score":0.8525000214576721},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.6725000143051147},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6176000237464905},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6039999723434448},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.5199999809265137},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.43849998712539673},{"id":"https://openalex.org/keywords/predicate-variable","display_name":"Predicate variable","score":0.4226999878883362},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.40639999508857727},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.38499999046325684}],"concepts":[{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.8525000214576721},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6873000264167786},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.6725000143051147},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6176000237464905},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6039999723434448},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5307000279426575},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.5199999809265137},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46560001373291016},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C73314972","wikidata":"https://www.wikidata.org/wiki/Q10531432","display_name":"Predicate variable","level":5,"score":0.4226999878883362},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.40639999508857727},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C2776095079","wikidata":"https://www.wikidata.org/wiki/Q489538","display_name":"The Symbolic","level":2,"score":0.37400001287460327},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36010000109672546},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.35260000824928284},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.3441999852657318},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32109999656677246},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C110812573","wikidata":"https://www.wikidata.org/wiki/Q175515","display_name":"Symbolic computation","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2529999911785126},{"id":"https://openalex.org/C59594135","wikidata":"https://www.wikidata.org/wiki/Q5249242","display_name":"Decision model","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-3(2:1)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:1)2007","pdf_url":"https://lmcs.episciences.org/2218/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0612003","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0612003","pdf_url":"https://arxiv.org/pdf/cs/0612003","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":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:dae9c5906dcb42ef8bc8598388867d90","is_oa":true,"landing_page_url":"https://doaj.org/article/dae9c5906dcb42ef8bc8598388867d90","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 3, Issue 2 (2007)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-3(2:1)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:1)2007","pdf_url":"https://lmcs.episciences.org/2218/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2112260148.pdf","grobid_xml":"https://content.openalex.org/works/W2112260148.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1491913687","https://openalex.org/W1497571013","https://openalex.org/W1581087217","https://openalex.org/W1590336223","https://openalex.org/W1972085995","https://openalex.org/W2037690395","https://openalex.org/W2069748505","https://openalex.org/W2080267935","https://openalex.org/W2134147303","https://openalex.org/W2151398141","https://openalex.org/W2153131284","https://openalex.org/W2164778826","https://openalex.org/W4205683772","https://openalex.org/W6606206433","https://openalex.org/W6631834109","https://openalex.org/W6635803408","https://openalex.org/W6661409256","https://openalex.org/W6683744938","https://openalex.org/W6697035561","https://openalex.org/W7029321148"],"related_works":[],"abstract_inverted_index":{"We":[0,72,102,130],"present":[1,73,131],"a":[2,15,20,23,33,53,58,68,105],"new":[3],"approach":[4],"for":[5,19,77,112],"performing":[6],"predicate":[7,69,138],"abstraction":[8,70,139],"based":[9],"on":[10,36,137],"symbolic":[11,16,49,74,109],"decision":[12,17,34,50,75,110],"procedures.":[13],"Intuitively,":[14],"procedure":[18,35,51],"theory":[21,29],"takes":[22],"set":[24,42],"of":[25,43,47,80,125,134],"predicates":[26],"in":[27,96,145],"the":[28,38,41,48,65,78,117,126],"and":[30,82,86,90],"symbolically":[31],"executes":[32],"all":[37],"subsets":[39],"over":[40],"predicates.":[44],"The":[45],"result":[46],"is":[52],"shared":[54],"expression":[55],"(represented":[56],"by":[57],"directed":[59],"acyclic":[60],"graph)":[61],"that":[62,92],"implicitly":[63],"represents":[64],"answer":[66],"to":[67,107],"query.":[71],"procedures":[76,94,111],"logic":[79,88],"Equality":[81],"Uninterpreted":[83],"Functions":[84],"(EUF)":[85],"Difference":[87],"(DIFF)":[89],"show":[91],"these":[93],"run":[95],"pseudo-polynomial":[97],"(rather":[98],"than":[99],"exponential)":[100],"time.":[101],"then":[103],"provide":[104],"method":[106],"construct":[108],"simple":[113],"mixed":[114],"theories":[115,119],"(including":[116],"two":[118],"mentioned":[120],"above)":[121],"using":[122],"an":[123],"extension":[124],"Nelson-Oppen":[127],"combination":[128],"method.":[129],"preliminary":[132],"evaluation":[133],"our":[135],"Procedure":[136],"benchmarks":[140],"from":[141],"device":[142],"driver":[143],"verification":[144],"SLAM.":[146]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}