{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:57:54Z","timestamp":1774594674822,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"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":[[2025,9,1]]},"DOI":"10.1109\/fpl68686.2025.00037","type":"proceedings-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:48:24Z","timestamp":1774554504000},"page":"204-212","source":"Crossref","is-referenced-by-count":0,"title":["Improving Boolean Satisfiability-Based Modulo Scheduling"],"prefix":"10.1109","author":[{"given":"Nicolai","family":"Fiege","sequence":"first","affiliation":[{"name":"University of Kassel,Department of Electrical Engineering and Computer Science,Kassel,Germany"}]},{"given":"Peter","family":"Zipf","sequence":"additional","affiliation":[{"name":"University of Kassel,Department of Electrical Engineering and Computer Science,Kassel,Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/192724.192731"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/a:1018742213548"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/258916.258933"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/12.910814"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2005.17"},{"key":"ref6","first-page":"144","article-title":"Time-Indexed Formulations and a Large Neighborhood Search for the Resource-Constrained Modulo Scheduling Problem","volume-title":"Proc. of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA\u201907\u2019)","author":"de Dinechin","year":"2007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-009-9239-4"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.artint.2013.09.006","article-title":"CROSS cyclic resource-constrained scheduling solver","volume":"206","author":"Bonfietti","year":"2014","journal-title":"Artificial Intelligence"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2014.6927490"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3317670"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317842"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2834440"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3060320"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3599972"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1014192.802449"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0204035"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2968455.2968512"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29400-7_13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2018.00053"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FPL57034.2022.00047"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3705325"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3174243.3174268"},{"issue":"9","key":"ref23","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1109\/TCAD.2011.2153853","article-title":"An Optimal and Practical Approach to Single Constant Multiplication","volume":"30","author":"Thong","year":"2011","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"ref24","first-page":"249","article-title":"Bit-Level Optimized Constant Multiplication Using Boolean Satisfiability","volume":"71","author":"Fiege","year":"2024","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"ref25","first-page":"1","article-title":"HatScheT: A Contribution to Agile HLS","volume-title":"Int. Workshop on FPGAs for Software Programmers","author":"Sittel","year":"2018"},{"key":"ref26","article-title":"Gurobi Optimizer","volume-title":"Gurobi","year":"2022"},{"key":"ref27","first-page":"10","article-title":"ScaLP: A LightWeighted (MI)LP Library","volume-title":"in Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV). T\u00fcbingen: Universit\u00e4t T\u00fcbingen","author":"Sittel","year":"2018"},{"key":"ref28","first-page":"51","article-title":"CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020","volume-title":"in Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions, ser. Department of Computer Science Report Series B","volume":"B-2020\u20131","author":"Biere","year":"2020"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.17.242"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2014.6983050"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref32","article-title":"Origami HLS","volume-title":"U. of Kassel","year":"2015"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2011.44"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICFPT47387.2019.00013"}],"event":{"name":"2025 35th International Conference on Field-Programmable Logic and Applications (FPL)","location":"Leiden, Netherlands","start":{"date-parts":[[2025,9,1]]},"end":{"date-parts":[[2025,9,5]]}},"container-title":["2025 35th International Conference on Field-Programmable Logic and Applications (FPL)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11449056\/11449057\/11449091.pdf?arnumber=11449091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:27:13Z","timestamp":1774589233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11449091\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/fpl68686.2025.00037","relation":{},"subject":[],"published":{"date-parts":[[2025,9,1]]}}}