Abstract
In order to ensure that timing constrains are met for a Real-Time Systems, a bound of the Worst-Case Execution Time (WCET) of each part of the system must be known. Current WCET computation methods are applied on whole programs which means that all the source code should be available. However, more and more, embedded software uses COTS (Components ...), often afforded only as a binary code. Partialisation is a way to solve this problem.
In general, static WCET analysis uses upper bound on the number of loop iterations. oRange is our method and its associated tool which provide mainly loop bound values or equations and other flow facts information. In this article, we present how we can do partial flow analysis with oRange in order to obtain component partial results. These partial results can be used, in order to compute the flow analysis in the context of a full application. Additionally, we show that the partial analysis enables us to reduce the analysis time while introducing very little pessimism.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Otawa, http://www.otawa.fr
Bound-t tool (2005), http://www.tidorum.fi/bound-t/
ait tool (2007), http://www.absint.com
Merasa (2007), http://ginkgo.informatik.uni-augsburg.de/merasa-web/
Wcet project (2007), http://www.mrtc.mdh.se/projects/wcet/
Ballabriga, C., Cassé, H., De Michiel, M.: A generic framework for blackbox components in wcet computation. In: 9th Intl. Workshop on Worst-Case Execution Time Analysis, WCET 2009, Dublin, Ireland (2009)
Coffman, J., Healy, C.A., Mueller, F., Whalley, D.B.: Generalizing parametric timing analysis. In: Pande, S., Li, Z. (eds.) LCTES, pp. 152–154. ACM, New York (2007)
Cullmann, C., Martin, F.: Data-flow based detection of loop bounds. In: 7th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, Pisa, Italy (2007)
Ermedahl, A., Sandberg, C., Gustafsson, J., Bygde, S., Lisper, B.: Loop bound analysis based on a combination of program slicing, abstract interpretation, and invariant analysis. In: 7th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, Pisa, Italy (2007)
Kirner, M.: Automatic loop bound analysis of programs written in c. Master’s thesis, Technische Universität Wien, Institut für Technische Informatik, Treitlstr. 3/3/182-1, 1040 Vienna, Austria (2006)
Lokuciejewski, P., Cordes, D., Falk, H., Marwedel, P.: A fast and precise static loop analysis based on abstract interpretation, program slicing and polytope models. In: Cgo 2009: Proceedings of the 7th International Symposium on Code Generation and Optimization, Washington, DC, USA (2009)
De Michiel, M., Bonenfant, A., Cassé, H., Sainrat, P.: Static loop bound analysis of c programs based on flow analysis and abstract interpretation. In: RTCSA, pp. 161–166. IEEE Computer Society, Los Alamitos (2008)
Prantl, A., Knoop, J., Kirner, R., Kadlec, A., Schordan, M.: From trusted annotations to verified knowledge. In: Holsti, N. (ed.) WCET. Dagstuhl Seminar Proceedings, vol. 09004, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Michiel, M., Bonenfant, A., Ballabriga, C., Cassé, H. (2010). Partial Flow Analysis with oRange. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification, and Validation. ISoLA 2010. Lecture Notes in Computer Science, vol 6416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16561-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-16561-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16560-3
Online ISBN: 978-3-642-16561-0
eBook Packages: Computer ScienceComputer Science (R0)