{"doi":"10.1007/3-540-45828-X_7","publication":"Proceedings of the 2nd International Conference on Embedded Software","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"Time-safety checking for embedded programs","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540443070"]},"_id":"4470","alternative_title":["LNCS"],"intvolume":"      2491","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.","scopus_import":"1","date_updated":"2023-06-05T08:50:59Z","publisher":"ACM","day":"25","volume":2491,"oa_version":"None","publication_status":"published","month":"09","abstract":[{"lang":"eng","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."}],"date_published":"2002-09-25T00:00:00Z","page":"76 - 92","status":"public","article_processing_charge":"No","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"},{"first_name":"Slobodan","full_name":"Matic, Slobodan","last_name":"Matic"}],"year":"2002","conference":{"start_date":"2002-10-07","name":"EMSOFT: Embedded Software ","end_date":"2002-10-09","location":"Grenoble, France"},"type":"conference","citation":{"mla":"Henzinger, Thomas A., et al. “Time-Safety Checking for Embedded Programs.” <i>Proceedings of the 2nd International Conference on Embedded Software</i>, vol. 2491, ACM, 2002, pp. 76–92, doi:<a href=\"https://doi.org/10.1007/3-540-45828-X_7\">10.1007/3-540-45828-X_7</a>.","ieee":"T. A. Henzinger, C. Kirsch, R. Majumdar, and S. Matic, “Time-safety checking for embedded programs,” in <i>Proceedings of the 2nd International Conference on Embedded Software</i>, Grenoble, France, 2002, vol. 2491, pp. 76–92.","ama":"Henzinger TA, Kirsch C, Majumdar R, Matic S. Time-safety checking for embedded programs. In: <i>Proceedings of the 2nd International Conference on Embedded Software</i>. Vol 2491. ACM; 2002:76-92. doi:<a href=\"https://doi.org/10.1007/3-540-45828-X_7\">10.1007/3-540-45828-X_7</a>","apa":"Henzinger, T. A., Kirsch, C., Majumdar, R., &#38; Matic, S. (2002). Time-safety checking for embedded programs. In <i>Proceedings of the 2nd International Conference on Embedded Software</i> (Vol. 2491, pp. 76–92). Grenoble, France: ACM. <a href=\"https://doi.org/10.1007/3-540-45828-X_7\">https://doi.org/10.1007/3-540-45828-X_7</a>","short":"T.A. Henzinger, C. Kirsch, R. Majumdar, S. Matic, in:, Proceedings of the 2nd International Conference on Embedded Software, ACM, 2002, pp. 76–92.","ista":"Henzinger TA, Kirsch C, Majumdar R, Matic S. 2002. Time-safety checking for embedded programs. Proceedings of the 2nd International Conference on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2491, 76–92.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Ritankar Majumdar, and Slobodan Matic. “Time-Safety Checking for Embedded Programs.” In <i>Proceedings of the 2nd International Conference on Embedded Software</i>, 2491:76–92. ACM, 2002. <a href=\"https://doi.org/10.1007/3-540-45828-X_7\">https://doi.org/10.1007/3-540-45828-X_7</a>."},"publist_id":"259","extern":"1","date_created":"2018-12-11T12:09:01Z"}