Filters








244 Hits in 5.5 sec

Merging Techniques for Faster Derivation of WCET Flow Information using Abstract Execution

Jan Gustafsson, Andreas Ermedahl, Marc Herbstritt
2008
This paper present different merging techniques that can be used by AE for trading analysis time for flow information precision.  ...  We have previously introduced abstract execution (AE), a method capable of deriving very precise flow information.  ...  To derive these constraints, AE extends abstract states with recorders, used to collect flow information.  ... 
doi:10.4230/oasics.wcet.2008.1658 fatcat:6gd4mosjufhf3c4udmgcaq4l7m

Evaluation of Automatic Flow Analysis for WCET Calculation on Industrial Real-Time System Code

Dani Barkah, Andreas Ermedahl, Jan Gustafsson, Björn Lisper, Christer Sandberg
2008 2008 Euromicro Conference on Real-Time Systems  
A static Worst-Case Execution Time (WCET) analysis derives upper bounds for the execution times of programs. Such analysis requires information about the possible program flows.  ...  The same code was the subject of an earlier WCET case study, where it was analysed using manual annotations for the flow information.  ...  direct comparison of the WCET estimates calculated using automatically derived flow information, and using manually derived flow information from [37] respectively. • We identify some problems arising  ... 
doi:10.1109/ecrts.2008.37 dblp:conf/ecrts/BarkahEGLS08 fatcat:ty3pguvomfhsxkn6nk6monuwg4

The Auspicious Couple: Symbolic Execution and WCET Analysis

Armin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr, Marc Herbstritt
2013 Worst-Case Execution Time Analysis  
In this article we describe how use-cases of symbolic execution are materialized in the r-TuBound tool and present new applications of WCET-guided symbolic execution for WCET analysis.  ...  We have recently shown that symbolic execution together with the implicit path enumeration technique can successfully be applied for the Worst-Case Execution Time (WCET) analysis of programs.  ...  In the traditional use of static WCET analyzers, high-level tools gather flow fact information about the program under analysis.  ... 
doi:10.4230/oasics.wcet.2013.53 dblp:conf/wcet/BiereKKZ13 fatcat:a6tl7qtp6ffmzljyjlxvlwuxl4

WCET Analysis of Data Dependent, Component Oriented, Embedded Software Systems

Peter Szulman
2009 Electronical Notes in Theoretical Computer Science  
We use abstract interpretation for this purpose. In this paper we show how this approach can be applied to an example taken from the domain of programmable logic controllers.  ...  In this paper we deal with the problem of analyzing data flow -control flow dependencies between components with the goal of getting tight and safe WCET predictions.  ...  Conclusion and Future Work We showed in this paper how data flow -control flow dependencies between components can be analyzed using abstract interpretation.  ... 
doi:10.1016/j.entcs.2009.03.027 fatcat:lem3hpzvnneq3bdcka6rtq3rea

WCET squeezing

Jens Knoop, Laura Kovács, Jakob Zwirchmayr
2013 Proceedings of the 21st International conference on Real-Time Networks and Systems - RTNS '13  
WCET Squeezing combines symbolic program execution with the Implicit Path Enumeration Technique (IPET) for computing a precise WCET bound.  ...  Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted.  ...  To this end, our symbolic execution engine could be replaced by other techniques, for example by the method of [19] , for deriving input values for executed paths.  ... 
doi:10.1145/2516821.2516847 dblp:conf/rtns/KnoopKZ13 fatcat:l7fpgga4djh4noetjb5rckclgi

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

Reinhard Wilhelm, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter Puschner, Jan Staschulat, Per Stenström, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David Whalley (+3 others)
2008 ACM Transactions on Embedded Computing Systems  
The determination of upper bounds on execution times, commonly called worst-case execution times (WCETs), is a necessary step in the development and validation process for hard real-time systems.  ...  The central technique of the hybrid timinganalysis tool is the automatic test data generation used to derive a WCET estimate by means of execution time measurements.  ...  Abstraction loses information, so the computed WCET bound usually overestimates the exact WCET and vice versa for the BCET.  ... 
doi:10.1145/1347375.1347389 fatcat:lxqtkxuaijcnlb6wy7suu7pdmq

Reducing the Size of the Constraint Model in Implicit Path Enumeration Using Super Blocks

Adam Betts
2012 2012 IEEE 33rd Real-Time Systems Symposium  
Implicit Path Enumeration (IPE) is the most popular calculation technique used in WCET analysis as it generally provides the most precision.  ...  detract from the precision of the WCET estimate.  ...  The SB-CFG allows us to deduce this information: For illustrative purposes, let us apply this theorem to the problematic CFG.  ... 
doi:10.1109/rtss.2012.88 dblp:conf/rtss/Betts12 fatcat:lamw7lebirh3xcahu7w7gu2fqu

Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution

Jens Knoop, Laura Kovács, Jakob Zwirchmayr
2017 Journal of symbolic computation  
Our experimental results underline the advantage of using symbolic methods for proving WCET bounds precise, at a moderate cost.  ...  This requires to compute a safe and tight bound for the execution time of a program.  ...  We also acknowledge support of this research by the EU FP7 COST Action IC 1202 Timing Analysis on Code-Level (TACLe).  ... 
doi:10.1016/j.jsc.2016.07.023 fatcat:q6ryk5iwdvhc3gi56zzo5hun2q

Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors: a comeback of model checking

Martin Becker, Ravindra Metta, R. Venkatesh, Samarjit Chakraborty
2018 International Journal on Software Tools for Technology Transfer (STTT)  
Estimating the Worst-Case Execution Time (WCET) of an application is an essential task in the context of developing real-time or safety-critical software, but it is also a complex and error-prone process  ...  In this article we show how all of these issues can be significantly mitigated or even solved, if we use processors that are amenable to WCET analysis.  ...  [41] show automatic derivation of exact program flow constraints for WCET computation using Model Checking for hypothesis validation.  ... 
doi:10.1007/s10009-018-0497-2 fatcat:nb4pxjkybnbifo32gobb2so3my

Bus-Aware Multicore WCET Analysis through TDMA Offset Bounds

Timon Kelter, Heiko Falk, Peter Marwedel, Sudipta Chattopadhyay, Abhik Roychoudhury
2011 2011 23rd Euromicro Conference on Real-Time Systems  
Static analyses of the WCET (Worst-Case Execution Time) have proven to be a key element for timing analysis, as they provide safe upper bounds on a program's execution time.  ...  In this paper, we propose a new technique for analyzing the duration of accesses to shared buses.  ...  The data flow analysis requires a function u which updates the computed state after the execution of a basic block b and a function m which merges the states at control flow joins in the control flow graph  ... 
doi:10.1109/ecrts.2011.9 dblp:conf/ecrts/KelterFMCR11 fatcat:lxkfioq4vzh5tgdff4dgrd7iq4

Pipeline Modeling for Timing Analysis [chapter]

Marc Langenbach, Stephan Thesing, Reinhold Heckmann
2002 Lecture Notes in Computer Science  
The emphasis of this paper is on the modeling of the pipeline behavior as input to the derivation of a pipeline analysis.  ...  We apply static program analysis methods to determine an upper bound for the WCET.  ...  All existing techniques for schedulability analysis require as input the worst-case execution time (WCET) of each task of the system.  ... 
doi:10.1007/3-540-45789-5_22 fatcat:jpnzqddkpfdh5krowlhspsdiei

Traceability of Flow Information

Hanbing Li, Isabelle Puaut, Erven Rohou
2014 Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS '14  
To be useful, WCET estimates have to be as tight as possible. Information on possible flows of control (the so-called flow information) improves the tightness of WCET estimates.  ...  Between these two levels, compiler optimizations may have a dramatic effect on the structure of the code, resulting in a loss of useful information.  ...  Acknowledgments The research was funded by W-SEPT 5 , a collaborative research project focusing on identification and traceability of semantic information for worst-case execution time estimation.  ... 
doi:10.1145/2659787.2659805 dblp:conf/rtns/LiPR14 fatcat:h2t3e5lgmnaatlsoqa7sl74zke

Virtual simple architecture (VISA)

Aravindh Anantaraman, Kiran Seth, Kaustubh Patil, Eric Rotenberg, Frank Mueller
2003 Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03  
Worst-case execution times (WCET) of tasks are needed for safe planning.  ...  The benefit of using a high-performance processor is that tasks finish much sooner than they would have on an explicitly-safe processor.  ...  A static cache simulator uses the control flow information to construct a control-flow graph of the program that consists of the call graph and the control-flow graph of each function [2, 23] .  ... 
doi:10.1145/859658.859659 fatcat:uj4noou2hfhfzhkmkvz2lkk224

Virtual simple architecture (VISA)

Aravindh Anantaraman, Kiran Seth, Kaustubh Patil, Eric Rotenberg, Frank Mueller
2003 Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03  
Worst-case execution times (WCET) of tasks are needed for safe planning.  ...  The benefit of using a high-performance processor is that tasks finish much sooner than they would have on an explicitly-safe processor.  ...  A static cache simulator uses the control flow information to construct a control-flow graph of the program that consists of the call graph and the control-flow graph of each function [2, 23] .  ... 
doi:10.1145/859618.859659 fatcat:hbgvx4pnzvh3fcxl62k67uofqm

Virtual simple architecture (VISA)

Aravindh Anantaraman, Kiran Seth, Kaustubh Patil, Eric Rotenberg, Frank Mueller
2003 SIGARCH Computer Architecture News  
Worst-case execution times (WCET) of tasks are needed for safe planning.  ...  The benefit of using a high-performance processor is that tasks finish much sooner than they would have on an explicitly-safe processor.  ...  A static cache simulator uses the control flow information to construct a control-flow graph of the program that consists of the call graph and the control-flow graph of each function [2, 23] .  ... 
doi:10.1145/871656.859659 fatcat:3mv3d4ddnnguzn33wkonbku2na
« Previous Showing results 1 — 15 out of 244 results