{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:39:40Z","timestamp":1759333180755},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642540127"},{"type":"electronic","value":"9783642540134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54013-4_2","type":"book-chapter","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T01:08:09Z","timestamp":1388711289000},"page":"21-38","source":"Crossref","is-referenced-by-count":11,"title":["Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs"],"prefix":"10.1007","author":[{"given":"Martin D.","family":"Schwarz","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Vesal","family":"Vojdani","sequence":"additional","affiliation":[]},{"given":"Kalmer","family":"Apinis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Autosar consortium: Autosar Architecture Specification, Release 4.0 (2009), \n                  \n                    http:\/\/www.autosar.org\/"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: Path-sensitive program verification in polynomial time. In: PLDI 2002, pp. 57\u201368. ACM Press (2002)","DOI":"10.1145\/512529.512538"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-73368-3_26","volume-title":"Computer Aided Verification","author":"V. Kahlon","year":"2007","unstructured":"Kahlon, V., Yang, Y., Sankaranarayanan, S., Gupta, A.: Fast and accurate static data-race detection for concurrent programs. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 226\u2013239. Springer, Heidelberg (2007)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-16164-3_18","volume-title":"Model Checking Software","author":"N. Kidd","year":"2010","unstructured":"Kidd, N., Jagannathan, S., Vitek, J.: One stack to run them all \u2014 reducing concurrent analysis to sequential analysis under priority scheduling. In: van de Pol, J., Weber, M. (eds.) SPIN 2010. LNCS, vol.\u00a06349, pp. 245\u2013261. Springer, Heidelberg (2010)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: POPL 1973, pp. 194\u2013206. ACM Press (1973)","DOI":"10.1145\/512927.512945"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-55984-1_13","volume-title":"Compiler Construction","author":"J. Knoop","year":"1992","unstructured":"Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In: Pfahler, P., Kastens, U. (eds.) CC 1992. LNCS, vol.\u00a0641, pp. 125\u2013140. Springer, Heidelberg (1992)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-19718-5_21","volume-title":"Programming Languages and Systems","author":"A. Min\u00e9","year":"2011","unstructured":"Min\u00e9, A.: Static analysis of run-time errors in embedded critical parallel C programs. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol.\u00a06602, pp. 398\u2013418. Springer, Heidelberg (2011)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: POPL 2004, pp. 330\u2013341. ACM Press (2004)","DOI":"10.1145\/982962.964029"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Naik, M., Aiken, A., Whaley, J.: Effective static race detection for Java. In: PLDI 2006, pp. 308\u2013319. ACM Press (2006)","DOI":"10.1145\/1133981.1134018"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Naik, M., Aiken, A.: Conditional must not aliasing for static race detection. In: POPL 2007, pp. 327\u2013338. ACM Press (2007)","DOI":"10.1145\/1190215.1190265"},{"key":"2_CR11","unstructured":"OSEK\/VDX Group: OSEK\/VDX Operating System Specification, Version 2.2.3 (2005), \n                  \n                    http:\/\/www.osek-vdx.org"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11823230_7","volume-title":"Static Analysis","author":"P. Pratikakis","year":"2006","unstructured":"Pratikakis, P., Foster, J.S., Hicks, M.W.: Existential label flow inference via CFL reachability. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 88\u2013106. Springer, Heidelberg (2006)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Pratikakis, P., Foster, J.S., Hicks, M.: Locksmith: Context-sensitive correlation analysis for detecting races. In: PLDI 2006, pp. 320\u2013331. ACM Press (2006)","DOI":"10.1145\/1133981.1134019"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Sack, P., Bliss, B.E., Ma, Z., Petersen, P., Torrellas, J.: Accurate and efficient filtering for the intel thread checker race detector. In: ASID 2006, pp. 34\u201341. ACM Press (2006)","DOI":"10.1145\/1181309.1181315"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Schwarz, M.D., Seidl, H., Vojdani, V., Lammich, P., M\u00fcller-Olm, M.: Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. In: POPL 2011. ACM Press (2011)","DOI":"10.1145\/1926385.1926398"},{"issue":"9","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/12.57058","volume":"39","author":"L. Sha","year":"1990","unstructured":"Sha, L., Rajkumar, R., Lehoczky, J.P.: Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans. Comput.\u00a039(9), 1175\u20131185 (1990)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR17","unstructured":"Chikamasa, T., et al.: OSEK platform for lego\u00ae mindstorms\u00ae (2010), \n                  \n                    http:\/\/lejos-osek.sourceforge.net\/"},{"key":"2_CR18","first-page":"141","volume":"30","author":"V. Vojdani","year":"2009","unstructured":"Vojdani, V., Vene, V.: Goblint: Path-sensitive data race analysis. Annales Univ. Sci. Budapest., Sect. Comp.\u00a030, 141\u2013155 (2009)","journal-title":"Annales Univ. Sci. Budapest., Sect. Comp."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Voung, J.W., Jhala, R., Lerner, S.: RELAY: static race detection on millions of lines of code. In: ESEC\/FSE 2007, pp. 205\u2013214. ACM Press (2007)","DOI":"10.1145\/1287624.1287654"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M.N. Wegman","year":"1991","unstructured":"Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst.\u00a013, 181\u2013210 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54013-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T23:49:58Z","timestamp":1558828198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54013-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642540127","9783642540134"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54013-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}