Symbolic Loop Bound Computation for WCET Analysis

Knoop, Jens; Kovács, Laura; Zwirchmayr, Jakob

doi:10.1007/978-3-642-29709-0_20

Cited by 32 publications

(24 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cost analysis A potential future application for our work is cost and resource analysis. Instances of this type of analyses are worst case execution time (WCET) analysis [Wilhelm et al 2008;Knoop et al 2011;Knoop et al 2012], as well as bound and amortised complexity analysis [Alias et al 2010;Albert et al 2012;Sinn et al 2014;Flores-Montoya and Hähnle 2014;Brockschmidt et al 2016]. A symbolic bound is calculated by expressing the complexity function as a system of recurrence relations; combinatorial techniques are then used to solve these relations.…”

Section: I S T X ;mentioning

confidence: 99%

“…A symbolic bound is calculated by expressing the complexity function as a system of recurrence relations; combinatorial techniques are then used to solve these relations. Automatic techniques for computing closed-form solutions of recurrence relations are based on rewriting rules [Métayer 1988;Rosendahl 1989] or solving difference equations using symbolic algebra manipulation systems [Wegbreit 1975;Knoop et al 2011;Knoop et al 2012]. The control flow refinement approach [Gulwani et al 2009;Chen et al 2013] instruments a program with counters and uses progress invariants to compute worst case or average case bounds.…”

Section: I S T X ;mentioning

confidence: 99%

See 1 more Smart Citation

Bit-Precise Procedure-Modular Termination Analysis

Chen

David

Kroening

et al. 2017

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Non-termination is the root cause of a variety of program bugs, such as hanging programs and denial-ofservice vulnerabilities. This makes an automated analysis that can prove the absence of such bugs highly desirable. To scale termination checks to large systems, an interprocedural termination analysis seems essential. This is a largely unexplored area of research in termination analysis, where most effort has focussed on small but difficult single-procedure problems.We present a modular termination analysis for C programs using template-based interprocedural summarisation. Our analysis combines a context-sensitive, over-approximating forward analysis with the inference of under-approximating preconditions for termination. Bit-precise termination arguments are synthesised over lexicographic linear ranking function templates. Our experimental results show the advantage of interprocedural reasoning over monolithic analysis in terms of efficiency, while retaining comparable precision.

show abstract

Section: I S T X ;mentioning

confidence: 99%

Section: I S T X ;mentioning

confidence: 99%

Bit-Precise Procedure-Modular Termination Analysis

Chen

David

Kroening

et al. 2017

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…These approaches usually employ model checking [15], pattern matching [16], symbolic execution [17,18], abstract interpretation [19], or other techniques to obtain precise loop bounds. For example, Maroneze [20] and Blazy et al [21] proposed a novel approach which has three steps: loop extraction, program slicing and bound calculation.…”

Section: Related Workmentioning

confidence: 99%

Reducing WCET Overestimations by Correcting Errors in Loop Bound Constraints

Meng

2017

Energies

View full text Add to dashboard Cite

Abstract:In order to reduce overestimations of worst-case execution time (WCET), in this article, we firstly report a kind of specific WCET overestimation caused by non-orthogonal nested loops. Then, we propose a novel correction approach which has three basic steps. The first step is to locate the worst-case execution path (WCEP) in the control flow graph and then map it onto source code. The second step is to identify non-orthogonal nested loops from the WCEP by means of an abstract syntax tree. The last step is to recursively calculate the WCET errors caused by the loose loop bound constraints, and then subtract the total errors from the overestimations. The novelty lies in the fact that the WCET correction is only conducted on the non-branching part of WCEP, thus avoiding potential safety risks caused by possible WCEP switches. Experimental results show that our approach reduces the specific WCET overestimation by an average of more than 82%, and 100% of corrected WCET is no less than the actual WCET. Thus, our approach is not only effective but also safe. It will help developers to design energy-efficient and safe real-time systems.

show abstract

“…This includes, for instance, loop and infeasible paths analyses [7,8], cache analysis [9], and path enumeration techniques [10]. There exist several commercial tools, such as aiT 2 and Bound-T 3 , as well as academic implementations, such as SWEET 4 from Mälardalen University.…”

Section: Related Workmentioning

confidence: 99%

“…Although there exists a large body of work in the area of WCET analysis [7,8,9,10,11], surprisingly little has been done with interactive timing analsysis. Previous work addresses fast WCET analysis [12], interactive C code analysis [13], analysis of Java code [14] and timing analysis of Matlab/Simulink models [15].…”

Section: Introductionmentioning

confidence: 99%

Towards Interactive Timing Analysis for Designing Reactive Systems

Fuhrmann¹,

Broman²,

Smyth³

et al. 2014

View full text Add to dashboard Cite

Abstract. Reactive systems are increasingly developed using high-level modeling tools. Such modeling tools may facilitate formal reasoning about concurrent programs, but provide little help when timing-related problems arise and deadlines are missed when running a real system. In these cases, the modeler has typically no information about timing properties and costly parts of the model; there is little or no guidance on how to improve the timing characteristics of the model. In this paper, we propose a design methodology where interactive timing analysis is an integral part of the modeling process. This methodology concerns how to aggregate timing values in a user-friendly manner and how to define timing analysis requests. We also introduce and formalize a new timing analysis interface that is designed for communicating timing information between a high-level modeling tool and a lower-level timing analysis tool.

show abstract

Symbolic Loop Bound Computation for WCET Analysis

Cited by 32 publications

References 15 publications

Bit-Precise Procedure-Modular Termination Analysis

Bit-Precise Procedure-Modular Termination Analysis

Reducing WCET Overestimations by Correcting Errors in Loop Bound Constraints

Towards Interactive Timing Analysis for Designing Reactive Systems

Contact Info

Product

Resources

About