{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:43:07Z","timestamp":1755801787117,"version":"3.44.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/reconfig48160.2019.8994781","type":"proceedings-article","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T03:23:28Z","timestamp":1581650608000},"page":"1-8","source":"Crossref","is-referenced-by-count":12,"title":["Agile SMT-Based Mapping for CGRAs with Restricted Routing Networks"],"prefix":"10.1109","author":[{"given":"Caleb","family":"Donovick","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Makai","family":"Mann","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Clark","family":"Barrett","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Pat","family":"Hanrahan","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Satisfiability modulo theories","author":"barrett","year":"2017","journal-title":"Handbook of Model Checking"},{"journal-title":"Combinatorial Algorithms Theory and Practice","year":"1977","author":"reingold","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2003.1253623"},{"key":"ref13","first-page":"191","author":"friedman","year":"2009","journal-title":"Spr An architecture-adaptive cgra mapping tool ” ser FPGA ‘09"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SOCPAR.2010.5685969"},{"key":"ref15","first-page":"1","author":"fell","year":"2014","journal-title":"Force-directed scheduling for data flow graph mapping on coarse-grained reconfigurable architectures ” ser ReConFig ‘14"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2012.6412149"},{"journal-title":"Standard cell routing via boolean satisfiability","year":"2012","author":"ryzhenko","key":"ref17"},{"key":"ref18","first-page":"436","author":"nadel","year":"2017","journal-title":"A correct-by-decision solution for simultaneous place and route ” ser CAV 2017"},{"key":"ref19","first-page":"124","author":"fan","year":"2008","journal-title":"Modulo scheduling for highly customized datapaths to increase hardware reusability ” ser CGO ‘08"},{"key":"ref4","first-page":"389","article-title":"Plasticine: A reconfigurable architecture for parallel patterns,” ser. ISCA 2017","author":"prabhakar","year":"2017","journal-title":"IEEE"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783755"},{"key":"ref6","first-page":"1284","author":"hamzeh","year":"2012","journal-title":"Epimap Using epimorphism to map applications on cgras ” ser DAC ‘12"},{"key":"ref5","first-page":"166","author":"park","year":"2008","journal-title":"Edge-centric modulo scheduling for coarse-grained reconfigurable architectures ” ser PACT 2008"},{"key":"ref8","first-page":"166","article-title":"Dresc: A retargetable compiler for coarse-grained reconfigurable architectures","author":"mei","year":"2002","journal-title":"2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings."},{"key":"ref7","first-page":"128:1","author":"chin","year":"2018","journal-title":"An architecture-agnostic integer linear programming approach to cgra mapping ” ser DAC ‘18"},{"key":"ref2","first-page":"7","author":"farooq","year":"2012","journal-title":"FPGA Architectures An Overview"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2010.81"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322287"},{"journal-title":"Gurobi Optimizer Reference Manual","year":"2018","author":"gurobi","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96145-3_32"},{"key":"ref21","article-title":"The SCIP Optimization Suite 6.0","author":"gleixner","year":"2018","journal-title":"Optimization Online Technical Report"},{"key":"ref24","first-page":"14","article-title":"CaDiCaL, Lingeling, Plingeling, Treengeling, Yal SAT Entering the SAT Competition 2017","volume":"b 2017 1","author":"biere","year":"2017","journal-title":"Proceedings of SAT Competition 2017 Solver and Benchmark Descriptions"},{"journal-title":"Smt-comp 2018 qf_bv results","article-title":"13th International Satisfiability Modulo Theories Competition","year":"2018","key":"ref23"}],"event":{"name":"2019 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","start":{"date-parts":[[2019,12,9]]},"location":"Cancun, Mexico","end":{"date-parts":[[2019,12,11]]}},"container-title":["2019 International Conference on ReConFigurable Computing and FPGAs (ReConFig)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8974168\/8994692\/08994781.pdf?arnumber=8994781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T18:37:47Z","timestamp":1755715067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8994781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/reconfig48160.2019.8994781","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}