{"id":"https://openalex.org/W4234475010","doi":"https://doi.org/10.1109/iccad.2005.1560185","title":"Efficient LTL compilation for SAT-based model checking","display_name":"Efficient LTL compilation for SAT-based model checking","publication_year":2005,"publication_date":"2005-12-22","ids":{"openalex":"https://openalex.org/W4234475010","doi":"https://doi.org/10.1109/iccad.2005.1560185"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2005.1560185","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560185","pdf_url":null,"source":{"id":"https://openalex.org/S4363608058","display_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","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/A5065609268","display_name":"R. Armoni","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. Armoni","raw_affiliation_strings":["Intel Corporation, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Moscow, Russia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006849405","display_name":"S. Egorov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Egorov","raw_affiliation_strings":["Intel Corporation, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Moscow, Russia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085530095","display_name":"R. Fraer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Fraer","raw_affiliation_strings":["Intel Corporation, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Moscow, Russia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009170325","display_name":"D. Korchemny","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Korchemny","raw_affiliation_strings":["Intel Corporation, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Moscow, Russia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000059818","display_name":"Moshe Y. Vardi","orcid":"https://orcid.org/0000-0002-0661-5773"},"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":"M.Y. Vardi","raw_affiliation_strings":["Rice University, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5065609268"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1991,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.80701754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"877","last_page":"884"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9944000244140625,"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.9937000274658203,"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/model-checking","display_name":"Model checking","score":0.8742667436599731},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7639365196228027},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.742771565914154},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6802433729171753},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.6287393569946289},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5941817760467529},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5459120273590088},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5159829258918762},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.5020287036895752},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.4865540564060211},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4298301637172699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3844473659992218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17373499274253845}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8742667436599731},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7639365196228027},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.742771565914154},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6802433729171753},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.6287393569946289},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5941817760467529},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5459120273590088},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5159829258918762},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.5020287036895752},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.4865540564060211},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4298301637172699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3844473659992218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17373499274253845},{"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/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2005.1560185","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560185","pdf_url":null,"source":{"id":"https://openalex.org/S4363608058","display_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W157991657","https://openalex.org/W1495266209","https://openalex.org/W1507116188","https://openalex.org/W1512310098","https://openalex.org/W1516806823","https://openalex.org/W1521761735","https://openalex.org/W1540883472","https://openalex.org/W1607782211","https://openalex.org/W1903629970","https://openalex.org/W1984478483","https://openalex.org/W2002789815","https://openalex.org/W2012935476","https://openalex.org/W2019881090","https://openalex.org/W2023808162","https://openalex.org/W2061438988","https://openalex.org/W2107182799","https://openalex.org/W2123613958","https://openalex.org/W2133874828","https://openalex.org/W2137661662","https://openalex.org/W2158910854","https://openalex.org/W4232255413","https://openalex.org/W4241108585","https://openalex.org/W4241233758","https://openalex.org/W4302339081","https://openalex.org/W6606484922","https://openalex.org/W6629648295","https://openalex.org/W6630713009","https://openalex.org/W6632304951","https://openalex.org/W6636258220","https://openalex.org/W6655221434"],"related_works":["https://openalex.org/W2156717832","https://openalex.org/W2365988016","https://openalex.org/W278680301","https://openalex.org/W1785234853","https://openalex.org/W2127574686","https://openalex.org/W2182012133","https://openalex.org/W2152996796","https://openalex.org/W1503170978","https://openalex.org/W2905905217","https://openalex.org/W1787074469"],"abstract_inverted_index":{"This":[0],"work":[1],"describes":[2],"an":[3],"algorithm":[4],"of":[5,30],"automata":[6,18],"construction":[7,19],"for":[8,13,56],"LTL":[9],"safety":[10],"properties,":[11],"suitable":[12],"bounded":[14,57],"model":[15,26,58],"checking.":[16,27],"Existing":[17],"methods":[20],"are":[21],"tailored":[22],"to":[23],"BDD-based":[24],"symbolic":[25],"The":[28],"novelty":[29],"our":[31],"approach":[32],"is":[33],"that":[34,49],"we":[35],"construct":[36],"deterministic":[37],"automata,":[38],"unlike":[39],"the":[40,50],"standard":[41],"approach,":[42],"which":[43],"constructs":[44],"nondeterministic":[45],"automata.":[46],"We":[47],"show":[48],"proposed":[51],"method":[52],"has":[53],"significant":[54],"advantages":[55],"checking":[59],"over":[60],"traditional":[61],"methods.":[62]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}