{"date_published":"2005-06-01T00:00:00Z","publication_status":"published","citation":{"short":"T.A. Henzinger, C. Kirsch, S. Matic, in:, ACM, 2005, pp. 21–30.","ama":"Henzinger TA, Kirsch C, Matic S. Composable code generation for distributed Giotto. In: ACM; 2005:21-30. doi:<a href=\"https://doi.org/10.1145/1065910.1065914\">10.1145/1065910.1065914</a>","chicago":"Henzinger, Thomas A, Christoph Kirsch, and Slobodan Matic. “Composable Code Generation for Distributed Giotto,” 21–30. ACM, 2005. <a href=\"https://doi.org/10.1145/1065910.1065914\">https://doi.org/10.1145/1065910.1065914</a>.","ista":"Henzinger TA, Kirsch C, Matic S. 2005. Composable code generation for distributed Giotto. LCTES: Languages, Compilers, and Tools for Embedded Systems, 21–30.","apa":"Henzinger, T. A., Kirsch, C., &#38; Matic, S. (2005). Composable code generation for distributed Giotto (pp. 21–30). Presented at the LCTES: Languages, Compilers, and Tools for Embedded Systems, ACM. <a href=\"https://doi.org/10.1145/1065910.1065914\">https://doi.org/10.1145/1065910.1065914</a>","ieee":"T. A. Henzinger, C. Kirsch, and S. Matic, “Composable code generation for distributed Giotto,” presented at the LCTES: Languages, Compilers, and Tools for Embedded Systems, 2005, pp. 21–30.","mla":"Henzinger, Thomas A., et al. <i>Composable Code Generation for Distributed Giotto</i>. ACM, 2005, pp. 21–30, doi:<a href=\"https://doi.org/10.1145/1065910.1065914\">10.1145/1065910.1065914</a>."},"extern":1,"conference":{"name":"LCTES: Languages, Compilers, and Tools for Embedded Systems"},"abstract":[{"lang":"eng","text":"We present a compositional approach to the implementation of hard real-time software running on a distributed platform. We explain how several code suppliers, coordinated by a system integrator, can independently generate different parts of the distributed software. The task structure, interaction, and timing is specified as a Giotto program. Each supplier is given a part of the Giotto program and a timing interface, from which the supplier generates task and scheduling code. The integrator then checks, individually for each supplier, in pseudo-polynomial time, if the supplied code meets its timing specification. If all checks succeed, then the supplied software parts are guaranteed to work together and implement the original Giotto program. The feasibility of the approach is demonstrated by a prototype implementation."}],"_id":"4457","author":[{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph M"},{"last_name":"Matic","first_name":"Slobodan","full_name":"Matic, Slobodan"}],"day":"01","page":"21 - 30","doi":"10.1145/1065910.1065914","type":"conference","date_updated":"2021-01-12T07:57:06Z","month":"06","status":"public","title":"Composable code generation for distributed Giotto","quality_controlled":0,"date_created":"2018-12-11T12:08:57Z","publist_id":"275","year":"2005","publisher":"ACM"}