Towards a Flow Analysis for Embedded System C Programs

Gustafsson, Jan; Ermedahl, Andreas; Lisper, Björn

doi:10.1109/words.2005.53

Cited by 23 publications

(28 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The pattern matching uses the results of a value analysis. For more complex loop constructs, an abstract interpretation-based method is used [Gus00,GEL05]. The analysis is performed on the intermediate code level.…”

Section: Control-flow Analysismentioning

confidence: 99%

The worst-case execution-time problem—overview of methods and survey of tools

Wilhelm

Engblom²,

Ermedahl

et al. 2008

ACM Trans. Embed. Comput. Syst.

1,470

1,029

View full text Add to dashboard Cite

Abstract. The determination of upper bounds on execution times, commonly called WorstCase Execution Times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying processor architecture has components such as caches, pipelines, branch prediction, and other speculative components. This article describes different approaches to this problem and surveys several commercially available tools and research prototypes.

show abstract

Section: Control-flow Analysismentioning

confidence: 99%

The worst-case execution-time problem—overview of methods and survey of tools

Wilhelm

Engblom²,

Ermedahl

et al. 2008

ACM Trans. Embed. Comput. Syst.

1,470

1,029

View full text Add to dashboard Cite

show abstract

“…However, most of this work is aimed at real-time systems, not transactional concurrency control which is the main concern of our work. A number of frameworks are available for WCET analysis, like aiT [4], Bound-T [10], SWEET [7], and SymTA/P [20]. A comprehensive survey of these tools and methods was done in [25].…”

Section: Related Workmentioning

confidence: 99%

“…This is done, among others, by the use of Presburger arithmetic [17], path analysis (using integer linear programming) [21], or a combination of methods involving abstract interpretation [3]. Our work touches on those concerns in Section 3.2 where we use loop unfolding to establish their bounds roughly similar to that of SWEET [7] but simpler. WCET tools additionally often use the Implicit Path Enumeration technique [12] or single feasible paths [28] to establish worstcase paths and perform final timing analyses.…”

Section: Related Workmentioning

confidence: 99%

A Formal Design of a Tool for Static Analysis of Upper Bounds on Object Calls in Java

Siek

Wojciechowski

2012

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

Abstract. This paper presents a formal design of a tool for statically establishing the upper bound on the number of executions of objects' methods in a fragment of object-oriented code. The algorithm that our tool employs is a multi-pass interprocedural analysis consisting of data flow and region-based analyses. We describe the formalization of each of stage of the algorithm. This rigorous specification greatly aids the implementation of the tool by removing ambiguities of textual descriptions. There are many applications for information obtained through this method including reasoning about concurrent code, scheduling, code optimization, compositing services, etc.We concentrate on using upper bounds to instrument transactional code that uses a synchronization mechanism based on versioning, and therefore benefits from a priori knowledge about the usage of shared objects within each transaction. To this end we implement a precompiler for Java that analyzes transactions, and injects generated source code to initialize each transaction.

show abstract

“…However, our abstract execution uses a more detailed value domain (see e.g., [12]) and is based on an abstract interpretation framework.…”

Section: Infeasible Pathsmentioning

confidence: 99%

Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution

Gustafsson

Ermedahl

Sandberg

et al. 2006

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)

155

117

View full text Add to dashboard Cite

Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component for statically deriving safe and tight WCET bounds is information on the possible program flow through the program. Such flow information can be provided manually by user annotations, or automatically by a flow analysis. To make WCET analysis as simple and safe as possible, it should preferably be automatically derived, with no or very limited user interaction.In this paper we present a method for deriving such flow information called abstract execution. This method can automatically calculate loop bounds, bounds for including nested loops, as well as many types of infeasible paths. Our evaluations show that it can calculate WCET estimates automatically, without any user annotations, for a range of benchmark programs, and that our techniques for nested loops and infeasible paths sometimes can give substantially better WCET estimates than using loop bounds analysis only.

show abstract

Towards a Flow Analysis for Embedded System C Programs

Abstract: Abstract

Cited by 23 publications

References 19 publications

The worst-case execution-time problem—overview of methods and survey of tools

The worst-case execution-time problem—overview of methods and survey of tools

A Formal Design of a Tool for Static Analysis of Upper Bounds on Object Calls in Java

Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution

Contact Info

Product

Resources

About