{"conference":{"name":"EMSOFT: Embedded Software "},"publist_id":"259","year":"2002","date_created":"2018-12-11T12:09:01Z","alternative_title":["LNCS"],"quality_controlled":0,"date_published":"2002-09-25T00:00:00Z","status":"public","_id":"4470","extern":1,"intvolume":" 2491","citation":{"chicago":"Henzinger, Thomas A, Christoph Kirsch, Ritankar Majumdar, and Slobodan Matic. “Time-Safety Checking for Embedded Programs,” 2491:76–92. ACM, 2002. https://doi.org/10.1007/3-540-45828-X_7.","ista":"Henzinger TA, Kirsch C, Majumdar R, Matic S. 2002. Time-safety checking for embedded programs. EMSOFT: Embedded Software , LNCS, vol. 2491, 76–92.","ieee":"T. A. Henzinger, C. Kirsch, R. Majumdar, and S. Matic, “Time-safety checking for embedded programs,” presented at the EMSOFT: Embedded Software , 2002, vol. 2491, pp. 76–92.","apa":"Henzinger, T. A., Kirsch, C., Majumdar, R., & Matic, S. (2002). Time-safety checking for embedded programs (Vol. 2491, pp. 76–92). Presented at the EMSOFT: Embedded Software , ACM. https://doi.org/10.1007/3-540-45828-X_7","ama":"Henzinger TA, Kirsch C, Majumdar R, Matic S. Time-safety checking for embedded programs. In: Vol 2491. ACM; 2002:76-92. doi:10.1007/3-540-45828-X_7","short":"T.A. Henzinger, C. Kirsch, R. Majumdar, S. Matic, in:, ACM, 2002, pp. 76–92.","mla":"Henzinger, Thomas A., et al. Time-Safety Checking for Embedded Programs. Vol. 2491, ACM, 2002, pp. 76–92, doi:10.1007/3-540-45828-X_7."},"month":"09","acknowledgement":"Supported in part by the DARPA SEC grant F33615-C-98-3614, MARCO GSRC grant 98-DT-660, AFOSR MURI grant F49620-00-1-0327, NSF grant CCR-9988172, and a Microsoft Research Fellowship.","volume":2491,"date_updated":"2021-01-12T07:57:12Z","publication_status":"published","title":"Time-safety checking for embedded programs","abstract":[{"text":"Giotto is a platform-independent language for specifying software for high-performance control applications. In this paper we present a new approach to the compilation of Giotto. Following this approach, the Giotto compiler generates code for a virtual machine, called the E machine, which can be ported to different platforms. The Giotto compiler also checks if the generated E code is time safe for a given platform, that is, if the platform offers sufficient performance to ensure that the E code is executed in a timely fashion that conforms with the Giotto semantics. Time-safety checking requires a schedulability analysis. We show that while for arbitrary E code, the analysis is exponential, for E code generated from typical Giotto programs, the analysis is polynomial. This supports our claim that Giotto identifies a useful fragment of embedded programs.","lang":"eng"}],"doi":"10.1007/3-540-45828-X_7","type":"conference","publisher":"ACM","page":"76 - 92","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Kirsch, Christoph M","first_name":"Christoph","last_name":"Kirsch"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"first_name":"Slobodan","last_name":"Matic","full_name":"Matic, Slobodan"}],"day":"25"}