{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:14:08Z","timestamp":1781104448833,"version":"3.54.1"},"reference-count":29,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,1,1]]},"abstract":"<p>Dataflow programming has been used to describe signal processing applications for many years, traditionally with cyclo-static dataflow (CSDF) or synchronous dataflow (SDF) models that restrict expressive power in favor of compile-time analysis and predictability. More recently, dynamic dataflow is being used for the description of multimedia video standards as promoted by the RVC standard (ISO\/IEC 23001:4). Dynamic dataflow is not restricted with respect to expressive power, but it does require runtime scheduling in the general case, which may be costly to perform on software. The authors presented in a previous paper a method to automatically classify actors of a dynamic dataflow program within more restrictive dataflow models when possible, along with a method to transform the actors classified as static to improve execution speed by reducing the number of FIFO accesses (Wipliez &amp; Raulet, 2010). This paper presents an extension of the classification method using satisfiability solving, and details the precise semantics used for the abstract interpretation of actors. The extended classification is able to classify more actors than what could previously be achieved.<\/p>","DOI":"10.4018\/jertcs.2012010103","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T11:25:04Z","timestamp":1333452304000},"page":"49-69","source":"Crossref","is-referenced-by-count":9,"title":["Classification of Dataflow Actors with Satisfiability and Abstract Interpretation"],"prefix":"10.4018","volume":"3","author":[{"given":"Matthieu","family":"Wipliez","sequence":"first","affiliation":[{"name":"IETR\/INSA, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micka\u00ebl","family":"Raulet","sequence":"additional","affiliation":[{"name":"IETR\/INSA, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jertcs.2012010103-0","unstructured":"\u00c5rz\u00e9n, K., Nilsson, A., & von Platen, C. (2010). Model Compiler [Computer software manual]."},{"key":"jertcs.2012010103-1","author":"C.Barrett","year":"2009","journal-title":"Handbook of satisfiability"},{"key":"jertcs.2012010103-2","doi-asserted-by":"crossref","unstructured":"Barrett, C., & Tinelli, C. (2007). CVC3. In W. Damm & H. Hermanns (Eds.), Proceedings of the 19th International Conference on Computer Aided Verification (LNCS 4590, pp. 298-302).","DOI":"10.1007\/978-3-540-73368-3_34"},{"key":"jertcs.2012010103-3","doi-asserted-by":"publisher","DOI":"10.1109\/78.950795"},{"key":"jertcs.2012010103-4","doi-asserted-by":"publisher","DOI":"10.1109\/78.485935"},{"key":"jertcs.2012010103-5","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-009-0389-5"},{"key":"jertcs.2012010103-6","doi-asserted-by":"crossref","unstructured":"Boutellier, J., Silven, O., & Raulet, M. (2011). Scheduling of CAL actor networks based on dynamic code analysis. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing.","DOI":"10.1109\/ICASSP.2011.5946805"},{"key":"jertcs.2012010103-7","doi-asserted-by":"crossref","unstructured":"Buck, J. (1994). Static scheduling and code generation from dynamic dataflow graphs with integer-valued control streams. Paper presented at the 28th Asilomar Conference on Signals.","DOI":"10.1109\/ACSSC.1994.471505"},{"key":"jertcs.2012010103-8","doi-asserted-by":"crossref","unstructured":"Buck, J., & Lee, E. (1993). Scheduling dynamic dataflow graphs with bounded memory using the token flow model. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (pp. 429-432).","DOI":"10.1109\/ICASSP.1993.319147"},{"key":"jertcs.2012010103-9","doi-asserted-by":"crossref","unstructured":"Cousot, P., & Cousot, R. (1977). Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Sigact-Sigplan Symposium on Principles of Programming Languages (pp. 238-252).","DOI":"10.1145\/512950.512973"},{"key":"jertcs.2012010103-10","doi-asserted-by":"crossref","unstructured":"De Moura, L., & Bj\u00f8rner, N. (2008). Z3: An efficient SMT solver. In Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (pp. 337-340).","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"jertcs.2012010103-11","doi-asserted-by":"crossref","unstructured":"Deutsch, P. (1996). RFC 1951: DEFLATE Compressed Data Format Specification version 1.3 [Computer software manual]. Retrieved from http:\/\/www.ietf.org\/rfc\/rfc1951.txt","DOI":"10.17487\/rfc1951"},{"key":"jertcs.2012010103-12","unstructured":"Eker, J., & Janneck, J. (2003). CAL Language Report (Tech. Rep. No. UCB\/ERL M03\/48). Berkeley, CA: University of California at Berkeley."},{"key":"jertcs.2012010103-13","doi-asserted-by":"publisher","DOI":"10.1007\/s11554-010-0169-2"},{"key":"jertcs.2012010103-14","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2009.2031517"},{"key":"jertcs.2012010103-15","doi-asserted-by":"crossref","unstructured":"Haid, W., Schor, L., Huang, K., Bacivarov, I., & Thiele, L. (2009). Efficient execution of Kahn process networks on multi-processor systems using protothreads and windowed FIFOs. In Proceedings of the IEEE Workshop on Embedded Systems for Real-Time Multimedia (pp. 35-44).","DOI":"10.1109\/ESTMED.2009.5336828"},{"key":"jertcs.2012010103-16","unstructured":"Kahn, G. (1974). The semantics of a simple language for parallel programming. In Proceedings of the International Forum on Information Processing (pp. 471-475)."},{"key":"jertcs.2012010103-17","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"jertcs.2012010103-18","doi-asserted-by":"publisher","DOI":"10.1109\/5.381846"},{"key":"jertcs.2012010103-19","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936032"},{"issue":"1","key":"jertcs.2012010103-20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","article-title":"Identifying hierarchical structure in sequences: A linear-time algorithm.","volume":"7","author":"C.Nevill-Manning","year":"1997","journal-title":"Journal of Artificial Intelligence Research"},{"key":"jertcs.2012010103-21","unstructured":"Parks, T. M. (1995). Bounded scheduling of process networks (Unpublished doctoral dissertation). University of California, Berkeley, CA."},{"key":"jertcs.2012010103-22","first-page":"11","article-title":"An open framework for rapid prototyping of signal processing applications.","volume":"\u25aa\u25aa\u25aa","author":"M.Pelcat","year":"2009","journal-title":"EURASIP Journal on Embedded Systems"},{"key":"jertcs.2012010103-23","unstructured":"Ranise, S., & Tinelli, C. (2003). The SMT-LIB format: An initial proposal. In Proceedings of the 1st Workshop on Pragmatics of Decision Procedures in Automated Reasoning."},{"key":"jertcs.2012010103-24","author":"G. L.Steele","year":"1990","journal-title":"Common LISP: the language"},{"key":"jertcs.2012010103-25","doi-asserted-by":"crossref","unstructured":"Stitt, G., & Vahid, F. (2005). New decompilation techniques for binary-level co-processor generation. In Proceedings of the IEEE\/ACM International Conference on Computer-aided Design (Vol. 2, pp. 547-554).","DOI":"10.1109\/ICCAD.2005.1560127"},{"key":"jertcs.2012010103-26","unstructured":"Wipliez, M. (2010). Compilation infrastructure for dataflow programs (Unpublished doctoral dissertation). National Institute of Applied Sciences, Rennes, France."},{"key":"jertcs.2012010103-27","doi-asserted-by":"crossref","unstructured":"Wipliez, M., & Raulet, M. (2010). Classification and transformation of dynamic dataflow programs. In Proceedings of the International Conference on Design and Architectures for Signal and Image Processing.","DOI":"10.1109\/DASIP.2010.5706280"},{"key":"jertcs.2012010103-28","doi-asserted-by":"crossref","unstructured":"Zebelein, C., Falk, J., Haubelt, C., & Teich, J. (2008). Classification of general data flow actors into known models of computation. In Proceedings of the 6th IEEE\/ACM International Conference on Formal Methods and Models for CoDesign, Anaheim, CA (pp. 119-128).","DOI":"10.1109\/MEMCOD.2008.4547699"}],"container-title":["International Journal of Embedded and Real-Time Communication Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=62992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:15:55Z","timestamp":1654092955000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jertcs.2012010103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jertcs.2012010103","relation":{},"ISSN":["1947-3176","1947-3184"],"issn-type":[{"value":"1947-3176","type":"print"},{"value":"1947-3184","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}