Now showing items 1-1 of 1

    • On undecidability results of real programming languages 

      Kirner, Raimund; Zimmermann, W.; Richter, D. (2009)
      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 ...