{"id":"https://openalex.org/W2152690351","doi":"https://doi.org/10.1109/fmcad.2009.5351140","title":"Efficient decision procedure for non-linear arithmetic constraints using CORDIC","display_name":"Efficient decision procedure for non-linear arithmetic constraints using CORDIC","publication_year":2009,"publication_date":"2009-11-01","ids":{"openalex":"https://openalex.org/W2152690351","doi":"https://doi.org/10.1109/fmcad.2009.5351140","mag":"2152690351"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2009.5351140","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2009.5351140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Formal Methods in Computer-Aided Design","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/A5085310714","display_name":"Malay Ganai","orcid":"https://orcid.org/0000-0003-0593-3419"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Malay K. Ganai","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020028377","display_name":"Franjo Ivan\u010di\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Franjo Ivancic","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085310714"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1134,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.94439079,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"61","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.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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9990000128746033,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/cordic","display_name":"CORDIC","score":0.7610148787498474},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6816083788871765},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5877406597137451},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5545922517776489},{"id":"https://openalex.org/keywords/interval-arithmetic","display_name":"Interval arithmetic","score":0.5128626823425293},{"id":"https://openalex.org/keywords/normalization","display_name":"Normalization (sociology)","score":0.4770849645137787},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.45347243547439575},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4426920413970947},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.43731653690338135},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.41904258728027344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3534631133079529},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3034747242927551}],"concepts":[{"id":"https://openalex.org/C58870171","wikidata":"https://www.wikidata.org/wiki/Q116076","display_name":"CORDIC","level":3,"score":0.7610148787498474},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6816083788871765},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5877406597137451},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5545922517776489},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.5128626823425293},{"id":"https://openalex.org/C136886441","wikidata":"https://www.wikidata.org/wiki/Q926129","display_name":"Normalization (sociology)","level":2,"score":0.4770849645137787},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.45347243547439575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4426920413970947},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.43731653690338135},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.41904258728027344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3534631133079529},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3034747242927551},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C19165224","wikidata":"https://www.wikidata.org/wiki/Q23404","display_name":"Anthropology","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"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/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2009.5351140","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2009.5351140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Formal Methods in Computer-Aided Design","raw_type":"proceedings-article"}],"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":21,"referenced_works":["https://openalex.org/W1500991862","https://openalex.org/W1526045365","https://openalex.org/W1787074469","https://openalex.org/W1976385924","https://openalex.org/W1985956780","https://openalex.org/W2057361103","https://openalex.org/W2084330491","https://openalex.org/W2086163366","https://openalex.org/W2099880900","https://openalex.org/W2102577205","https://openalex.org/W2114241070","https://openalex.org/W2115452265","https://openalex.org/W2119144375","https://openalex.org/W2125967324","https://openalex.org/W2158859403","https://openalex.org/W2163850966","https://openalex.org/W3148608205","https://openalex.org/W6631575891","https://openalex.org/W6638020115","https://openalex.org/W6677189924","https://openalex.org/W6678730870"],"related_works":["https://openalex.org/W2578463151","https://openalex.org/W1997150540","https://openalex.org/W2991416904","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300","https://openalex.org/W4302330337","https://openalex.org/W4386723279","https://openalex.org/W2048447692","https://openalex.org/W583460537"],"abstract_inverted_index":{"In":[0,68,114],"verification":[1],"of":[2,51,107,121],"hybrid":[3],"discrete-continuous":[4],"and":[5,30,124],"embedded":[6],"control":[7],"systems,":[8],"one":[9],"encounters":[10],"decision":[11,20,53,131],"problems":[12,26],"involving":[13],"non-linear":[14,49],"constraints.":[15],"We":[16,45],"propose":[17],"an":[18,31],"efficient":[19],"procedure":[21],"(CORD)":[22],"for":[23,37,41,63],"such":[24,91],"decisions":[25],"using":[27,59,110],"CORDIC":[28,60],"algorithms,":[29,61],"off-the-shelf":[32],"SMT(LA)":[33,57,112],"(Satisfiability":[34],"Modulo":[35],"Theory":[36],"Linear":[38],"Arithmetic)":[39],"solver,":[40],"given":[42],"precision":[43,88],"requirements.":[44,89],"first":[46],"translate":[47],"the":[48,52,65,69,87,119],"part":[50],"problem":[54],"to":[55,80],"a":[56,73,82,92,97,111,128],"formula":[58,84],"accounting":[62],"all":[64],"inaccuracies":[66],"safely.":[67],"translation,":[70],"we":[71,95,117],"use":[72],"normalization":[74],"scheme,":[75],"combined":[76],"with":[77,127],"interval":[78,108],"bounds":[79,109],"obtain":[81],"linearized":[83,93],"without":[85],"compromising":[86],"On":[90],"formula,":[94],"devise":[96],"DPLL-style":[98],"Interval":[99],"Search":[100],"Engine":[101],"(DISE)":[102],"that":[103],"explores":[104],"various":[105],"combinations":[106],"solver.":[113],"our":[115,122],"experiments,":[116],"demonstrate":[118],"efficacy":[120],"approach,":[123],"compare":[125],"it":[126],"latest":[129],"state-of-the-art":[130],"procedure.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}