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

Analysing Switch-Case Code with Abstract Execution

Fulltext:


Authors:


Research group:


Publication Type:

Conference/Workshop Paper

Venue:

15th International Workshop on Worst-Case Execution Time Analysis

Publisher:

Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik

DOI:

http://dx.doi.org/10.4230/OASIcs.WCET.2015.85


Abstract

Constructing the control-flow graph (CFG) of machine code is made difficult by dynamic transfers of control (DTC), where the address of the next instruction is computed at run-time. Switch-case statements make compilers generate a large variety of machine-code forms with DTC. Two analysis approaches are commonly used: pattern-matching methods identify predefined instruction patterns to extract the target addresses, while analytical methods try to compute the set of target addresses using a general value-analysis. We tested the abstract execution method of the SWEET tool as a value analysis for switch-case code. SWEET is here used as a plugin to the Bound-T tool: thus our work can also be seen as an experiment in modular tool design, where a general value-analysis tool is used to aid the CFG construction in a WCET analysis tool. We find that the abstract-execution analysis works at least as well as the switch-case analyses in Bound-T itself, which are mostly based on pattern-matching. However, there are still some weaknesses: the abstract domains available in SWEET are not well suited to representing sets of DTC target addresses, which are small but sparse and irregular. Also, in some cases the abstract-execution analysis fails because the used domain is not relational, that is, does not model arithmetic relationships between the values of different variables. Future work will be directed towards the design of abstract domains eliminating these weaknesses.

Bibtex

@inproceedings{Holsti3981,
author = {Niklas Holsti and Jan Gustafsson and Linus K{\"a}llberg and Bj{\"o}rn Lisper},
title = {Analysing Switch-Case Code with Abstract Execution},
editor = {Francisco J. Cazorla},
pages = {85--94},
month = {July},
year = {2015},
booktitle = {15th International Workshop on Worst-Case Execution Time Analysis},
publisher = {Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik},
url = {http://www.es.mdh.se/publications/3981-}
}