On undecidability results of real programming languages
Kirner, Raimund, Zimmermann, W. and Richter, D.
(2009)
On undecidability results of real programming languages.
UNSPECIFIED.
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.
Item Type | Other |
---|---|
Date Deposited | 27 Jul 2024 00:16 |
Last Modified | 27 Jul 2024 00:16 |
Downloads
-
picture_as_pdf - 905604.pdf
Share this file
Explore Further
Read more research from the creator(s):
Find work associated with the faculties and division(s):