{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:03Z","timestamp":1772164023405,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,1,26]]},"DOI":"10.1145\/1926385.1926398","type":"proceedings-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T09:58:22Z","timestamp":1295863102000},"page":"93-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol"],"prefix":"10.1145","author":[{"given":"Martin D.","family":"Schwarz","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}]},{"given":"Vesal","family":"Vojdani","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}]},{"given":"Peter","family":"Lammich","sequence":"additional","affiliation":[{"name":"Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster, M\u00fcnster, Germany"}]},{"given":"Markus","family":"M\u00fcller-Olm","sequence":"additional","affiliation":[{"name":"Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster, M\u00fcnster, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"e_1_3_2_2_1_1","series-title":"LNCS","first-page":"150","volume-title":"ATVA'04","author":"Artho C.","year":"2004","unstructured":"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 . 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."},{"key":"e_1_3_2_2_2_1","series-title":"LIPIcs","first-page":"37","volume-title":"FSTTCS'08","author":"Atig M. F.","year":"2008","unstructured":"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 . 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."},{"key":"e_1_3_2_2_3_1","volume-title":"Release 4.0","year":"2009","unstructured":"Autosar consortium. Autosar Architecture Specification , Release 4.0 , 2009 . URL http:\/\/www.autosar.org\/. Autosar consortium. Autosar Architecture Specification, Release 4.0, 2009. URL http:\/\/www.autosar.org\/."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00365393"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_36"},{"key":"e_1_3_2_2_6_1","first-page":"269","volume-title":"PLILP'92","author":"Cousot P.","year":"1992","unstructured":"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 . 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."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1890629.1890649"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325697"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00009-X"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.006"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377492.1377495"},{"key":"e_1_3_2_2_12_1","volume-title":"Flow Analysis of Computer Programs","author":"Hecht M. S.","year":"1977","unstructured":"M. S. Hecht . Flow Analysis of Computer Programs . Elsevier , 1977 . M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, 1977."},{"key":"e_1_3_2_2_13_1","volume-title":"SafeCert'09","author":"Henties T.","year":"2010","unstructured":"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 . 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."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190262"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_49"},{"key":"e_1_3_2_2_16_1","series-title":"LNCS","first-page":"226","volume-title":"CAV'07","author":"Kahlon V.","year":"2007","unstructured":"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 . 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."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02652-2_12"},{"key":"e_1_3_2_2_18_1","series-title":"LNCS","first-page":"245","volume-title":"SPIN'10","author":"Kidd N.","year":"2010","unstructured":"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 . 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."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69166-2_14"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_39"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964029"},{"key":"e_1_3_2_2_22_1","unstructured":"OSEK\/VDX Group. OSEK\/VDX Operating System Specification Version 2.2.3 2005. URL http:\/\/www.osek-vdx.org.  OSEK\/VDX Group. OSEK\/VDX Operating System Specification Version 2.2.3 2005. URL http:\/\/www.osek-vdx.org."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1049\/sej.1990.0029"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/349214.349241"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.04.002"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1113830.1113833"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.57058"},{"key":"e_1_3_2_2_28_1","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"Sharir M.","year":"1981","unstructured":"M. Sharir and A. Pnueli . Two approaches to interprocedural data flow analysis . Program Flow Analysis: Theory and Applications , pp. 189 -- 234 , 1981 . M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. Program Flow Analysis: Theory and Applications, pp. 189--234, 1981."},{"key":"e_1_3_2_2_29_1","volume-title":"OSEK platform for LEGO MINDSTORMS","year":"2010","unstructured":"Takashi Chikamasa OSEK platform for LEGO MINDSTORMS 2010 . URL http:\/\/lejos-osek.sourceforge.net\/. Takashi Chikamasa et al. OSEK platform for LEGO MINDSTORMS 2010. URL http:\/\/lejos-osek.sourceforge.net\/."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111067"},{"key":"e_1_3_2_2_31_1","first-page":"141","article-title":"Goblint: Path-sensitive data race analysis. Annales Univ. Sci. Budapest","volume":"30","author":"Vojdani V.","year":"2009","unstructured":"V. Vojdani and V. Vene . Goblint: Path-sensitive data race analysis. Annales Univ. Sci. Budapest ., Sect. Comp. , 30 : 141 -- 155 , 2009 . V. Vojdani and V. Vene. Goblint: Path-sensitive data race analysis. Annales Univ. Sci. Budapest., Sect. Comp., 30:141--155, 2009.","journal-title":"Sect. Comp."}],"event":{"name":"POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Austin Texas USA","acronym":"POPL '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1926385.1926398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:59:51Z","timestamp":1750229991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":31,"alternative-id":["10.1145\/1926385.1926398","10.1145\/1926385"],"URL":"https:\/\/doi.org\/10.1145\/1926385.1926398","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1925844.1926398","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,1,26]]},"assertion":[{"value":"2011-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}