Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects

摘要

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.