{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:12Z","timestamp":1750220772779,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,5,25]]},"DOI":"10.1145\/3378678.3391877","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:21:35Z","timestamp":1590452495000},"page":"19-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Compiling synchronous languages to optimal move code for exposed datapath architectures"],"prefix":"10.1145","author":[{"given":"Marc","family":"Dahlem","sequence":"first","affiliation":[{"name":"Insiders Technologies GmbH, Kaiserslautern, Germany"}]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern, Kaiserslautern, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,5,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.805826"},{"key":"e_1_3_2_1_2_1","unstructured":"A. Bhagyanath T. Jain and K. Schneider. 2016. Towards Code Generation for the Synchronous Control Asynchronous Dataflow (SCAD) Architectures. In Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV) R. Wimmer (Ed.). University of Freiburg Freiburg Germany 77--88.  A. Bhagyanath T. Jain and K. Schneider. 2016. Towards Code Generation for the Synchronous Control Asynchronous Dataflow (SCAD) Architectures. In Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV) R. Wimmer (Ed.). University of Freiburg Freiburg Germany 77--88."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. Bhagyanath and K. Schneider. 2016. Optimal Compilation for Exposed Datapath Architectures with Buffered Processing Units by SAT Solvers. In Formal Methods and Models for Codesign (MEMOCODE) E. Leonard and K. Schneider (Eds.). IEEE Computer Society Kanpur India 143--152.  A. Bhagyanath and K. Schneider. 2016. Optimal Compilation for Exposed Datapath Architectures with Buffered Processing Units by SAT Solvers. In Formal Methods and Models for Codesign (MEMOCODE) E. Leonard and K. Schneider (Eds.). IEEE Computer Society Kanpur India 143--152.","DOI":"10.1109\/MEMCOD.2016.7797759"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"A. Bhagyanath and K. Schneider. 2017. Exploring Different Execution Paradigms in Exposed Datapath Architectures with Buffered Processing Units. In International Conference on Embedded Computer Systems: Architectures Modeling and Simulation (SAMOS) Y. Patt and S.K. Nandy (Eds.). IEEE Computer Society Samos Greece 1--10.  A. Bhagyanath and K. Schneider. 2017. Exploring Different Execution Paradigms in Exposed Datapath Architectures with Buffered Processing Units. In International Conference on Embedded Computer Systems: Architectures Modeling and Simulation (SAMOS) Y. Patt and S.K. Nandy (Eds.). IEEE Computer Society Samos Greece 1--10.","DOI":"10.1109\/SAMOS.2017.8344605"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"A. Bhagyanath and K. Schneider. 2017. Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units. In Application of Concurrency to System Design (ACSD) A. Legay and K. Schneider (Eds.). IEEE Computer Society Zaragoza Spain 106--115.  A. Bhagyanath and K. Schneider. 2017. Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units. In Application of Concurrency to System Design (ACSD) A. Legay and K. Schneider (Eds.). IEEE Computer Society Zaragoza Spain 106--115.","DOI":"10.1109\/ACSD.2017.20"},{"key":"e_1_3_2_1_6_1","volume-title":"REFLIX: A Processor Core with Native Support for Control Dominated Embedded Applications. Journal of Microprocessors and Microsystems","author":"Biglari-Abhari M.","year":"2004","unstructured":"M. Biglari-Abhari , Z. Salcic , P. Roop , and A. Bigdeli . 2004 . REFLIX: A Processor Core with Native Support for Control Dominated Embedded Applications. Journal of Microprocessors and Microsystems (2004). M. Biglari-Abhari, Z. Salcic, P. Roop, and A. Bigdeli. 2004. REFLIX: A Processor Core with Native Support for Control Dominated Embedded Applications. Journal of Microprocessors and Microsystems (2004)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.97299"},{"volume-title":"Forum on Specification and Design Languages (FDL)","author":"Brandt J.","key":"e_1_3_2_1_8_1","unstructured":"J. Brandt , M. Gem\u00fcnde , K. Schneider , S. Shukla , and J.-P. Talpin . 2011. Integrating System Descriptions by Clocked Guarded Actions . In Forum on Specification and Design Languages (FDL) , A. Morawiec, J. Hinderscheit, and O. Ghenassia (Eds.). IEEE Computer Society , Oldenburg, Germany , 1--8. J. Brandt, M. Gem\u00fcnde, K. Schneider, S. Shukla, and J.-P. Talpin. 2011. Integrating System Descriptions by Clocked Guarded Actions. In Forum on Specification and Design Languages (FDL), A. Morawiec, J. Hinderscheit, and O. Ghenassia (Eds.). IEEE Computer Society, Oldenburg, Germany, 1--8."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10617-012-9087-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Internal Report 382\/11. Department of Computer Science","author":"Brandt J.","year":"2011","unstructured":"J. Brandt and K. Schneider . 2011 . Separate Translation of Synchronous Programs to Guarded Actions . Internal Report 382\/11. Department of Computer Science , University of Kaiserslautern , Kaiserslautern, Germany . J. Brandt and K. Schneider. 2011. Separate Translation of Synchronous Programs to Guarded Actions. Internal Report 382\/11. Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany."},{"volume-title":"Answer Set Optimization. In International Joint Conference on Artificial Intelligence (IJCAI), G. Gottlob and T. Walsh (Eds.). Morgan Kaufmann","author":"Brewka G.","key":"e_1_3_2_1_11_1","unstructured":"G. Brewka , I. Niemela , and M. Truszczynski . 2003 . Answer Set Optimization. In International Joint Conference on Artificial Intelligence (IJCAI), G. Gottlob and T. Walsh (Eds.). Morgan Kaufmann , Acapulco, Mexico, 867--872. G. Brewka, I. Niemela, and M. Truszczynski. 2003. Answer Set Optimization. In International Joint Conference on Artificial Intelligence (IJCAI), G. Gottlob and T. Walsh (Eds.). Morgan Kaufmann, Acapulco, Mexico, 867--872."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.65"},{"key":"e_1_3_2_1_13_1","volume-title":"LUSTRE: A declarative language for programming synchronous systems. In Principles of Programming Languages (POPL)","author":"Caspi P.","year":"1987","unstructured":"P. Caspi , N. Halbwachs , D. Pilaud , and J.A. Plaice . 1987 . LUSTRE: A declarative language for programming synchronous systems. In Principles of Programming Languages (POPL) . ACM , Munich, Germany , 178--188. P. Caspi, N. Halbwachs, D. Pilaud, and J.A. Plaice. 1987. LUSTRE: A declarative language for programming synchronous systems. In Principles of Programming Languages (POPL). ACM, Munich, Germany, 178--188."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"A. Colmerauer and P. Roussel. 1996. The Birth of Prolog. In History of Programming Languages II T.J. Bergin and R.G. Gibson (Eds.). ACM Chapter 7.  A. Colmerauer and P. Roussel. 1996. The Birth of Prolog. In History of Programming Languages II T.J. Bergin and R.G. Gibson (Eds.). ACM Chapter 7.","DOI":"10.1145\/234286.1057820"},{"key":"e_1_3_2_1_15_1","first-page":"4","article-title":"Computation in the Context of Transport Triggered Architectures","volume":"28","author":"H. Corp","year":"2000","unstructured":"H. Corp oraal, J. Janssen , and M. Arnold . 2000 . Computation in the Context of Transport Triggered Architectures . International Journal of Parallel Programming 28 , 4 (August 2000), 401--427. H. Corporaal, J. Janssen, and M. Arnold. 2000. Computation in the Context of Transport Triggered Architectures. International Journal of Parallel Programming 28, 4 (August 2000), 401--427.","journal-title":"International Journal of Parallel Programming"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"M. Dahlem A. Bhagyanath and K. Schneider. 2018. Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP. arXiv Report arXiv:1804.10998. Cornell University Library. Paper accepted at International Conference on Logic Programming (ICLP) Oxford UK.  M. Dahlem A. Bhagyanath and K. Schneider. 2018. Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP. arXiv Report arXiv:1804.10998. Cornell University Library. Paper accepted at International Conference on Logic Programming (ICLP) Oxford UK.","DOI":"10.29007\/678g"},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP","volume":"18","author":"Dahlem M.","year":"2018","unstructured":"M. Dahlem , A. Bhagyanath , and K. Schneider . 2018 . Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP . Theory and Practice of Logic Programming (TPLP) 18 , 1 (January 2018), 438--451. M. Dahlem, A. Bhagyanath, and K. Schneider. 2018. Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP. Theory and Practice of Logic Programming (TPLP) 18, 1 (January 2018), 438--451.","journal-title":"Theory and Practice of Logic Programming (TPLP)"},{"key":"e_1_3_2_1_18_1","volume-title":"Schmidt (Eds.)","volume":"5689","author":"Eiter T.","unstructured":"T. Eiter , G. Ianni , and T. Krennwallner . 2009. Answer Set Programming: A Primer. In Reasoning Web. Semantic Technologies for Information Systems (LNCS), S. Tessaris, E. Franconi, T. Eiter, C. Gutierrez, S. Handschuh, M.-C. Rousset, and R.A . Schmidt (Eds.) , Vol. 5689 . Springer, Brixen-Bressanone, Italy, 40--110. T. Eiter, G. Ianni, and T. Krennwallner. 2009. Answer Set Programming: A Primer. In Reasoning Web. Semantic Technologies for Information Systems (LNCS), S. Tessaris, E. Franconi, T. Eiter, C. Gutierrez, S. Handschuh, M.-C. Rousset, and R.A. Schmidt (Eds.), Vol. 5689. Springer, Brixen-Bressanone, Italy, 40--110."},{"key":"e_1_3_2_1_19_1","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages F.","year":"1994","unstructured":"F. Fages . 1994 . Consistency of Clark's completion and existence of stable models . Methods of Logic in Computer Science 1 , 1 (1994), 51 -- 60 . F. Fages. 1994. Consistency of Clark's completion and existence of stable models. Methods of Logic in Computer Science 1, 1 (1994), 51--60.","journal-title":"Methods of Logic in Computer Science"},{"key":"e_1_3_2_1_20_1","unstructured":"M. Feller and M.D. Ercegovac. 1981. Queue machines: An organization for parallel computation. In Conpar 81 (LNCS) W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegm\u00fcller J. Stoer N. Wirth and Wolfgang H\u00e4ndler (Eds.) Vol. 111. Springer N\u00fcrnberg Germany 37--47.  M. Feller and M.D. Ercegovac. 1981. Queue machines: An organization for parallel computation. In Conpar 81 (LNCS) W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegm\u00fcller J. Stoer N. Wirth and Wolfgang H\u00e4ndler (Eds.) Vol. 111. Springer N\u00fcrnberg Germany 37--47."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(85)80005-4"},{"key":"e_1_3_2_1_22_1","unstructured":"M. Gelfond and V. Lifschitz. 1988. The Stable Model Semantics for Logic Programming. In Logic Programming R.A. Kowalski and K.A. Bowen (Eds.). MIT Press Seattle Washington USA 1070--1080.  M. Gelfond and V. Lifschitz. 1988. The Stable Model Semantics for Logic Programming. In Logic Programming R.A. Kowalski and K.A. Bowen (Eds.). MIT Press Seattle Washington USA 1070--1080."},{"volume-title":"Synchronous programming of reactive systems","author":"Halbwachs N.","key":"e_1_3_2_1_23_1","unstructured":"N. Halbwachs . 1993. Synchronous programming of reactive systems . Kluwer . N. Halbwachs. 1993. Synchronous programming of reactive systems. Kluwer."},{"volume-title":"Formal Methods and Models for Codesign (MEMOCODE)","author":"Halbwachs N.","key":"e_1_3_2_1_24_1","unstructured":"N. Halbwachs . 2005. A synchronous language at work: the story of Lustre . In Formal Methods and Models for Codesign (MEMOCODE) . IEEE Computer Society , Verona, Italy , 3--11. N. Halbwachs. 2005. A synchronous language at work: the story of Lustre. In Formal Methods and Models for Codesign (MEMOCODE). IEEE Computer Society, Verona, Italy, 3--11."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.97300"},{"key":"e_1_3_2_1_26_1","volume-title":"IFIP Congress","author":"Kowalski R.","year":"1974","unstructured":"R. Kowalski . 1974 . Predicate Logic as Programming Language . In IFIP Congress . Stockholm, Sweden, 569--574. R. Kowalski. 1974. Predicate Logic as Programming Language. In IFIP Congress. Stockholm, Sweden, 569--574."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.97301"},{"volume-title":"Architectural Support for Programming Languages and Operating Systems (ASPLOS)","author":"Li X.","key":"e_1_3_2_1_28_1","unstructured":"X. Li , M. Boldt , and R. von Hanxleden . 2006. Mapping Esterel onto a multi-threaded embedded processor . In Architectural Support for Programming Languages and Operating Systems (ASPLOS) , J.P. Shen and M.R. Martonosi (Eds.). ACM, San Jose , California, USA , 303--314. X. Li, M. Boldt, and R. von Hanxleden. 2006. Mapping Esterel onto a multi-threaded embedded processor. In Architectural Support for Programming Languages and Operating Systems (ASPLOS), J.P. Shen and M.R. Martonosi (Eds.). ACM, San Jose, California, USA, 303--314."},{"volume-title":"Compilers, Architecture, and Synthesis for Embedded Systems (CASES)","author":"Li X.","key":"e_1_3_2_1_29_1","unstructured":"X. Li , J. Lukoschus , M. Boldt , M. Harder , and R. von Hanxleden . 2005. An Esterel processor with full preemption support and its worst case reaction time analysis . In Compilers, Architecture, and Synthesis for Embedded Systems (CASES) , T.M. Conte, P. Faraboschi, W.H. Mangione-Smith, and W.A. Najjar (Eds.). ACM, San Francisco , California, USA , 225--236. X. Li, J. Lukoschus, M. Boldt, M. Harder, and R. von Hanxleden. 2005. An Esterel processor with full preemption support and its worst case reaction time analysis. In Compilers, Architecture, and Synthesis for Embedded Systems (CASES), T.M. Conte, P. Faraboschi, W.H. Mangione-Smith, and W.A. Najjar (Eds.). ACM, San Francisco, California, USA, 225--236."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141277.1141489"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.246"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"K. Rathlev S. Smyth C. Motika R. von Hanxleden and M. Mendler. 2015. SCEst: Sequentially Constructive Esterel. In Formal Methods and Models for Codesign (MEMOCODE) A. Gerstlauer C. Heitmeyer and E. Leonard (Eds.). IEEE Computer Society Austin Texas USA 10--19.  K. Rathlev S. Smyth C. Motika R. von Hanxleden and M. Mendler. 2015. SCEst: Sequentially Constructive Esterel. In Formal Methods and Models for Codesign (MEMOCODE) A. Gerstlauer C. Heitmeyer and E. Leonard (Eds.). IEEE Computer Society Austin Texas USA 10--19.","DOI":"10.1109\/MEMCOD.2015.7340462"},{"volume-title":"Embedded Software (EMSOFT)","author":"Roop P.S.","key":"e_1_3_2_1_34_1","unstructured":"P.S. Roop , Z. Salcic , and M.W. Sajeewa Dayaratne . 2004. Towards direct execution of Esterel programs on reactive processors . In Embedded Software (EMSOFT) , G.C. Buttazzo (Ed.). ACM, Pisa , Italy , 240--248. P.S. Roop, Z. Salcic, and M.W. Sajeewa Dayaratne. 2004. Towards direct execution of Esterel programs on reactive processors. In Embedded Software (EMSOFT), G.C. Buttazzo (Ed.). ACM, Pisa, Italy, 240--248."},{"volume-title":"Asia and South Pacific Design Automation Conference (ASP-DAC). ACM","author":"Salcic Z.","key":"e_1_3_2_1_35_1","unstructured":"Z. Salcic , D. Hui , P. Roop , and M. Biglari-Abhari . 2005. REMIC: Design of a Reactive Embedded Microprocessor Core . In Asia and South Pacific Design Automation Conference (ASP-DAC). ACM , Shanghai, China, 977--981. Z. Salcic, D. Hui, P. Roop, and M. Biglari-Abhari. 2005. REMIC: Design of a Reactive Embedded Microprocessor Core. In Asia and South Pacific Design Automation Conference (ASP-DAC). ACM, Shanghai, China, 977--981."},{"key":"e_1_3_2_1_36_1","volume-title":"REFLIX: A Processor Core for Reactive Embedded Applications. In Field-Programmable Logic and Applications (FPL) (LNCS)","author":"Salcic Z.","year":"2002","unstructured":"Z. Salcic , P. Roop , M. Biglari-Abhari , and A. Bigdeli . 2002 . REFLIX: A Processor Core for Reactive Embedded Applications. In Field-Programmable Logic and Applications (FPL) (LNCS) , M. Glesner, P. Zipf, and M. Renovell (Eds.), Vol. 2438 . Springer , Montpellier, France , 945--954. Z. Salcic, P. Roop, M. Biglari-Abhari, and A. Bigdeli. 2002. REFLIX: A Processor Core for Reactive Embedded Applications. In Field-Programmable Logic and Applications (FPL) (LNCS), M. Glesner, P. Zipf, and M. Renovell (Eds.), Vol. 2438. Springer, Montpellier, France, 945--954."},{"key":"e_1_3_2_1_37_1","unstructured":"H. Schmit B. Levine and B. Ylvisaker. 2002. Queue machines: hardware compilation in hardware. In Field-Programmable Custom Computing Machines (FCCM) J. Arnold and K.L. Pocek (Eds.). IEEE Computer Society Napa California USA 152--160.  H. Schmit B. Levine and B. Ylvisaker. 2002. Queue machines: hardware compilation in hardware. In Field-Programmable Custom Computing Machines (FCCM) J. Arnold and K.L. Pocek (Eds.). IEEE Computer Society Napa California USA 152--160."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"K. Schneider J. Brandt and T. Sch\u00fcle. 2004. Causality Analysis of Synchronous Programs with Delayed Actions. In Compilers Architecture and Synthesis for Embedded Systems. ACM Washington District of Columbia USA 179--189.  K. Schneider J. Brandt and T. Sch\u00fcle. 2004. Causality Analysis of Synchronous Programs with Delayed Actions. In Compilers Architecture and Synthesis for Embedded Systems. ACM Washington District of Columbia USA 179--189.","DOI":"10.1145\/1023833.1023859"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"K. Schneider and M. Dahlem. 2018. Are Synchronous Programs Logic Programs? In Principled Software Development P. M\u00fcller and I. Sch\u00e4fer (Eds.). Springer Nature Switzerland 251--266.  K. Schneider and M. Dahlem. 2018. Are Synchronous Programs Logic Programs? In Principled Software Development P. M\u00fcller and I. Sch\u00e4fer (Eds.). Springer Nature Switzerland 251--266.","DOI":"10.1007\/978-3-319-98047-8_16"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233307.1233308"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2002.997877"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"volume-title":"Design, Automation and Test in Europe (DATE)","author":"von Hanxleden R.","key":"e_1_3_2_1_44_1","unstructured":"R. von Hanxleden , M. Mendler , J. Aguado , B. Duderstadt , I. Fuhrmann , C. Motika , S. Mercer , and O. O'Brien . 2013. Sequentially constructive concurrency: a conservative extension of the synchronous model of computation . In Design, Automation and Test in Europe (DATE) , E. Macii (Ed.). EDA Consortium\/ACM, Grenoble , France , 581--586. R. von Hanxleden, M. Mendler, J. Aguado, B. Duderstadt, I. Fuhrmann, C. Motika, S. Mercer, and O. O'Brien. 2013. Sequentially constructive concurrency: a conservative extension of the synchronous model of computation. In Design, Automation and Test in Europe (DATE), E. Macii (Ed.). EDA Consortium\/ACM, Grenoble, France, 581--586."},{"key":"e_1_3_2_1_45_1","first-page":"4s","article-title":"Sequentially Constructive Concurrency - A Conservative Extension of the Synchronous Model of Computation","volume":"13","author":"von Hanxleden R.","year":"2014","unstructured":"R. von Hanxleden , M. Mendler , J. Aguado , B. Duderstadt , I. Fuhrmann , C. Motika , S. Mercer , O. O'Brien , and P. Roop . 2014 . Sequentially Constructive Concurrency - A Conservative Extension of the Synchronous Model of Computation . ACM Transactions on Embedded Computing Systems (TECS) 13 , 4s (July 2014), 144:1--144:26. R. von Hanxleden, M. Mendler, J. Aguado, B. Duderstadt, I. Fuhrmann, C. Motika, S. Mercer, O. O'Brien, and P. Roop. 2014. Sequentially Constructive Concurrency - A Conservative Extension of the Synchronous Model of Computation. ACM Transactions on Embedded Computing Systems (TECS) 13, 4s (July 2014), 144:1--144:26.","journal-title":"ACM Transactions on Embedded Computing Systems (TECS)"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-4364-y"}],"event":{"name":"SCOPES '20: 23rd International Workshop on Software and Compilers for Embedded Systems","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems","EDAA European Design Automation Association"],"location":"St. Goar Germany","acronym":"SCOPES '20"},"container-title":["Proceedings of the 23th International Workshop on Software and Compilers for Embedded Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3378678.3391877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3378678.3391877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:19Z","timestamp":1750200079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3378678.3391877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,25]]},"references-count":45,"alternative-id":["10.1145\/3378678.3391877","10.1145\/3378678"],"URL":"https:\/\/doi.org\/10.1145\/3378678.3391877","relation":{},"subject":[],"published":{"date-parts":[[2020,5,25]]},"assertion":[{"value":"2020-05-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}