A New Realization of Shared Resource Matrix Transitive Closure Computation Algorithm
Shared Resource Matrix (SRM) is a very important structure and method for Covert Channel Searching and Resolving in Research on Linux Security Test The ideal realization uses two-dimension continuous-stored matrix to describe and do the transitive closure computation, but, since the restrictions on computer memory and programming language, that realization works theoretically only. This paper aims to introduce a new realization of Shared Resource Matrix (SRM) Transitive Closure Computation Algorithm, and wants to compare this new realization with a previous realizable implementation. The realization is implemented in the Integrated Development Environment of Microsoft Visual Studio 2010. Finally, some ideas about how to improve this new realization as well as directions of future research are summarized.
Shared Resource Matrix(SRM) Covert Channel Transitive Closure New Kealiiation Computation Algorithm
Siqi Yang Gaoshou Zhai
School of Computer and Information Technology, Beijing Jiaotong University Beijing, China
国际会议
成都
英文
869-872
2010-12-17（万方平台首次上网日期，不代表论文的发表时间）