Kronecker algebra has proven useful in analyzing multithreaded programs when semaphores are the only synchronization primitives. In contrast, Ada uses higher level synchronization primitives, namely protected objects. In this paper we show how Kronecker algebra can be generalized to statically analyze Ada multi-tasking programs that employ protected objects for synchronization issues.
|Title of host publication||Reliable Software Technologies, Ada-Europe 2014 - 19th Ada-Europe International Conference on Reliable Software Technologies, Proceedings|
|Number of pages||16|
|Publication status||Published - 2014|
|Event||19th International Conference on Reliable Software Technologies, Ada-Europe 2014 - Paris, France|
Duration: 2014 Jun 23 → 2014 Jun 27
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||19th International Conference on Reliable Software Technologies, Ada-Europe 2014|
|Period||14/6/23 → 14/6/27|
Bibliographical noteFunding Information:
This project has been supported by the National Research Foundation of Korea (NRF) funded by the Korean government (MEST) under grant number 2012K2A1A9054713, and by the Austrian Science Fund (FWF) project I 1035N23.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)