Transformation of Meta-Information by Abstract Co-interpretation

In this paper we present an approximation method based on abstract interpretation to transform meta-information in parallel with the transformation of concrete data. The meta-information is assumed to describe further properties of the specific data. The construction of a correct transformation function for the meta-information can be quite complicated in case of complex data transformations or data structures. A special approximation method is presented that works with data abstraction.

[1]  Patrick Cousot,et al.  Systematic design of program transformation frameworks by abstract interpretation , 2002, POPL '02.

[2]  Jakob Engblom,et al.  Facilitating worst-case execution times analysis for optimized code , 1998, Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168).

[3]  Jan Gustafsson.  Analyzing execution-time of object-oriented programs using abstract interpretation , 2000 .

[4]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[5]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[6]  Raimund Kirner,et al.  Transformation of path information for WCET analysis during compilation , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[7]  Raimund Kirner,et al.  Timing analysis of optimised code , 2003 .

[8]  Raimund Kirner,et al.  Timing analysis of optimized code , 2003, Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003)..

[9]  Peter P. Puschner,et al.  Computing Maximum Task Execution Times — A Graph-Based Approach , 2004, Real-Time Systems.

[10]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[11]  Alan Burns,et al.  Guest Editorial: A Review of Worst-Case Execution-Time Analysis , 2000, Real-Time Systems.