Towards Complexity Metrics for Ada Tasking
暂无分享,去创建一个
[1] Kenneth W. Kolence,et al. Software unit profiles & Kiviat figures , 1973, PERV.
[2] Francesco Tisato,et al. Modeling the Ada Task System by Petri Nets , 1985, Comput. Lang..
[3] Victor R. Basili,et al. Metrics for Ada packages: an initial study , 1986, CACM.
[4] Jim Welsh,et al. A comparative study of task communication in ada , 1981, Softw. Pract. Exp..
[5] Martin R. Woodward,et al. A Measure of Control Flow Complexity in Program Text , 1979, IEEE Transactions on Software Engineering.
[6] Maurice H. Halstead,et al. Elements of software science (Operating and programming systems series) , 1977 .
[7] Anas N. Al-Rabadi,et al. A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .
[8] Rami R. Razouk,et al. Computer-aided analysis of concurrent systems , 1985, PSTV.
[9] Kuo-Chung Tai. A graphical notation for describing executions of concurrent Ada programs , 1986, ALET.
[10] C. V. Ramamoorthy,et al. METRICS GUIDED METHODOLOGY. , 1985 .
[11] Sallie M. Henry,et al. Software quality metrics based on interconnectivity , 1981, J. Syst. Softw..
[12] Sol M. Shatz,et al. A petri net framework for automated static analysis of Ada tasking behavior , 1988, J. Syst. Softw..
[13] Victor R. Basili,et al. TAME: tailoring an Ada Measurement Environment , 1987, WADAS '87.
[14] Michael Evangelist,et al. Program complexity and programming style , 1984, 1984 IEEE First International Conference on Data Engineering.
[15] Sol M. Shatz,et al. Introduction to Distributed-Software Engineering , 1987, Computer.
[16] Tadao Murata,et al. Detection of Ada Static Deadlocks Using Petri Net Invariants , 1989, IEEE Trans. Software Eng..