You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Timing Analysis of Parallel Software Using Abstract Execution

Fulltext:


Research group:


Publication Type:

Conference/Workshop Paper

Venue:

15th International Conference on Verification, Model Checking, and Abstract Interpretation

Publisher:

Springer

DOI:

10.1007/978-3-642-54013-4_4


Abstract

A major trend in computer architecture is multi-core processors. To fully exploit this type of parallel processor chip, programs running on it will have to be parallel as well. This means that even hard real-time embedded systems will be parallel. Therefore, it is of utmost importance that methods to analyze the timing properties of parallel real-time systems are developed.This paper presents an algorithm that is founded on abstract interpretation and derives safe approximations of the execution times of parallel programs. The algorithm is formulated and proven correct for a simple parallel language with parallel threads, shared memory and synchronization via locks.

Bibtex

@inproceedings{Gustavsson3486,
author = {Andreas Gustavsson and Jan Gustafsson and Bj{\"o}rn Lisper},
title = {Timing Analysis of Parallel Software Using Abstract Execution},
isbn = {978-3-642-54012-7},
editor = {Kenneth L. McMillan and Xavier Rival},
volume = {15},
pages = {59--77},
month = {January},
year = {2014},
booktitle = {15th International Conference on Verification, Model Checking, and Abstract Interpretation},
publisher = {Springer},
url = {http://www.es.mdh.se/publications/3486-}
}