Abstract
Often, it is argued that some problems in data-flow analysis such as e.g. worst case execution time analysis are undecidable (because the halting problem is) and therefore only a conservative approximation of the desired information is possible. In this paper, we show that the semantics for some important real programming languages – in particular those used for programming embedded devices – can be modeled as finite state systems or pushdown machines. This implies that the halting problem becomes decidable and therefore invalidates popular arguments for using conservative analysis.
| Original language | English |
|---|---|
| Title of host publication | In: Procs of Kolloquium Programmiersprachen und Grundlagen der Programmierung |
| Number of pages | 14 |
| Publication status | Published - 2009 |
| Event | Kolloquium Programmiersprachen und Grundlagen der Programmierung - Vienna, United Kingdom Duration: 1 Aug 2009 → … |
Conference
| Conference | Kolloquium Programmiersprachen und Grundlagen der Programmierung |
|---|---|
| Country/Territory | United Kingdom |
| City | Vienna |
| Period | 1/08/09 → … |