Predicting Worst-Case Behaviour of Programs by Means of Attribute Functions

  • 2016-07-07
  • Research

Examples concerning implementation selection for dynamic storage allocation will be presented


In some applications, so-called hard-real-time systems, it is very important to predict worst-case behaviour of programs, i.e. worst-case execution time or worst-case memory consumption. In general, there are two approaches to the problem: empirical and analytical. Unfortunately, none of the existing solutions seems strong enough to cope with unbounded iterations, recursion, dynamic storage allocation, and implementation selection for abstract data types. During the presentation a solution to the mentioned problems will be presented which is based on attribute functions. The notion of attribute function will be introduced, and some examples concerning implementation selection for dynamic storage allocation will be presented. It seems that attribute function primitives could be a valuable extension to modern hard-real-time languages.


The main area of interest of Jerzy Nawrocki is Software Engineering, but in the past he was involved in projects concerning compiler construction and real-time systems. Currently he is a dean of the Faculty of Computing, Poznan University of Technology, but he has been also with University of Nijmegen, the Netherlands (1986-87), and Dublin City University (1996). He is a member of IFIP Working Group 2.4 (since 1996), vice-chair of IFIP Technical Committee 2 on Software (since 2011), and member of IFIP Board (since 2013).


This talk is organized by the Compilers and Languages Group at the Institute of Computer Languages. Tea at the library of E185/1, Argentinierstr. 8, 4th floor (central) at 10:30.


Note: This is one of the thousands of items we imported from the old website. We’re in the process of reviewing each and every one, but if you notice something strange about this particular one, please let us know. — Thanks!