{"id":"https://openalex.org/W2303534036","doi":"https://doi.org/10.1109/icecs.2015.7440391","title":"Solving constraints in FPGA detailed routing using SMT","display_name":"Solving constraints in FPGA detailed routing using SMT","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2303534036","doi":"https://doi.org/10.1109/icecs.2015.7440391","mag":"2303534036"},"language":"en","primary_location":{"id":"doi:10.1109/icecs.2015.7440391","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs.2015.7440391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Electronics, Circuits, and Systems (ICECS)","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/A5018194556","display_name":"Mona Safar","orcid":"https://orcid.org/0000-0002-1696-1792"},"institutions":[{"id":"https://openalex.org/I107720978","display_name":"Ain Shams University","ror":"https://ror.org/00cb9w016","country_code":"EG","type":"education","lineage":["https://openalex.org/I107720978"]}],"countries":["EG"],"is_corresponding":true,"raw_author_name":"Mona Safar","raw_affiliation_strings":["Computer Engineering and Systems Department, Ain-Shams University, Cairo, Egypt"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Systems Department, Ain-Shams University, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045345296","display_name":"Ashraf Salem","orcid":"https://orcid.org/0000-0002-7971-1707"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ashraf Salem","raw_affiliation_strings":["Mentor Graphics, Cairo, Egypt"],"affiliations":[{"raw_affiliation_string":"Mentor Graphics, Cairo, Egypt","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018194556"],"corresponding_institution_ids":["https://openalex.org/I107720978"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15213523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"613","last_page":"616"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.7940878868103027},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.721828043460846},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.610406756401062},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5022361278533936},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.48881909251213074},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.42673471570014954},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4212181568145752},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41889214515686035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.373495489358902},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3334655165672302},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.2571974992752075},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.24711859226226807},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1718355119228363},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1607711911201477}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7940878868103027},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.721828043460846},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.610406756401062},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5022361278533936},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.48881909251213074},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.42673471570014954},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4212181568145752},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41889214515686035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.373495489358902},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3334655165672302},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.2571974992752075},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.24711859226226807},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1718355119228363},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1607711911201477}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icecs.2015.7440391","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs.2015.7440391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Electronics, Circuits, and Systems (ICECS)","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":12,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1972437065","https://openalex.org/W1992712466","https://openalex.org/W2027335255","https://openalex.org/W2092883699","https://openalex.org/W2108795363","https://openalex.org/W2125990954","https://openalex.org/W2132583177","https://openalex.org/W2139637699","https://openalex.org/W2157056800","https://openalex.org/W2159595840","https://openalex.org/W6683303659"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2778498407","https://openalex.org/W3097018712"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,37],"new":[6],"approach":[7,130],"for":[8,90,110],"solving":[9,111],"the":[10,40,53,57,67,75,83,101,105,118,127,140],"FPGA":[11,92],"detailed":[12,30,84],"routing":[13,31,68,85,97],"problem":[14,22,86],"using":[15],"Satisfiability":[16],"Modulo":[17],"Theories":[18],"(SMT).":[19],"SMT":[20,50,79,108],"allows":[21],"formulation":[23,51],"in":[24],"richer":[25],"first-order":[26],"logic":[27],"fragments.":[28],"The":[29,49],"constraints":[32],"are":[33],"directly":[34],"mapped":[35],"to":[36,55,65,103,116,139],"chain":[38],"of":[39,44,74],"standard":[41],"SMT-LIB2":[42],"assertions":[43],"equality":[45],"and":[46,64,135],"inequality":[47],"predicates.":[48],"eliminates":[52],"need":[54,102],"encode":[56],"net":[58],"track":[59],"segments":[60],"into":[61],"Boolean":[62],"variables":[63],"decode":[66],"solution.":[69],"Moreover,":[70],"it":[71],"is":[72,114],"independent":[73],"channel":[76,121],"width.":[77,122],"Using":[78],"assertion":[80],"stack":[81],"capabilities,":[82],"can":[87],"be":[88],"explored":[89],"various":[91],"architecture":[93],"models":[94],"with":[95],"different":[96],"resources":[98],"capabilities":[99],"without":[100],"reformulate":[104],"whole":[106],"constraints.":[107],"capability":[109],"objective":[112],"functions":[113],"utilized":[115],"find":[117],"optimal":[119],"minimum":[120],"Experimental":[123],"results":[124],"show":[125],"that":[126],"proposed":[128],"SMT-based":[129],"provides":[131],"higher":[132],"modeling":[133],"flexibility":[134],"execution":[136],"speedup":[137],"compared":[138],"SAT-based":[141],"approach.":[142]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}