网络化软件运行时交互行为过程特性分析
|
摘要
摘要：软件已经成为国民经济的支柱产业,在人们的日常生活中起着越来越重要的作用。由软件质量缺陷引发的损失和灾难,却一直困扰着人们。特别是网络化软件的出现,使得保障和提高软件的可靠性、安全性等可信属性面临极大挑战。网络化软件的复杂特征研究已经成为一个热点问题,而以网络化软件运行时交互行为为研究对象,掌握其行为规律和内部机理等交互行为过程中隐藏的行为特性,是解决网络化软件可信性问题的关键之一。因此,网络化软件运行时交互行为过程特性研究具有很强的现实意义。
现行的针对传统软件的行为分析方法,不仅没有考虑网络化软件复杂的运行环境,而且对构成网络化软件的基础设施和软件实体本身的结构和行为的复杂性都缺乏表达能力。如何在开放、难控、动态的网络环境下,对这类结构复杂、行为复杂和多重复杂性融合在一起的网络化软件运行时产生的交互行为,从不同层次挖掘其行为过程特性,进行准确的行为描述、构建高效的行为模型、实时充分地展开异常行为传播分析,并将这些方法应用于实际系统中,对推动网络化软件的实证研究都具有重要的挑战意义。
针对网络化软件运行时多实体并行执行产生的行为踪迹标记丢失、缺失行为主体,而无法识别这些行为踪迹由哪些事务生成等问题,本文提出了对这类带部分标记和不带标记的不完全事务分别采用网络流和二分图匹配的方法,进行重新标记。该方法能有效解决上述问题,为时间上交错,空间上重叠的行为踪迹找到行为主体,便于网络化软件运行时的行为描述。
针对现有行为建模方法在监控收集的日志文档格式无标准、约束条件不充分、模型空间冗余、状态设置不合理等问题,本文提出了基于不变量约束的交互行为动态建模方法。该方法从预先设定格式监控收集的行为日志中抽取出六类不变量,对模型中的事件关联进行约束,并采用精化和抽象的方法确保模型的确定性和完备性。不变量的挖掘算法和建模算法具有良好的时空效率。对模型中的反例路径分析,可揭示系统中存在的潜在威胁,验证已知漏洞。
针对现有异常行为分析方法对异常行为传播特征的描述不充分、检测能力有限等问题,本文提出了从不同粒度审视网络化软件,将仓室模型和个体模型结合起来,构建出描述异常行为传播的过程模型。同时提出影响异常行为传播的三类参数,传播概率、交互频率和连接率,并给出了相关定义及其计算方法,增强了对异常行为传播分析的准确性,对网络化软件系统中存在的由错误和漏洞引发的异常行为预测和牵制控制也具有启发作用。
以在线电子购物系统软件为实例,与研究的每一个阶段相结合,验证了上述方法的有效性和可行性,包括对软件交互行为的描述、动态模型的构建指导、以及通过异常行为传播分析提高系统可靠性等。本文通过研究网络化软件运行时交互行为过程特性,提出的一整套方案,为提高网络软件的可信性开辟了新思路。
ABSTRACT:Software has become a mainstay industry of the national economy, and plays an increasingly important role in people's daily life. However, the loss and disaster caused by the software quality defects, has been made people disappointed. Especially the emergency of networked software, ensuring and improving the software credibility attributes like reliability and safety facing great challenges. Research on networked software complex characteristics has become a hot issue, it is one of the key to solve the network software credibility problem that take networked software runtime interactive behavior as the research object, and grasp the behavior execution law and the internal mechanism. Therefore, researching the networked software runtime interactive behavior process characteristic has a strong practical significance.
The current behavior analysis method for traditional software, neither consider the complex operating environment, nor have the ability to express the infrastructure, software entities structure, and behavior complexity of the networked software. Under open, uncontrollable, dynamic internet environment, how to accurately describe interactive behavior, construct efficient behavioral models, and sufficiently take abnormal behavior spreading analysis for this kind of networked software with complex structure, complex behavior and multiple fusion complexes, and finally apply the method to the actual system, which has important challenges significance in promoting empirical research and improving the credibility of networked software.
In consideration of the existing problems such as footprints token lost, missing actors, and can not recognize which transactions generate these behavior footprints when networked software multi-entity parallel executed the method of network flow and bipartite graph matching for separately re-tokenizing the incomplete transaction with part tokens and without tokens is then presented. This method can effectively solve the above problem, and find actors for the behavior footprints which temporally staggered and spatial overlapped. Therefore, facilitate the description of the networked software runtime behavior.
In consideration of the existing problems such as lack of log format standards, inadequate constraints condition, model spatial redundancy, unreasonable status setting, the method based on invariant constrains for dynamic modeling is then presented. Six types of invariants extracted from a pre-set format behavior log to constraint event correlation, refinement and abstraction is adopted to ensure the model certainty and completeness. By anglicizing the counterexample path in the model can reveal the potential threat in the existing system, and verify the known vulnerabilities.
In consideration of the existing problems such as inadequate description of the abnormal behavior propagation characteristics, limited detective ability of the model, a method of investigating the networked software from different view, combining the compartment model and the individual model to construct the abnormal behavior propagation model is then presented. Three types of parameters, spread probability, interaction frequency and connection rate, which affecting the spread of abnormal behavior were proposed, and related definition and calculation method are also investigated, which not only enhances the analysis accuracy of abnormal behavior propagation but show us some light on abnormal behavior predicting and pinning control.
Based on the modeling and analysis methods of networked software discussed above, we have further studied the online electronic trading system, verified the feasibility of these methods, including software interactive behavior description, dynamic modeling, reliability improvement by abnormal behavior propagation analysis. Thus the thesis opens a new theoretic way to improve the credibility of networked software.
现行的针对传统软件的行为分析方法,不仅没有考虑网络化软件复杂的运行环境,而且对构成网络化软件的基础设施和软件实体本身的结构和行为的复杂性都缺乏表达能力。如何在开放、难控、动态的网络环境下,对这类结构复杂、行为复杂和多重复杂性融合在一起的网络化软件运行时产生的交互行为,从不同层次挖掘其行为过程特性,进行准确的行为描述、构建高效的行为模型、实时充分地展开异常行为传播分析,并将这些方法应用于实际系统中,对推动网络化软件的实证研究都具有重要的挑战意义。
针对网络化软件运行时多实体并行执行产生的行为踪迹标记丢失、缺失行为主体,而无法识别这些行为踪迹由哪些事务生成等问题,本文提出了对这类带部分标记和不带标记的不完全事务分别采用网络流和二分图匹配的方法,进行重新标记。该方法能有效解决上述问题,为时间上交错,空间上重叠的行为踪迹找到行为主体,便于网络化软件运行时的行为描述。
针对现有行为建模方法在监控收集的日志文档格式无标准、约束条件不充分、模型空间冗余、状态设置不合理等问题,本文提出了基于不变量约束的交互行为动态建模方法。该方法从预先设定格式监控收集的行为日志中抽取出六类不变量,对模型中的事件关联进行约束,并采用精化和抽象的方法确保模型的确定性和完备性。不变量的挖掘算法和建模算法具有良好的时空效率。对模型中的反例路径分析,可揭示系统中存在的潜在威胁,验证已知漏洞。
针对现有异常行为分析方法对异常行为传播特征的描述不充分、检测能力有限等问题,本文提出了从不同粒度审视网络化软件,将仓室模型和个体模型结合起来,构建出描述异常行为传播的过程模型。同时提出影响异常行为传播的三类参数,传播概率、交互频率和连接率,并给出了相关定义及其计算方法,增强了对异常行为传播分析的准确性,对网络化软件系统中存在的由错误和漏洞引发的异常行为预测和牵制控制也具有启发作用。
以在线电子购物系统软件为实例,与研究的每一个阶段相结合,验证了上述方法的有效性和可行性,包括对软件交互行为的描述、动态模型的构建指导、以及通过异常行为传播分析提高系统可靠性等。本文通过研究网络化软件运行时交互行为过程特性,提出的一整套方案,为提高网络软件的可信性开辟了新思路。
ABSTRACT:Software has become a mainstay industry of the national economy, and plays an increasingly important role in people's daily life. However, the loss and disaster caused by the software quality defects, has been made people disappointed. Especially the emergency of networked software, ensuring and improving the software credibility attributes like reliability and safety facing great challenges. Research on networked software complex characteristics has become a hot issue, it is one of the key to solve the network software credibility problem that take networked software runtime interactive behavior as the research object, and grasp the behavior execution law and the internal mechanism. Therefore, researching the networked software runtime interactive behavior process characteristic has a strong practical significance.
The current behavior analysis method for traditional software, neither consider the complex operating environment, nor have the ability to express the infrastructure, software entities structure, and behavior complexity of the networked software. Under open, uncontrollable, dynamic internet environment, how to accurately describe interactive behavior, construct efficient behavioral models, and sufficiently take abnormal behavior spreading analysis for this kind of networked software with complex structure, complex behavior and multiple fusion complexes, and finally apply the method to the actual system, which has important challenges significance in promoting empirical research and improving the credibility of networked software.
In consideration of the existing problems such as footprints token lost, missing actors, and can not recognize which transactions generate these behavior footprints when networked software multi-entity parallel executed the method of network flow and bipartite graph matching for separately re-tokenizing the incomplete transaction with part tokens and without tokens is then presented. This method can effectively solve the above problem, and find actors for the behavior footprints which temporally staggered and spatial overlapped. Therefore, facilitate the description of the networked software runtime behavior.
In consideration of the existing problems such as lack of log format standards, inadequate constraints condition, model spatial redundancy, unreasonable status setting, the method based on invariant constrains for dynamic modeling is then presented. Six types of invariants extracted from a pre-set format behavior log to constraint event correlation, refinement and abstraction is adopted to ensure the model certainty and completeness. By anglicizing the counterexample path in the model can reveal the potential threat in the existing system, and verify the known vulnerabilities.
In consideration of the existing problems such as inadequate description of the abnormal behavior propagation characteristics, limited detective ability of the model, a method of investigating the networked software from different view, combining the compartment model and the individual model to construct the abnormal behavior propagation model is then presented. Three types of parameters, spread probability, interaction frequency and connection rate, which affecting the spread of abnormal behavior were proposed, and related definition and calculation method are also investigated, which not only enhances the analysis accuracy of abnormal behavior propagation but show us some light on abnormal behavior predicting and pinning control.
Based on the modeling and analysis methods of networked software discussed above, we have further studied the online electronic trading system, verified the feasibility of these methods, including software interactive behavior description, dynamic modeling, reliability improvement by abnormal behavior propagation analysis. Thus the thesis opens a new theoretic way to improve the credibility of networked software.
引文
[1]张尧学.透明计算：概念,结构和示例[J].电子学报,2004,32(12A)：169-173.
[2]杨芙清,吕建,梅宏.网构软件技术体系：一种以体系结构为中心的途径[J].中国科学E辑,2008,38(6)：818-828.
[3]马于涛,何克清,李兵,刘婧.网络化软件的复杂网络特性实证[J].软件学报,2011,22(3)：381-407.
[4]梅宏,刘譞哲.互联网时代的软件技术：现状与趋势[J].科学通报,2010,55(13)：1214-1220.
[5]黄宇,余建平,马晓星,等.开放环境特性感知技术[J].软件学报,2011,22(5)：865-876.
[6]陈火旺,王戟,董威.高可信软件工程技术[J].电子学报,2003,31(12A)：1933-1938.
[7]Zheng ZhiMing, MA ShiLong2, Li Wei,et al. Complexity of software trustworthiness and its dynamical statistical analysis methods [J]. Science in China Series F:Information Sciences,2009,52(9):1651-1657.
[8]Murphy G C, Murphy-Hill E. What is trust in a recommender for software development? [C]Proceedings of the 2nd International Workshop on Recommendation Systems for Software Engineering. ACM,2010:57-58.
[9]Koziolek H. Performance evaluation of component-based software systems:A survey [J]. Performance Evaluation,2010,67(8):634-658.
[10]Christopher R. Myers. Software systems as complex networks:Structure,function, and evlovability of software collaboration graphs [J]. Physical Review E,2003,
[11]Li H, Han J, Wang Y. A New Method for Modeling Complex Network Topology of Software Systems [J]. Appl. Math,2013,7(3):1225-1228.
[12]LianWen, R. Geoff Dromey, Diana Kirk.Software Engineering and Scale-Free Networks [J]. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics,2009,39(3):648-657.
[13]S. Jenkins, S.R. Kirk. Software architecture graphs as complex networks:A novel partitioning scheme to measure stability and evolution [J]. Information Sciences, 2007,177 (2007):2587-2601.
[14]WangH, He K, BING LI, et al. On some recent advances in complex software networks:Modeling, analysis, evolution and applications [J]. International Journal of Bifurcation and Chaos,2012,22(02):1-15.
[15]Subelj L, Bajec M. Community structure of complex software systems:Analysis and applications [J]. Physical A:Statistical Mechanics and its Applications,2011, 390(16):2968-2975.
[16]YangG, Jia L, Shuai S, et al. Weighted Networks of Object-Oriented Software Systems:The Distribution of Vertex Strength and Correlation[C] Proceedings of the 2012 International Conference on Communication, Electronics and Automation Engineering. Springer Berlin Heidelberg,2011:1185-1190.
[17]AroraD, Khanna P, Tripathi A, et al. Software quality estimation through object oriented design metrics [J]. IJCSNS,2011,11(4):100.
[18]彭成,杨路明,满君丰.不完全事务行为踪迹标记研究[J].小型微型计算机系统,2011,32(8)：1593-1598.
[19]彭成,杨路明,满君丰.带部分标记的软件行为踪迹标记研究[J].小型微型计算机系统,2013,34(3)：466-470.
[20]彭成,杨路明,满君丰.网络化软件交互行为动态建模[J].电子学报,2013,41(2)：314-320.
[21]Northrop L, Feiler P, et al. Ultra-Large-Scale systems:The software challenge of the future.2006. http://www.sei.cmu.edu/uls/uls.pdf
[22]Wang H, He K, Li B. Exploring networked software [C] Networking, Sensing and Control (ICNSC),2010 International Conference on. IEEE,2010:470-475.
[23]Barabasi AL, Albert R. Emergence of scaling in random networks [J].Science,1999, 286(5439):509-512.
[24]Donnet B. Internet Topology Discovery [M] Data Traffic Monitoring and Analysis. Springer Berlin Heidelberg,2013:44-81.
[25]Laird P, Barrett S. Towards dynamic evolution of domain specific languages [J]. Software Language Engineering,2010,5969 (2010):144-153.
[26]He KQ, Liang P, Peng R, Li B, Liu J. Requirement emergence computation of networked software [J].Frontiers of Computer Science in China,2007, 1(3):322-328.
[27]方锦清,汪小帆,郑志刚.非线性网络的动力学复杂性的研究[J].复杂系统与复杂性科学,2010,7(002)：5-9.
[28]Erdos P, Renyi A. On random graphs I. [J].Publications Mathematical,1959, 6(1959):290-297.
[29]Erdos P, Renyi A. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences,1960, 5(1960):17-61.
[30]Watts DJ, Strogatz SH. Collective dynamics of small-world networks [J].Nature, 1998,393(6684):440-442.
[31]Re'ka Albert, Albert-La'szlo'Baraba'si. Statistical mechanics of complex networks [J]. Reviews of Modern Physics,2002,74(1):47-97.
[32]Faloutsos C, Faloutsos M, et al. On power-law relationships of the Internet topology. [C]In:Proc. of the ACM SIGCOMM,1999:251-262.
[33]Kumar R, Raghavan P, etal. Trawling the Web for emerging cyber-communities[J]. Computer Networks,1999,31(11-16):1481-1493.
[34]Albert R, Jeong H, Barabasi AL. Diameter of the World-Wide Web [J]. Nature, 1999,401(6749):130-131.
[35]Broder A, Kumar R, et al. Wiener J. Graph structure in the Web [J]. Computer Networks,2000,33(1/6):309-320.
[36]Adamic LA. The small world Web[C] In:Proc. of the ECDL 1999, LNCS 1696. Berlin:Springer-Verlag,1999:443-452.
[37]Steyvers M, Tenenbaum JB. The large-scale structure of semantic networks: Statistical analyses and a model of semantic growth [J].Cognitive Science,2005, 29(1):41-78.
[38]Cheng G, Qu Y. Term dependence on the semantic Web[C] In:Proc. of the ISWC 2008, LNCS 5318. Berlin:Springer-Verlag,2008:665-680.
[39]Valverde S, Cancho R, Sole R. Scale free networks from optimal design [J]. Euro physics Letters,2002,60(4):512-517.
[40]Cai K Y, Yin B B. Software execution processes as an evolving complex network [J]. Information Sciences,2009,179(12):1903-1928.
[41]Jones CB. Systematic Software Development Using VDM [M].Prentice Hall International(UK)Ltd. Hertfordshire, UK,1990:1-20.
[42]Hall J G, Jacob J L, Mc Dermid J A, et al. Towards a Z Method:the Two Button press Case Study [J].IEEE Colloquium on Practical Application of Formal Methods,1995,19(5):1-3.
[43]Bodei C, Degano P, Nielson F, et al. Control Flow Analysis for the π calculus [J].Springer Lecture Notes in Computer Science.1998,1466:481-488.
[44]Roberto Barbuti, Nicoletta De Francesco, et al. Reduced Models for Efficient CCS Verification [J]. Formal Methods in System Design,2005,26(3):319-350.
[45]Gouasmi T, Regayeg A, et al. Automatic Generation of an Operational CSP-Z Specification from an Abstract Temporal^ Z Specification[C] Computer Software and Applications Conference Workshops (COMPSACW),2012:248-253.
[46]Albers K, Slomka F. An event stream driven approximation for the analysis of real-time systems[C] Real-Time Systems,2004. ECRTS,2004:187-195.
[47]Xuxian Jiang, Xingquan Zhu. vEye:behavioral footprinting for self-propagating worm detection and profiling[J]. Knowledge Information System,2009,18(2): 231-262.
[48]Luiz Fernando Rust C. Carmo, et al. Trust Evaluation for Web Applications based on Behavioral Analysis. [C] Sandton, South Africa. SEC 2007:61-72.
[49]C. Platzer, Trust-based Security in Web Services [D].Master's Thesis, Information Systems Institute, Technical University of Vienna, Austria,2004.
[50]Pusara M, Brodley C E. User re-authentication via mouse movements [C]Proceedings of the 2004 ACM workshop on Visualization and data mining for computer security. ACM,2004:1-8.
[51]T. Lane, C. Brodley. Temporal Sequence Learning and Data Reduction for Anomaly Detection [J].ACM Transactions on Information and System Security, 1999,2(3):295-331.
[52]K. Chandy, L. Lamport. Distributed Snapshots:Determining Global States of Distributed Systems [J]. ACM Tran. on Computer Systems,1985,3(1):63-75.
[53]M. Mansouri-Samani, M. Sloman. Monitoring distributed systems [J]. Network, IEEE,1993,7(6):20-30.
[54]Christopher Ackermann, Mikael Lindvall, Rance Cleaveland. Towards Behavioral Reflexion Models [C] Reliability Society Mysuru, India:IEEE Computer Society, 2009:175-184.
[55]Jonathan E. Cook, Alexander L. Wolf. Discovering Models of Software Processes from Event-Based Data [J].ACM Transactions on Software Engineering and Methodology,1998,7(3):215-249.
[56]Tao Li, Wei Peng, Charles Perng, Sheng Ma, and Haixun Wang. An Integrated Data-Driven Framework for Computing System Management [J]. IEEE Transactions on Systems,2010,40(1):90-99.
[57]Chun ying Zhao, Jun Kong, and Kang Zhang. Program Behavior Discovery and Verification:A Graph Grammar Approach [J]. IEEE Transactions on Software Engineering,2010,36(3):431-447.
[58]Ball T, Levin V, et al. A decade of software model checking with SLAM [J]. Communications of the ACM,2011,54(7):68-76.
[59]Cimatti A, Griggio A, et al. KRATOS-A Software Model Checker for SystemC [C] Computer Aided Verification. Springer Berlin/Heidelberg,2011:310-316.
[60]ZhenLi,JunFeng Tian and Liu Yang. An Improved Software Behavior Model in System Call Level and Trustworthiness Evaluation [J]. Information Technology Journal,2011,10(11):2208-2213.
[61]傅建明,陶芬,王丹,张焕国.基于对象的软件行为模型[J].软件学报,2011,22(11)：2716-2728.
[62]Curtis E.Hrischuk, Murray Woodside. Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System [J]. IEEE Transaction on Software Engineering,2002,28(4):321-338.
[63]Selvaraj Srinivasan, R. Rajaram. A Decentralized Deadlock Detection and Resolution Algorithm for Generalized Model in Distributed Systems [J]. Distributed and Parallel Databases,2011,29(4):261-276.
[64]J.Tan, X.Pan, S.Kavulya, R.G, et al. SALSA:Analyzing Logs as State Machines [C] USENIX Workshop.San Diego, CA:USENIX,2008:6-6.
[65]J.Tan, X.Pan, S.Kavulya, R.G, et al. Mochi:Visual Log-Analysis Based Tools for Debugging Hadoop [C] IEEE International Conference on Distributed Computing Systems Workshops,2010:795-806.
[66]J.Yang and D.Evans. Dynamically Inferring Temporal Properties [C] Association for Computing Machinery,2004:23-28.
[67]David Lo and Shahar Maoz. Scenario-based and value-based specification mining: better together [J]. Autom Software Engineering,2012,19(l):423-458.
[68]J. Whittle and J. Schumann. Generating State chart Designs from Scenarios [C] New York, ACM. Limerick, Ireland:IEEE-CS Computer Society,2000:314-323.
[69]C. Damas et al. Generating Annotated Behavior Models from End-User Scenarios [J]. IEEE Transaction on Software Engineering,2005,31(12):1056-1073.
[70]Yang J, Evans D, Bhardwaj D, et al. Perracotta:mining temporal API rules from imperfect traces[C] Proceedings of the 28th international conference on Software engineering. ACM,2006:282-291.
[71]Michael Ernst, Jake Cockrell, et al. Dynamically discovering likely program invariants to support program evolution. [J].IEEE Transactions on Software Engineering,2001,27(2):99-123.
[72]S. McCamant, M.D. Ernst. Predicting problems caused by component upgrades [C] in proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, ACM Press,2003:287-296.
[73]McCamant, M. D. Ernst. Early identification of incompatibilities in multi-component upgrades[C] In ECOOP 2004 Object-Oriented Programming, 18th European Conference, Olso, Norway,2004:1-25.
[74]L. Mariani, M. Pezze. Behavior Capture and Test:Automated Analysis of Component Integration[C]in proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems, IEEE Computer Society,2005:292-301.
[75]L. Mariani, S. Papagiannakis et al. Compatibility and Regression Testing of COTS-component-based Software[C]in Proceedings of the 29th International Conference on Software Engineering (ICSE2007),2007:85-95.
[76]S. Hangal and M.s. Lam. Tracking down software bugs using anomaly detection [C]in proceedings of the 24th International Conference on Software Engineering, IEEE Computer Society,2002:291-301.
[77]T. Xie, D. Notkin.Checking inside the black box:regression testing by comparing value spectra [J].IEEE Transactions on Software Engineering,2005,31(10), 869-883.
[78]L. Mariani, F. Pastore et al. Dynamic Analysis for Diagnosing Integration Faults [J]. IEEE Transactions on Software Engineering,2011,37(4):486-508.
[79]A. Babenko, L. Mariani. AVA:automated interpretation of dynamically detected anomalies[C] Proceedings of the International Symposium on Software Testing and Analysis (ISSTA),2009,237-248.
[80]J. Perkins, S. Kim, et al. Automatically patching errors in deployed software[C] Proceedings of the 22nd Symposium on Operating Systems Principles. ACM Press, 2009,87-102.
[81]Hopcroft J E, Karp R M. An n^5/2 algorithm for maximum matching in bipartite graphs [J]. SIAM Journal on Computing,1973,2(4):225-231.
[82]Glover F. Maximum matching in a convex bipartite graph [J]. Naval Research Logistics Quarterly,1967,14(3):313-316.
[83]Yannakakis M. Computing the minimum fill-in is NP-complete [J]. SIAM Journal on Algebraic Discrete Methods,1981,2(1):77-79.
[84]Karp R M, Vazirani U V, et al. An optimal algorithm for on-line bipartite matching[C] Proceedings of the twenty-second annual ACM symposium on Theory of computing. ACM,1990:352-358.
[85]Kuhn H W. The Hungarian method for the assignment problem [J]. Naval research logistics quarterly,2006,2(1-2):83-97.
[86]Zhu H, Zhou M C. Efficient Role Transfer Based on Kuhn-Munkres Algorithm [J]. Systems, Man and Cybernetics, Part A:Systems and Humans, IEEE Transactions on,2012,42(2):491-496.
[87]ARM. http://www.opengroup.org/tech/management/arm/.2013, June
[88]WALKER R J, et al. An initial assessment of aspect-oriented programming [C].Proc of the 21st International Conference on Software Engineering.1999: 120-130.
[89]李仁杰,张瞩熹,等.基于监控的可信软件构造模型研究与实现[J].计算机应用研究,2009,26(12)：4584-4588.
[90]Jensen PA, Barnes J W. Network flow programming [M]. Krieger,1987.
[91]Mairal J, Jenatton R, et al. Network flow algorithms for structured sparsity [J]. arXivpreprint arXiv,2010,1008(5209):1-30.
[92]Bazaraa M S, Jarvis J J, et al. Linear programming and network flows[M]. New York:Wiley,1990:556-560.
[93]Eiselt H A, Sandblom C L. Network Flow Algorithms [M] Integer Programming and Network Models. Springer Berlin Heidelberg,2000:399-434.
[94]Cheriyan J, Maheshwari S N. Analysis of preflow push algorithms for maximum network flow [J]. SIAM Journal on Computing,1989,18(6):1057-1086.
[95]Dantzig G Linear programming and extensions [M].Princeton University press, 1998.
[96]Goldfarb D, Hao J. A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O (n 2 m) time [J]. Mathematical Programming, 1990,47(1):353-365.
[97]Orlin J B. A faster strongly polynomial minimum cost flow algorithm [J]. Operations research,1993,41(2):338-350.
[98]Ford Jr L R, Fulkerson D R, et al. Flows in networks [J]. Physics Today,1963, 1963(7):16-54.
[99]Ford L R, Fulkerson D R. Maximal flow through a network [J]. Canadian Journal of Mathematics,1956,8(3):399-404.
[100]Dinic E A. Algorithm for solution of a problem of maximum flow in networks with power estimation [C] Soviet Math. Dokl.1970,11(5):1277-1280.
[101]Edmonds J, Karp R M. Theoretical improvements in algorithmic efficiency for network flow problems [J]. Journal of the ACM (JACM),1972,19(2):248-264.
[102]Yakovleva M A. A problem on minimum transportation cost [J]. Applications of mathematics in economic research,1959:390-399.
[103]Minty G J, Minty G J. Monotone networks [J]. Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences,1960,257(1289): 194-212.
[104]Fulkerson D R. An out-of-kilter method for minimal-cost flow problems [J]. Journal of the Society for Industrial & Applied Mathematics,1961,9(1):18-27.
[105]Tardos E. A strongly polynomial minimum cost circulation algorithm [J]. Combinatorica,1985,5(3):247-255.
[106]Jewell W S. Optimal flow through networks [D]. Massachusetts Institute of Technology, Department of Electrical Engineering,1958.
[107]Jewell W S. New Methods in Mathematical Programming-Optimal Flow through Networks with Gains [J]. Operations Research,1962,10(4):476-499.
[108]Onaga K. Dynamic programming of optimum flows in lossy communication nets [J]. Circuit Theory, IEEE Transactions on,1966,13(3):282-287.
[109]Kapoor S, Vaidya P M. Fast algorithms for convex quadratic programming and multicommodity flows[C] Proceedings of the eighteenth annual ACM symposium on Theory of computing. ACM,1986:147-159.
[110]Goldberg A V, Plotkin S A, Tardos E. Combinatorial algorithms for the generalized circulation problem [J]. Mathematics of Operations Research,1991, 16(2):351-381.
[111]Konig D. Theorie der endlichen und unendlichen Graphen[M].American Mathematical Soc.,2001,113-245.
[112]Even S, Tarjan R E. Network flow and testing graph connectivity [J]. SIAM journal on computing,1975,4(4):507-518.
[113]Tomizawa N. On some techniques useful for solution of transportation network problems [J]. Networks,2006,1(2):173-194.
[114]杨涛,肖田元,等.基于层次自动机的应用软件行为建模[J].系统仿真学报,2005,17(4)：778-781.
[115]Forrest S.A sense of self for UNIX processes[C]Proc.of the IEEE Symp. on Security and Privacy. Oakland:IEEE Press,1996:120-128.
[116]Sekar R, et al.A fast Automaton-Based method for detecting anomalous program behaviors[C]IEEESymp.on Security and Privacy.Oakland:IEEE Press, 2001:144-155.
[117]Cassandras C G, Lafortune S. Introduction to discrete event systems [M]. Kluwer academic publishers,1999,118-213.
[118]钱能.C++程序设计教程[M].北京：清华大学出版社,1999,153-172.
[119]Liu W, Hethcote H W, Levin S A. Dynamical behavior of epidemiological models with nonlinear incidence rates[J]. Journal of mathematical biology,1987,25(4): 359-380.
[120]Ren J, Yang X, Zhu Q, et al. A novel computer virus model and its dynamics [J]. Nonlinear Analysis:Real World Applications,2012,13(1):376-384.
[121]满君丰.开放网络环境下软件行为监测与分析[D].长沙：中南大学,2010.
[122]徐建军,谭庆平,熊磊,叶俊.一种针对软错误的程序可靠性定量分析方法[J].电子学报,2011,39(3)：675-679.
[123]Vinay Singh, Vandana Bhattacherjee, et al. An Analysis of Dependency of Coupling on Software Defects [J]. ACM SIGSOFT Software Engineering Notes, 2012,37(1):1-6.
[124]Cheng Li, Singhal, V., et al. A study of the internal and external effects of concurrency bugs [C] IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Germany,2010:221-230.
[125]Edward Chuah, Shyh-hao Kuo, Paul Hiew. Diagnosing the Root-Causes of Failures from Cluster Log Files [C]. International Conference on High Performance Computing (HIPC), Singapore,2010:1-10.
[126]Emilio Serrano, Andres Munoz, et al. An approach to debug interactions in multi-agent system software tests [J]. Information Sciences,2012,205(1):38-57.
[127]Adam J. Oliner, Alex Aiken. Online Detection of Multi-Component Interactions in Production Systems [C] IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN) Stanford, CA, USA,2011:49-60.
[128]Cindy Rubio-Gonzalez, aryadi S. Gunawi Ben Liblit. Error Propagation Analysis for File Systems [C] Proceedings of the ACM SIGPLAN conference on Programming Language Design and Implementation, USA,2009:270-280.
[129]Chidamber S R, Kemerer C F. A metrics suite for object oriented design[J]. IEEE Transactions on Software Engineering,1994,20(6):476-493.
[130]Pradeep Singh, Shrish Verma. Empirical Investigation of Fault Prediction Capability of Object Oriented Metrics of Open Source Software [C]. International Joint Conference on Computer Science and Software Engineering (JCSSE), India, 2012:323-327.
[131]Challet D, Lombardoni A. Bug propagation and debugging in asymmetric software structures [J].Physical Review E,2004,70(4):1015-1030.
[132]Wei-Feng Pan, Bing Li, et al. Measuring Structural Quality of Object-Oriented Software via Bug Propagation Analysis on Weighted Software Networks [J]. Journal of Computer Science and Technology,2010,25(6):1202-1213.
[133]M. Lipow. Number of faults per line of code [J]. IEEE Trans.on Software Engineering,1982,8(4):437-439.
[134]姜淑娟,徐宝文,等.一种基于异常传播分析的依赖性分析方法[J].软件学报,2007,18(4)：832-841.
[135]Antonio Filieril, Carlo Ghezzil,etc. Reliability Analysis of Component-Based Systems with Multiple Failure Modes [C]. CBSE,2010:1-20.
[136]Zhao H, Song D, Dong Y. Design and Implementation of AADL Model Safety Assessment Tool[C] 12th International Conference on Quality Software (QSIC), 2012:251-257.
[137]Honglian L, Hong F, Ju T, et al. A Novel Prediction Algorithm of DR Position Error Based on Bayesian Regularization Back-propagation Neural Network [J]. Telkomnika Indonesian Journal of Electrical Engineering,2012,11 (7):212-223.
[138]Avizienis A, Laprie J, Randell B, et al. Basic Concepts and Taxonomy of Dependable and Secure Computing [J]. Nato Security Through Science Series E Human And Societal Dynamics,2007,23(10):11-33.
[139]Cortellessa V, Grassi V. A modeling approach to analyze the impact of error propagation on reliability of component-based systems [C] Component-Based Software Engineering, Springer Berlin Heidelberg,2007:140-156.
[140]Hiller, M., Jhumka, A., Suri, N. Epic. Profiling the propagation and effect of data errors in software [J]. IEEE Transactions Computers,2004,53(5):512-530.
[141]Ammar H, Nassar D, Abdelmoez W, et al. A framework for experimental error propagation analysis of software architecture specifications[C] Proc. of International Symposium on Software Reliability Engineering, Los Alamitos, 2002:23-29.
[142]Elmqvist J, Nadjm-Tehrani S. Safety-oriented design of component assemblies using safety interfaces [J]. Electronic Notes in Theoretical Computer Science,2007, 182(3):57-72.
[143]L. Grunske and R. Neumann. Quality Improvement by Integrating Non-Functional Properties in Software Architecture Specification [C] Proceedings of the Second Workshop on Evaluating and Architecting System Dependability, 2002:453-459.
[144]A. E. Rugina, K. Kanoun. An architecture-based dependability modeling framework using AADL[C] Proceedings of International Conference on Software Engineering and Applications,2006:236-241.
[145]P. Popic, D. Desovski, W. Abdelmoez. Error propagation in the reliability analysis of component-based systems [C] Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering,2005:337-342.
[146]Yi Min Mao et al. An Intrusion Detection Model Based on Mining Maximal Frequent Itemsets over Data Streams [J]. Applied Mechanics and Materials,2013, 339(7):341-348.
[2]杨芙清,吕建,梅宏.网构软件技术体系：一种以体系结构为中心的途径[J].中国科学E辑,2008,38(6)：818-828.
[3]马于涛,何克清,李兵,刘婧.网络化软件的复杂网络特性实证[J].软件学报,2011,22(3)：381-407.
[4]梅宏,刘譞哲.互联网时代的软件技术：现状与趋势[J].科学通报,2010,55(13)：1214-1220.
[5]黄宇,余建平,马晓星,等.开放环境特性感知技术[J].软件学报,2011,22(5)：865-876.
[6]陈火旺,王戟,董威.高可信软件工程技术[J].电子学报,2003,31(12A)：1933-1938.
[7]Zheng ZhiMing, MA ShiLong2, Li Wei,et al. Complexity of software trustworthiness and its dynamical statistical analysis methods [J]. Science in China Series F:Information Sciences,2009,52(9):1651-1657.
[8]Murphy G C, Murphy-Hill E. What is trust in a recommender for software development? [C]Proceedings of the 2nd International Workshop on Recommendation Systems for Software Engineering. ACM,2010:57-58.
[9]Koziolek H. Performance evaluation of component-based software systems:A survey [J]. Performance Evaluation,2010,67(8):634-658.
[10]Christopher R. Myers. Software systems as complex networks:Structure,function, and evlovability of software collaboration graphs [J]. Physical Review E,2003,
[11]Li H, Han J, Wang Y. A New Method for Modeling Complex Network Topology of Software Systems [J]. Appl. Math,2013,7(3):1225-1228.
[12]LianWen, R. Geoff Dromey, Diana Kirk.Software Engineering and Scale-Free Networks [J]. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics,2009,39(3):648-657.
[13]S. Jenkins, S.R. Kirk. Software architecture graphs as complex networks:A novel partitioning scheme to measure stability and evolution [J]. Information Sciences, 2007,177 (2007):2587-2601.
[14]WangH, He K, BING LI, et al. On some recent advances in complex software networks:Modeling, analysis, evolution and applications [J]. International Journal of Bifurcation and Chaos,2012,22(02):1-15.
[15]Subelj L, Bajec M. Community structure of complex software systems:Analysis and applications [J]. Physical A:Statistical Mechanics and its Applications,2011, 390(16):2968-2975.
[16]YangG, Jia L, Shuai S, et al. Weighted Networks of Object-Oriented Software Systems:The Distribution of Vertex Strength and Correlation[C] Proceedings of the 2012 International Conference on Communication, Electronics and Automation Engineering. Springer Berlin Heidelberg,2011:1185-1190.
[17]AroraD, Khanna P, Tripathi A, et al. Software quality estimation through object oriented design metrics [J]. IJCSNS,2011,11(4):100.
[18]彭成,杨路明,满君丰.不完全事务行为踪迹标记研究[J].小型微型计算机系统,2011,32(8)：1593-1598.
[19]彭成,杨路明,满君丰.带部分标记的软件行为踪迹标记研究[J].小型微型计算机系统,2013,34(3)：466-470.
[20]彭成,杨路明,满君丰.网络化软件交互行为动态建模[J].电子学报,2013,41(2)：314-320.
[21]Northrop L, Feiler P, et al. Ultra-Large-Scale systems:The software challenge of the future.2006. http://www.sei.cmu.edu/uls/uls.pdf
[22]Wang H, He K, Li B. Exploring networked software [C] Networking, Sensing and Control (ICNSC),2010 International Conference on. IEEE,2010:470-475.
[23]Barabasi AL, Albert R. Emergence of scaling in random networks [J].Science,1999, 286(5439):509-512.
[24]Donnet B. Internet Topology Discovery [M] Data Traffic Monitoring and Analysis. Springer Berlin Heidelberg,2013:44-81.
[25]Laird P, Barrett S. Towards dynamic evolution of domain specific languages [J]. Software Language Engineering,2010,5969 (2010):144-153.
[26]He KQ, Liang P, Peng R, Li B, Liu J. Requirement emergence computation of networked software [J].Frontiers of Computer Science in China,2007, 1(3):322-328.
[27]方锦清,汪小帆,郑志刚.非线性网络的动力学复杂性的研究[J].复杂系统与复杂性科学,2010,7(002)：5-9.
[28]Erdos P, Renyi A. On random graphs I. [J].Publications Mathematical,1959, 6(1959):290-297.
[29]Erdos P, Renyi A. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences,1960, 5(1960):17-61.
[30]Watts DJ, Strogatz SH. Collective dynamics of small-world networks [J].Nature, 1998,393(6684):440-442.
[31]Re'ka Albert, Albert-La'szlo'Baraba'si. Statistical mechanics of complex networks [J]. Reviews of Modern Physics,2002,74(1):47-97.
[32]Faloutsos C, Faloutsos M, et al. On power-law relationships of the Internet topology. [C]In:Proc. of the ACM SIGCOMM,1999:251-262.
[33]Kumar R, Raghavan P, etal. Trawling the Web for emerging cyber-communities[J]. Computer Networks,1999,31(11-16):1481-1493.
[34]Albert R, Jeong H, Barabasi AL. Diameter of the World-Wide Web [J]. Nature, 1999,401(6749):130-131.
[35]Broder A, Kumar R, et al. Wiener J. Graph structure in the Web [J]. Computer Networks,2000,33(1/6):309-320.
[36]Adamic LA. The small world Web[C] In:Proc. of the ECDL 1999, LNCS 1696. Berlin:Springer-Verlag,1999:443-452.
[37]Steyvers M, Tenenbaum JB. The large-scale structure of semantic networks: Statistical analyses and a model of semantic growth [J].Cognitive Science,2005, 29(1):41-78.
[38]Cheng G, Qu Y. Term dependence on the semantic Web[C] In:Proc. of the ISWC 2008, LNCS 5318. Berlin:Springer-Verlag,2008:665-680.
[39]Valverde S, Cancho R, Sole R. Scale free networks from optimal design [J]. Euro physics Letters,2002,60(4):512-517.
[40]Cai K Y, Yin B B. Software execution processes as an evolving complex network [J]. Information Sciences,2009,179(12):1903-1928.
[41]Jones CB. Systematic Software Development Using VDM [M].Prentice Hall International(UK)Ltd. Hertfordshire, UK,1990:1-20.
[42]Hall J G, Jacob J L, Mc Dermid J A, et al. Towards a Z Method:the Two Button press Case Study [J].IEEE Colloquium on Practical Application of Formal Methods,1995,19(5):1-3.
[43]Bodei C, Degano P, Nielson F, et al. Control Flow Analysis for the π calculus [J].Springer Lecture Notes in Computer Science.1998,1466:481-488.
[44]Roberto Barbuti, Nicoletta De Francesco, et al. Reduced Models for Efficient CCS Verification [J]. Formal Methods in System Design,2005,26(3):319-350.
[45]Gouasmi T, Regayeg A, et al. Automatic Generation of an Operational CSP-Z Specification from an Abstract Temporal^ Z Specification[C] Computer Software and Applications Conference Workshops (COMPSACW),2012:248-253.
[46]Albers K, Slomka F. An event stream driven approximation for the analysis of real-time systems[C] Real-Time Systems,2004. ECRTS,2004:187-195.
[47]Xuxian Jiang, Xingquan Zhu. vEye:behavioral footprinting for self-propagating worm detection and profiling[J]. Knowledge Information System,2009,18(2): 231-262.
[48]Luiz Fernando Rust C. Carmo, et al. Trust Evaluation for Web Applications based on Behavioral Analysis. [C] Sandton, South Africa. SEC 2007:61-72.
[49]C. Platzer, Trust-based Security in Web Services [D].Master's Thesis, Information Systems Institute, Technical University of Vienna, Austria,2004.
[50]Pusara M, Brodley C E. User re-authentication via mouse movements [C]Proceedings of the 2004 ACM workshop on Visualization and data mining for computer security. ACM,2004:1-8.
[51]T. Lane, C. Brodley. Temporal Sequence Learning and Data Reduction for Anomaly Detection [J].ACM Transactions on Information and System Security, 1999,2(3):295-331.
[52]K. Chandy, L. Lamport. Distributed Snapshots:Determining Global States of Distributed Systems [J]. ACM Tran. on Computer Systems,1985,3(1):63-75.
[53]M. Mansouri-Samani, M. Sloman. Monitoring distributed systems [J]. Network, IEEE,1993,7(6):20-30.
[54]Christopher Ackermann, Mikael Lindvall, Rance Cleaveland. Towards Behavioral Reflexion Models [C] Reliability Society Mysuru, India:IEEE Computer Society, 2009:175-184.
[55]Jonathan E. Cook, Alexander L. Wolf. Discovering Models of Software Processes from Event-Based Data [J].ACM Transactions on Software Engineering and Methodology,1998,7(3):215-249.
[56]Tao Li, Wei Peng, Charles Perng, Sheng Ma, and Haixun Wang. An Integrated Data-Driven Framework for Computing System Management [J]. IEEE Transactions on Systems,2010,40(1):90-99.
[57]Chun ying Zhao, Jun Kong, and Kang Zhang. Program Behavior Discovery and Verification:A Graph Grammar Approach [J]. IEEE Transactions on Software Engineering,2010,36(3):431-447.
[58]Ball T, Levin V, et al. A decade of software model checking with SLAM [J]. Communications of the ACM,2011,54(7):68-76.
[59]Cimatti A, Griggio A, et al. KRATOS-A Software Model Checker for SystemC [C] Computer Aided Verification. Springer Berlin/Heidelberg,2011:310-316.
[60]ZhenLi,JunFeng Tian and Liu Yang. An Improved Software Behavior Model in System Call Level and Trustworthiness Evaluation [J]. Information Technology Journal,2011,10(11):2208-2213.
[61]傅建明,陶芬,王丹,张焕国.基于对象的软件行为模型[J].软件学报,2011,22(11)：2716-2728.
[62]Curtis E.Hrischuk, Murray Woodside. Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System [J]. IEEE Transaction on Software Engineering,2002,28(4):321-338.
[63]Selvaraj Srinivasan, R. Rajaram. A Decentralized Deadlock Detection and Resolution Algorithm for Generalized Model in Distributed Systems [J]. Distributed and Parallel Databases,2011,29(4):261-276.
[64]J.Tan, X.Pan, S.Kavulya, R.G, et al. SALSA:Analyzing Logs as State Machines [C] USENIX Workshop.San Diego, CA:USENIX,2008:6-6.
[65]J.Tan, X.Pan, S.Kavulya, R.G, et al. Mochi:Visual Log-Analysis Based Tools for Debugging Hadoop [C] IEEE International Conference on Distributed Computing Systems Workshops,2010:795-806.
[66]J.Yang and D.Evans. Dynamically Inferring Temporal Properties [C] Association for Computing Machinery,2004:23-28.
[67]David Lo and Shahar Maoz. Scenario-based and value-based specification mining: better together [J]. Autom Software Engineering,2012,19(l):423-458.
[68]J. Whittle and J. Schumann. Generating State chart Designs from Scenarios [C] New York, ACM. Limerick, Ireland:IEEE-CS Computer Society,2000:314-323.
[69]C. Damas et al. Generating Annotated Behavior Models from End-User Scenarios [J]. IEEE Transaction on Software Engineering,2005,31(12):1056-1073.
[70]Yang J, Evans D, Bhardwaj D, et al. Perracotta:mining temporal API rules from imperfect traces[C] Proceedings of the 28th international conference on Software engineering. ACM,2006:282-291.
[71]Michael Ernst, Jake Cockrell, et al. Dynamically discovering likely program invariants to support program evolution. [J].IEEE Transactions on Software Engineering,2001,27(2):99-123.
[72]S. McCamant, M.D. Ernst. Predicting problems caused by component upgrades [C] in proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, ACM Press,2003:287-296.
[73]McCamant, M. D. Ernst. Early identification of incompatibilities in multi-component upgrades[C] In ECOOP 2004 Object-Oriented Programming, 18th European Conference, Olso, Norway,2004:1-25.
[74]L. Mariani, M. Pezze. Behavior Capture and Test:Automated Analysis of Component Integration[C]in proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems, IEEE Computer Society,2005:292-301.
[75]L. Mariani, S. Papagiannakis et al. Compatibility and Regression Testing of COTS-component-based Software[C]in Proceedings of the 29th International Conference on Software Engineering (ICSE2007),2007:85-95.
[76]S. Hangal and M.s. Lam. Tracking down software bugs using anomaly detection [C]in proceedings of the 24th International Conference on Software Engineering, IEEE Computer Society,2002:291-301.
[77]T. Xie, D. Notkin.Checking inside the black box:regression testing by comparing value spectra [J].IEEE Transactions on Software Engineering,2005,31(10), 869-883.
[78]L. Mariani, F. Pastore et al. Dynamic Analysis for Diagnosing Integration Faults [J]. IEEE Transactions on Software Engineering,2011,37(4):486-508.
[79]A. Babenko, L. Mariani. AVA:automated interpretation of dynamically detected anomalies[C] Proceedings of the International Symposium on Software Testing and Analysis (ISSTA),2009,237-248.
[80]J. Perkins, S. Kim, et al. Automatically patching errors in deployed software[C] Proceedings of the 22nd Symposium on Operating Systems Principles. ACM Press, 2009,87-102.
[81]Hopcroft J E, Karp R M. An n^5/2 algorithm for maximum matching in bipartite graphs [J]. SIAM Journal on Computing,1973,2(4):225-231.
[82]Glover F. Maximum matching in a convex bipartite graph [J]. Naval Research Logistics Quarterly,1967,14(3):313-316.
[83]Yannakakis M. Computing the minimum fill-in is NP-complete [J]. SIAM Journal on Algebraic Discrete Methods,1981,2(1):77-79.
[84]Karp R M, Vazirani U V, et al. An optimal algorithm for on-line bipartite matching[C] Proceedings of the twenty-second annual ACM symposium on Theory of computing. ACM,1990:352-358.
[85]Kuhn H W. The Hungarian method for the assignment problem [J]. Naval research logistics quarterly,2006,2(1-2):83-97.
[86]Zhu H, Zhou M C. Efficient Role Transfer Based on Kuhn-Munkres Algorithm [J]. Systems, Man and Cybernetics, Part A:Systems and Humans, IEEE Transactions on,2012,42(2):491-496.
[87]ARM. http://www.opengroup.org/tech/management/arm/.2013, June
[88]WALKER R J, et al. An initial assessment of aspect-oriented programming [C].Proc of the 21st International Conference on Software Engineering.1999: 120-130.
[89]李仁杰,张瞩熹,等.基于监控的可信软件构造模型研究与实现[J].计算机应用研究,2009,26(12)：4584-4588.
[90]Jensen PA, Barnes J W. Network flow programming [M]. Krieger,1987.
[91]Mairal J, Jenatton R, et al. Network flow algorithms for structured sparsity [J]. arXivpreprint arXiv,2010,1008(5209):1-30.
[92]Bazaraa M S, Jarvis J J, et al. Linear programming and network flows[M]. New York:Wiley,1990:556-560.
[93]Eiselt H A, Sandblom C L. Network Flow Algorithms [M] Integer Programming and Network Models. Springer Berlin Heidelberg,2000:399-434.
[94]Cheriyan J, Maheshwari S N. Analysis of preflow push algorithms for maximum network flow [J]. SIAM Journal on Computing,1989,18(6):1057-1086.
[95]Dantzig G Linear programming and extensions [M].Princeton University press, 1998.
[96]Goldfarb D, Hao J. A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O (n 2 m) time [J]. Mathematical Programming, 1990,47(1):353-365.
[97]Orlin J B. A faster strongly polynomial minimum cost flow algorithm [J]. Operations research,1993,41(2):338-350.
[98]Ford Jr L R, Fulkerson D R, et al. Flows in networks [J]. Physics Today,1963, 1963(7):16-54.
[99]Ford L R, Fulkerson D R. Maximal flow through a network [J]. Canadian Journal of Mathematics,1956,8(3):399-404.
[100]Dinic E A. Algorithm for solution of a problem of maximum flow in networks with power estimation [C] Soviet Math. Dokl.1970,11(5):1277-1280.
[101]Edmonds J, Karp R M. Theoretical improvements in algorithmic efficiency for network flow problems [J]. Journal of the ACM (JACM),1972,19(2):248-264.
[102]Yakovleva M A. A problem on minimum transportation cost [J]. Applications of mathematics in economic research,1959:390-399.
[103]Minty G J, Minty G J. Monotone networks [J]. Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences,1960,257(1289): 194-212.
[104]Fulkerson D R. An out-of-kilter method for minimal-cost flow problems [J]. Journal of the Society for Industrial & Applied Mathematics,1961,9(1):18-27.
[105]Tardos E. A strongly polynomial minimum cost circulation algorithm [J]. Combinatorica,1985,5(3):247-255.
[106]Jewell W S. Optimal flow through networks [D]. Massachusetts Institute of Technology, Department of Electrical Engineering,1958.
[107]Jewell W S. New Methods in Mathematical Programming-Optimal Flow through Networks with Gains [J]. Operations Research,1962,10(4):476-499.
[108]Onaga K. Dynamic programming of optimum flows in lossy communication nets [J]. Circuit Theory, IEEE Transactions on,1966,13(3):282-287.
[109]Kapoor S, Vaidya P M. Fast algorithms for convex quadratic programming and multicommodity flows[C] Proceedings of the eighteenth annual ACM symposium on Theory of computing. ACM,1986:147-159.
[110]Goldberg A V, Plotkin S A, Tardos E. Combinatorial algorithms for the generalized circulation problem [J]. Mathematics of Operations Research,1991, 16(2):351-381.
[111]Konig D. Theorie der endlichen und unendlichen Graphen[M].American Mathematical Soc.,2001,113-245.
[112]Even S, Tarjan R E. Network flow and testing graph connectivity [J]. SIAM journal on computing,1975,4(4):507-518.
[113]Tomizawa N. On some techniques useful for solution of transportation network problems [J]. Networks,2006,1(2):173-194.
[114]杨涛,肖田元,等.基于层次自动机的应用软件行为建模[J].系统仿真学报,2005,17(4)：778-781.
[115]Forrest S.A sense of self for UNIX processes[C]Proc.of the IEEE Symp. on Security and Privacy. Oakland:IEEE Press,1996:120-128.
[116]Sekar R, et al.A fast Automaton-Based method for detecting anomalous program behaviors[C]IEEESymp.on Security and Privacy.Oakland:IEEE Press, 2001:144-155.
[117]Cassandras C G, Lafortune S. Introduction to discrete event systems [M]. Kluwer academic publishers,1999,118-213.
[118]钱能.C++程序设计教程[M].北京：清华大学出版社,1999,153-172.
[119]Liu W, Hethcote H W, Levin S A. Dynamical behavior of epidemiological models with nonlinear incidence rates[J]. Journal of mathematical biology,1987,25(4): 359-380.
[120]Ren J, Yang X, Zhu Q, et al. A novel computer virus model and its dynamics [J]. Nonlinear Analysis:Real World Applications,2012,13(1):376-384.
[121]满君丰.开放网络环境下软件行为监测与分析[D].长沙：中南大学,2010.
[122]徐建军,谭庆平,熊磊,叶俊.一种针对软错误的程序可靠性定量分析方法[J].电子学报,2011,39(3)：675-679.
[123]Vinay Singh, Vandana Bhattacherjee, et al. An Analysis of Dependency of Coupling on Software Defects [J]. ACM SIGSOFT Software Engineering Notes, 2012,37(1):1-6.
[124]Cheng Li, Singhal, V., et al. A study of the internal and external effects of concurrency bugs [C] IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Germany,2010:221-230.
[125]Edward Chuah, Shyh-hao Kuo, Paul Hiew. Diagnosing the Root-Causes of Failures from Cluster Log Files [C]. International Conference on High Performance Computing (HIPC), Singapore,2010:1-10.
[126]Emilio Serrano, Andres Munoz, et al. An approach to debug interactions in multi-agent system software tests [J]. Information Sciences,2012,205(1):38-57.
[127]Adam J. Oliner, Alex Aiken. Online Detection of Multi-Component Interactions in Production Systems [C] IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN) Stanford, CA, USA,2011:49-60.
[128]Cindy Rubio-Gonzalez, aryadi S. Gunawi Ben Liblit. Error Propagation Analysis for File Systems [C] Proceedings of the ACM SIGPLAN conference on Programming Language Design and Implementation, USA,2009:270-280.
[129]Chidamber S R, Kemerer C F. A metrics suite for object oriented design[J]. IEEE Transactions on Software Engineering,1994,20(6):476-493.
[130]Pradeep Singh, Shrish Verma. Empirical Investigation of Fault Prediction Capability of Object Oriented Metrics of Open Source Software [C]. International Joint Conference on Computer Science and Software Engineering (JCSSE), India, 2012:323-327.
[131]Challet D, Lombardoni A. Bug propagation and debugging in asymmetric software structures [J].Physical Review E,2004,70(4):1015-1030.
[132]Wei-Feng Pan, Bing Li, et al. Measuring Structural Quality of Object-Oriented Software via Bug Propagation Analysis on Weighted Software Networks [J]. Journal of Computer Science and Technology,2010,25(6):1202-1213.
[133]M. Lipow. Number of faults per line of code [J]. IEEE Trans.on Software Engineering,1982,8(4):437-439.
[134]姜淑娟,徐宝文,等.一种基于异常传播分析的依赖性分析方法[J].软件学报,2007,18(4)：832-841.
[135]Antonio Filieril, Carlo Ghezzil,etc. Reliability Analysis of Component-Based Systems with Multiple Failure Modes [C]. CBSE,2010:1-20.
[136]Zhao H, Song D, Dong Y. Design and Implementation of AADL Model Safety Assessment Tool[C] 12th International Conference on Quality Software (QSIC), 2012:251-257.
[137]Honglian L, Hong F, Ju T, et al. A Novel Prediction Algorithm of DR Position Error Based on Bayesian Regularization Back-propagation Neural Network [J]. Telkomnika Indonesian Journal of Electrical Engineering,2012,11 (7):212-223.
[138]Avizienis A, Laprie J, Randell B, et al. Basic Concepts and Taxonomy of Dependable and Secure Computing [J]. Nato Security Through Science Series E Human And Societal Dynamics,2007,23(10):11-33.
[139]Cortellessa V, Grassi V. A modeling approach to analyze the impact of error propagation on reliability of component-based systems [C] Component-Based Software Engineering, Springer Berlin Heidelberg,2007:140-156.
[140]Hiller, M., Jhumka, A., Suri, N. Epic. Profiling the propagation and effect of data errors in software [J]. IEEE Transactions Computers,2004,53(5):512-530.
[141]Ammar H, Nassar D, Abdelmoez W, et al. A framework for experimental error propagation analysis of software architecture specifications[C] Proc. of International Symposium on Software Reliability Engineering, Los Alamitos, 2002:23-29.
[142]Elmqvist J, Nadjm-Tehrani S. Safety-oriented design of component assemblies using safety interfaces [J]. Electronic Notes in Theoretical Computer Science,2007, 182(3):57-72.
[143]L. Grunske and R. Neumann. Quality Improvement by Integrating Non-Functional Properties in Software Architecture Specification [C] Proceedings of the Second Workshop on Evaluating and Architecting System Dependability, 2002:453-459.
[144]A. E. Rugina, K. Kanoun. An architecture-based dependability modeling framework using AADL[C] Proceedings of International Conference on Software Engineering and Applications,2006:236-241.
[145]P. Popic, D. Desovski, W. Abdelmoez. Error propagation in the reliability analysis of component-based systems [C] Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering,2005:337-342.
[146]Yi Min Mao et al. An Intrusion Detection Model Based on Mining Maximal Frequent Itemsets over Data Streams [J]. Applied Mechanics and Materials,2013, 339(7):341-348.