research-article

Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol

Authors:

Martin D. Schwarz,

Markus Müller-OlmAuthors Info & Claims

POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 93 - 104

https://doi.org/10.1145/1926385.1926398

Published: 26 January 2011 Publication History

Abstract

We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling priority protocol. For these programs, we provide static analyses for detecting data races between tasks running at different priorities as well as methods to guarantee transactional execution of procedures. Beyond that, we demonstrate how general techniques for value analyses can be adapted to this setting by developing a precise analysis of affine equalities.

Supplementary Material

MP4 File (10-mpeg-4.mp4)

Download
357.22 MB

References

[1]

C. Artho, K. Havelund, and A. Biere. Using block-local atomicity to detect stale-value concurrency errors. In ATVA'04, vol. 3299 of LNCS, pp. 150--164. Springer, 2004.

[2]

M. F. Atig, A. Bouajjani, and T. Touili. Analyzing asynchronous programs with preemption. In FSTTCS'08, vol. 2 of LIPIcs, pp. 37--48. Schloss Dagstuhl, 2008.

[3]

Autosar consortium. Autosar Architecture Specification, Release 4.0, 2009. URL http://www.autosar.org/.

[4]

T. P. Baker. Stack-based scheduling of realtime processes. Real-Time Systems, 3(1):67--99, 1991.

Digital Library

[5]

A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In CONCUR'05, vol. 3653 of LNCS, pp. 473--487. Springer, 2005.

Digital Library

[6]

P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, invited paper. In PLILP'92, pp. 269--295. Springer, 1992.

Digital Library

[7]

B. Dutertre. Formal analysis of the priority ceiling protocol. In RTSS'00, pp. 151--160. IEEE Press, 2000.

Digital Library

[8]

J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In POPL'00, pp. 1--11. ACM Press, 2000.

Digital Library

[9]

C. Fecht and H. Seidl. A Faster Solver for General Systems of Equations. Sci. Comput. Programming, 35(2):137--161, 1999.

Digital Library

[10]

C. Flanagan, S. N. Freund, S. Qadeer, and S. A. Seshia. Modular verification of multithreaded programs. Theoretical Comput. Sci., 338 (1--3):153--183, 2005.

Digital Library

[11]

C. Flanagan, S. N. Freund, M. Lifshin, and S. Qadeer. Types for atomicity: Static checking and inference for java. ACM Trans. Prog. Lang. Syst., 30(4):1--53, 2008.

Digital Library

[12]

M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, 1977.

Digital Library

[13]

T. Henties, J. J. Hunt, D. Locke, K. Nilsen,M. Schoeberl, and J. Vitek. Java for safety-critical applications. In SafeCert'09, ENTCS. Elsevier, 2010.

[14]

V. Kahlon and A. Gupta. On the analysis of interacting pushdown systems. In POPL'07, pp. 303--314. ACM Press, 2007.

Digital Library

[15]

V. Kahlon, F. Ivančić, and A. Gupta. Reasoning about threads communicating via locks. In CAV'05, vol. 3576 of LNCS, pp. 505--518. Springer, 2005.

Digital Library

[16]

V. Kahlon, Y. Yang, S. Sankaranarayanan, and A. Gupta. Fast and accurate static data-race detection for concurrent programs. In CAV'07, vol. 4590 of LNCS, pp. 226--239. Springer, 2007.

Digital Library

[17]

N. Kidd, P. Lammich, T. Touili, and T. Reps. A decision procedure for detecting atomicity violations for communicating processes with locks. In SPIN'09, vol. 5578 of LNCS, pp. 125--142. Springer, 2009.

Digital Library

[18]

N. Kidd, S. Jagannathan, and J. Vitek. One stack to run them all reducing concurrent analysis to sequential analysis under priority scheduling. In SPIN'10, vol. 6349 of LNCS, pp. 245--261. Springer, 2010.

Digital Library

[19]

P. Lammich and M. Müller-Olm. Conflict analysis of programs with procedures, dynamic thread creation, and monitors. In SAS'08, vol. 5079 of LNCS, pp. 205--220. Springer, 2008.

Digital Library

[20]

P. Lammich, M. Müller-Olm, and A. Wenner. Predecessor sets of dynamic pushdown networks with Tree-Regular constraints. In CAV'09, vol. 5643 of LNCS, pp. 525--539. Springer, 2009.

Digital Library

[21]

M. Müller-Olm and H. Seidl. Precise interprocedural analysis through linear algebra. In POPL'04, pp. 330--341. ACM Press, 2004.

Digital Library

[22]

OSEK/VDX Group. OSEK/VDX Operating System Specification, Version 2.2.3, 2005. URL http://www.osek-vdx.org.

[23]

M. Pilling, A. Burns, and K. Raymond. Formal specifications and proofs of inheritance protocols for real-time scheduling. Softw. Eng. J., 5(5):263--279, 1990.

Digital Library

[24]

G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Prog. Lang. Syst., 22(2):416--430, 2000.

Digital Library

[25]

J. Regehr and N. Cooprider. Interrupt verification via thread verification. ENTCS, 174(9):139--150, 2007.

Digital Library

[26]

J. Regehr, A. Reid, and K. Webb. Eliminating stack overflow by abstract interpretation. ACM Trans. Embedded Comput. Syst., 4(4): 751--778, 2005.

Digital Library

[27]

L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans. Comput., 39(9):1175--1185, Sept. 1990.

Digital Library

[28]

M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. Program Flow Analysis: Theory and Applications, pp. 189--234, 1981.

[29]

Takashi Chikamasa et al. OSEK platform for LEGO MINDSTORMS 2010. URL http://lejos-osek.sourceforge.net/.

[30]

M. Vaziri, F. Tip, and J. Dolby. Associating synchronization constraints with data in an object-oriented language. In POPL'06, pp. 334--345. ACM Press, 2006.

Digital Library

[31]

V. Vojdani and V. Vene. Goblint: Path-sensitive data race analysis. Annales Univ. Sci. Budapest., Sect. Comp., 30:141--155, 2009.

Cited By

Ashraf AD’Souza M(2023)Static Data Race Detection in Multi-task Programs for Industrial RobotsDistributed Computing and Intelligent Technology10.1007/978-3-031-24848-1_4(51-66)Online publication date: 18-Jan-2023
https://dl.acm.org/doi/10.1007/978-3-031-24848-1_4
Suresh VPai RD’Souza DD’Souza MChakrabarti S(2022)Static Race Detection for Periodic ProgramsProgramming Languages and Systems10.1007/978-3-030-99336-8_11(290-316)Online publication date: 29-Mar-2022
https://doi.org/10.1007/978-3-030-99336-8_11
Du XYin LFeng HDong W(2021)Program Verification Enhanced Precise Analysis of Interrupt-Driven Program Vulnerabilities2021 28th Asia-Pacific Software Engineering Conference (APSEC)10.1109/APSEC53868.2021.00033(253-263)Online publication date: Dec-2021
https://doi.org/10.1109/APSEC53868.2021.00033
Show More Cited By

Index Terms

Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol

Recommendations

Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
POPL '11

We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling priority protocol. For these programs, we provide static analyses for ...
Numerical static analysis of interrupt-driven programs via sequentialization
EMSOFT '15: Proceedings of the 12th International Conference on Embedded Software

Embedded software often involves intensive numerical computations and thus can contain a number of numerical run-time errors. The technique of numerical static analysis is of practical importance for checking the correctness of embedded software. ...
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2011

652 pages

ISBN:9781450304900

DOI:10.1145/1926385

General Chair:
Thomas Ball
Microsoft Research, USA
,
Program Chair:
Mooly Sagiv
Tel Aviv University, Israel

ACM SIGPLAN Notices Volume 46, Issue 1
POPL '11
January 2011
624 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1925844
Issue’s Table of Contents

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 January 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

POPL '11

Sponsor:

SIGPLAN

POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 26 - 28, 2011

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 860 of 4,328 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
556
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ashraf AD’Souza M(2023)Static Data Race Detection in Multi-task Programs for Industrial RobotsDistributed Computing and Intelligent Technology10.1007/978-3-031-24848-1_4(51-66)Online publication date: 18-Jan-2023
https://dl.acm.org/doi/10.1007/978-3-031-24848-1_4
Suresh VPai RD’Souza DD’Souza MChakrabarti S(2022)Static Race Detection for Periodic ProgramsProgramming Languages and Systems10.1007/978-3-030-99336-8_11(290-316)Online publication date: 29-Mar-2022
https://doi.org/10.1007/978-3-030-99336-8_11
Du XYin LFeng HDong W(2021)Program Verification Enhanced Precise Analysis of Interrupt-Driven Program Vulnerabilities2021 28th Asia-Pacific Software Engineering Conference (APSEC)10.1109/APSEC53868.2021.00033(253-263)Online publication date: Dec-2021
https://doi.org/10.1109/APSEC53868.2021.00033
Pai RSingh AD’Souza DD’Souza MPrakash P(2021)Static analysis for detecting high-level races in RTOS kernelsFormal Methods in System Design10.1007/s10703-020-00354-058:1-2(294-321)Online publication date: 8-Jan-2021
https://doi.org/10.1007/s10703-020-00354-0
Pan MChen SPei YZhang TLi XAtlee JBultan TWhittle J(2019)Easy modelling and verification of unpredictable and preemptive interrupt-driven systemsProceedings of the 41st International Conference on Software Engineering10.1109/ICSE.2019.00037(212-222)Online publication date: 25-May-2019
https://dl.acm.org/doi/10.1109/ICSE.2019.00037
Esparza JMuscholl AWalukiewicz IAceto LIngólfsdóttir A(2017)Static analysis of deterministic negotiationsProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330079(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330079
Sung CKusano MWang CRosu GDi Penta MNguyen T(2017)Modular verification of interrupt-driven softwareProceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering10.5555/3155562.3155592(206-216)Online publication date: 30-Oct-2017
https://dl.acm.org/doi/10.5555/3155562.3155592
Esparza JMuscholl AWalukiewicz I(2017)Static analysis of deterministic negotiations2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS.2017.8005144(1-12)Online publication date: Jun-2017
https://doi.org/10.1109/LICS.2017.8005144
Sung CKusano MWang C(2017)Modular verification of interrupt-driven software2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)10.1109/ASE.2017.8115634(206-216)Online publication date: Oct-2017
https://doi.org/10.1109/ASE.2017.8115634
Seidl HVogler R(2017)Proving Absence of Starvation by Means of Abstract Interpretation and Model CheckingAutomated Technology for Verification and Analysis10.1007/978-3-319-68167-2_1(3-22)Online publication date: 27-Sep-2017
https://doi.org/10.1007/978-3-319-68167-2_1
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten