Abstract
AbstractWe consider the problem of statically detecting data races in periodic real-time programs that use locks, and run on a single processor platform. We propose a technique based on a small set of rules that exploits the priority, periodicity, locking, and timing information of tasks in the program. One of the key requirements is a response time analysis for such programs, and we propose an algorithm to compute this for the case of non-nested locks. We have implemented our analysis for real-time programs written in C in a tool called PePRacer and evaluated its performance on a small set of benchmarks from the literature.
Publisher
Springer International Publishing
Reference21 articles.
1. OpenAADL/AADLib - a library of AADL components (2011), https://github.com/OpenAADL/AADLib
2. nxtOSEK/JSP: RTOS for Lego MindStorms NXT (2013), http://lejos-osek.sourceforge.net/
3. Baruah, S.K.: Resource sharing in edf-scheduled systems: A Closer Look. In: Proc. 27th IEEE Real-Time Systems Symposium (RTSS), 5-8 December, Rio de Janeiro, Brazil. pp. 379–387. IEEE Computer Society (2006)
4. Baruah, S.K., Rosier, L.E., Howell, R.R.: Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. Real Time Syst. 2(4), 301–324 (1990)
5. Bertogna, M., Fisher, N., Baruah, S.K.: Resource holding times: computation and optimization. Real Time Syst. 41(2), 87–117 (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献