{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:15:29Z","timestamp":1773407729976,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319390826","type":"print"},{"value":"9783319390833","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39083-3_10","type":"book-chapter","created":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T08:46:57Z","timestamp":1464598017000},"page":"145-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Kronecker Algebra for Static Analysis of Barriers in Ada"],"prefix":"10.1007","author":[{"given":"Robert","family":"Mittermayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Blieberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aiken, A., Gay, D., Barrier inference. In: POPL, pp. 342\u2013354 (1998)","DOI":"10.1145\/268946.268974"},{"key":"10_CR2","series-title":"Classics in Applied Mathematics","volume-title":"Introduction to Matrix Analysis","author":"R Bellman","year":"1997","unstructured":"Bellman, R.: Introduction to Matrix Analysis. Classics in Applied Mathematics, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (1997)","edition":"2"},{"key":"10_CR3","unstructured":"Brukardt, R.L. (ed): Annotated Ada Reference Manual, ISO\/IEC 8652:2012(E) with COR.1:2016 (2016). http:\/\/www.ada-auth.org\/standards\/aarm12_w_tc1\/AA-Final.pdf"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1015669415634","volume":"12","author":"P Buchholz","year":"2002","unstructured":"Buchholz, P., Kemper, P.: Efficient computation and representation of large reachability sets for composed automata. Discrete Event Dyn. Syst. 12(3), 265\u2013286 (2002)","journal-title":"Discrete Event Dyn. Syst."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-319-08311-7_4","volume-title":"Reliable Software Technologies \u2013 Ada-Europe 2014","author":"B Burgstaller","year":"2014","unstructured":"Burgstaller, B., Blieberger, J.: Kronecker algebra for static analysis of Ada programs with protected objects. In: George, L., Vardanega, T. (eds.) Ada-Europe 2014. LNCS, vol. 8454, pp. 27\u201342. Springer, Heidelberg (2014)"},{"issue":"6","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1016\/j.jss.2011.11.1039","volume":"85","author":"B Burgstaller","year":"2012","unstructured":"Burgstaller, B., Scholz, B., Blieberger, J.: A symbolic analysis framework for static analysis of imperative programming languages. J. Syst. Softw. 85(6), 1418\u20131439 (2012)","journal-title":"J. Syst. Softw."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TC.1981.6312174","volume":"30","author":"M Davio","year":"1981","unstructured":"Davio, M.: Kronecker products and shuffle algebra. IEEE Trans. Comput. 30(2), 116\u2013125 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR8","volume-title":"The Little Book of Semaphores","author":"AB Downey","year":"2005","unstructured":"Downey, A.B.: The Little Book of Semaphores. Green Tea Press, Virginia (2005)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-68624-8_10","volume-title":"Reliable Software Technologies \u2013 Ada-Europe 2008","author":"R Fechete","year":"2008","unstructured":"Fechete, R., Kienesberger, G., Blieberger, J.: A framework for CFG-based static program analysis of Ada programs. In: Kordon, F., Vardanega, T. (eds.) Ada-Europe 2008. LNCS, vol. 5026, pp. 130\u2013143. Springer, Heidelberg (2008)"},{"key":"10_CR10","volume-title":"Java 7 Concurrency Cookbook","author":"JF Gonz\u00e1lez","year":"2012","unstructured":"Gonz\u00e1lez, J.F.: Java 7 Concurrency Cookbook. Packt Publishing Ltd., Birmingham (2012)"},{"key":"10_CR11","volume-title":"Kronecker Products and Matrix Calculus with Applications","author":"A Graham","year":"1981","unstructured":"Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood Ltd., New York (1981)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Hill, J.M.D., Skillicorn, D.B.: Practical barrier synchronisation. In: PDP, pp. 438\u2013444 (1998)","DOI":"10.1109\/EMPDP.1998.647231"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-69330-7_13","volume-title":"Languages and Compilers for Parallel Computing","author":"A Kamil","year":"2006","unstructured":"Kamil, A., Yelick, K.A.: Concurrency analysis for parallel programs with textually aligned barriers. In: Ayguad\u00e9, E., Baumgartner, G., Ramanujam, J., Sadayappan, P. (eds.) LCPC 2005. LNCS, vol. 4339, pp. 185\u2013199. Springer, Heidelberg (2006)"},{"key":"10_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer, Heidelberg (1986)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-41202-8_16","volume-title":"Formal Methods and Software Engineering","author":"D-K Le","year":"2013","unstructured":"Le, D.-K., Chin, W.-N., Teo, Y.-M.: Verification of static and dynamic barrier synchronization using bounded permissions. In: Groves, L., Sun, J. (eds.) ICFEM 2013. LNCS, vol. 8144, pp. 231\u2013248. Springer, Heidelberg (2013)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Malkis, A., Banerjee, A.: Verification of software barriers. In: PPoPP (2012)","DOI":"10.1145\/2145816.2145871"},{"key":"10_CR17","unstructured":"Mittermayr, R., Blieberger, J.: Shared memory concurrent system verification using Kronecker algebra. Technical report 183\/1-155, Automation Systems Group, TU Vienna, September 2011. http:\/\/arxiv.org\/abs\/1109.5522"},{"key":"10_CR18","unstructured":"Mittermayr, R., Blieberger, J.: Timing analysis of concurrent programs. In: Vardanega, T. (ed) 12th WCET, vol. 23, pp. 59\u201368 (2012)"},{"key":"10_CR19","first-page":"359","volume":"2012","author":"R Mittermayr","year":"2012","unstructured":"Mittermayr, R., Blieberger, J., Sch\u00f6bel, A.: Kronecker algebra based deadlock analysis for railway systems. J. PROMET 2012, 359\u2013369 (2012)","journal-title":"J. PROMET"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Plateau, B.: On the stochastic structure of parallelism and synchronization models for distributed algorithms. In: SIGMETRICS 1985, vol. 13, pp. 147\u2013154 (1985)","DOI":"10.1145\/317786.317819"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/349214.349241","volume":"22","author":"G Ramalingam","year":"2000","unstructured":"Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2), 416\u2013430 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR22","unstructured":"Stefan, M., Blieberger, J., Sch\u00f6bel, A.: Application of Kronecker algebra in railway operation. Tehni\u010dki vjesnik - Technical Gazette (2016, to appear)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Duesterwald, E.: Barriers matching for programs with textually unaligned barriers. In: PPoPP, pp. 194\u2013204 (2007)","DOI":"10.1145\/1229428.1229472"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-85261-2_7","volume-title":"Languages and Compilers for Parallel Computing","author":"Y Zhang","year":"2008","unstructured":"Zhang, Y., Duesterwald, E., Gao, G.R.: Concurrency analysis for shared memory programs with textually unaligned barriers. In: Adve, V., Garzar\u00e1n, M.J., Petersen, P. (eds.) LCPC 2007. LNCS, vol. 5234, pp. 95\u2013109. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Reliable Software Technologies \u2013 Ada-Europe 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39083-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:57:24Z","timestamp":1748980644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39083-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319390826","9783319390833"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39083-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}