{"id":"https://openalex.org/W2510633296","doi":"https://doi.org/10.1145/2970276.2970319","title":"Towards bounded model checking using nonlinear programming solver","display_name":"Towards bounded model checking using nonlinear programming solver","publication_year":2016,"publication_date":"2016-08-25","ids":{"openalex":"https://openalex.org/W2510633296","doi":"https://doi.org/10.1145/2970276.2970319","mag":"2510633296"},"language":"en","primary_location":{"id":"doi:10.1145/2970276.2970319","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2970276.2970319","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering","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/A5110446887","display_name":"Masataka Nishi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Masataka Nishi","raw_affiliation_strings":["Hitachi, Japan"],"affiliations":[{"raw_affiliation_string":"Hitachi, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110446887"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6969,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74933785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"560","last_page":"565"},"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.9898999929428101,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9886999726295471,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8295299410820007},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6922028660774231},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6860246658325195},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6055106520652771},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5973156690597534},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5790700912475586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5761314630508423},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5326418876647949},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5286698341369629},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5014846324920654},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4916263222694397},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4827960729598999},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4736779034137726},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46648433804512024},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.45416978001594543},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4488348662853241},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.44455111026763916},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41154730319976807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35080963373184204},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3171765208244324},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11878541111946106},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08187749981880188}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8295299410820007},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6922028660774231},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6860246658325195},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6055106520652771},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5973156690597534},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5790700912475586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5761314630508423},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5326418876647949},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5286698341369629},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5014846324920654},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4916263222694397},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4827960729598999},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4736779034137726},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46648433804512024},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.45416978001594543},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4488348662853241},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.44455111026763916},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41154730319976807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35080963373184204},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3171765208244324},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11878541111946106},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08187749981880188},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2970276.2970319","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2970276.2970319","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering","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":23,"referenced_works":["https://openalex.org/W1496681274","https://openalex.org/W1639713563","https://openalex.org/W1787074469","https://openalex.org/W1999990426","https://openalex.org/W2032382981","https://openalex.org/W2050339136","https://openalex.org/W2086142021","https://openalex.org/W2105993618","https://openalex.org/W2106892818","https://openalex.org/W2123871098","https://openalex.org/W2129538349","https://openalex.org/W2133094064","https://openalex.org/W2158651374","https://openalex.org/W2158995961","https://openalex.org/W2163850966","https://openalex.org/W2166280160","https://openalex.org/W2296319761","https://openalex.org/W2525936901","https://openalex.org/W2911423894","https://openalex.org/W2949558051","https://openalex.org/W6665018949","https://openalex.org/W6679495168","https://openalex.org/W6851331377"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W1531664660","https://openalex.org/W1597500234","https://openalex.org/W1567852657","https://openalex.org/W2097415053","https://openalex.org/W1505872263","https://openalex.org/W2117968906","https://openalex.org/W3000202925","https://openalex.org/W2518934056","https://openalex.org/W1546943373"],"abstract_inverted_index":{"Due":[0],"to":[1,36,45],"their":[2],"complexity,":[3],"currently":[4],"available":[5,42],"bounded":[6,32],"model":[7,33],"checking":[8,34],"techniques":[9,43],"based":[10],"on":[11],"Boolean":[12,101],"Satisfiability":[13,15],"and":[14,22,61,98],"Modulo":[16],"Theories":[17],"inadequately":[18],"handle":[19],"non-linear":[20,63],"floating-point":[21],"integer":[23],"arithmetic.":[24],"Using":[25,58],"a":[26,31,37,87],"numerical":[27],"approach,":[28],"we":[29,67],"reduce":[30],"problem":[35,49,73,106],"constraint":[38,48,71],"satisfaction":[39,72],"problem.":[40],"Currently":[41],"attempt":[44],"solve":[46],"the":[47,59,69,95,100,104],"but":[50],"can":[51],"guarantee":[52],"neither":[53],"global":[54],"convergence":[55],"nor":[56],"correctness.":[57],"IPOPT":[60],"ANTIGONE":[62],"programming":[64],"(NLP)":[65],"solvers,":[66],"transform":[68],"original":[70,105],"from":[74],"one":[75,81],"having":[76,82],"disjunctions":[77],"of":[78,84,103,111],"constraints":[79,85],"into":[80],"conjunctions":[83],"with":[86,109],"few":[88],"introduced":[89],"auxiliary":[90],"variables.":[91],"The":[92],"transformation":[93],"lowers":[94],"computing":[96],"cost":[97],"preserves":[99],"structure":[102],"while":[107],"complying":[108],"limits":[110],"NLP":[112],"solvers.":[113]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}