检索结果-内蒙古大学图书馆

Research on Intrusion Detection Method of Web Service Composition

International Journal of Technology Management 2013年第2期 104-106页

作者： Xiaosen Wen Xijing University Xi'anShaanxi710123 China

The paper takes Web service composition document as the research object, through the analysis of the documents, the port and address on the Web server, to create a Web intrusion detection model. The core of the model will monitor the Web server host resources, and finally discusses in detail the design and implementation of resource monitoring system. Intrusion detection model proposed can effectively regulate the behavior of users in this paper, allowing users follow a pre-standard service to call service providers, largely to protect the security of Web services.

关键词： Web attack network intrusion detection anomaly detection control flow graph

来源：评论

学校读者我要写书评

暂无评论

HIGH-LEVEL DATA flow ANALYSIS

引用

COMMUNICATIONS OF THE ACM 1977年第10期20卷 712-724页

作者： ROSEN, BK IBM CORP THOMAS J WATSON RES CTRDEPT COMP SCIYORKTOWN HTSNY 10598

In contrast to the predominant use of low-level intermediate text, high-level data flow analysis deals with programs essentially at source level and exploits the control flow information implicit in the parse tree. The need for high-level flow analysis arises from several aspects of recent work on advanced methods of program certification and optimization. This paper proposes a simple general method of high-level data flow analysis that allows free use of escape and jump statements, avoids large graphs when compiling large programs, facilitates updating of data flow information to reflect program changes, and derives new global information helpful in solving many familiar global flow analysis problems. An illustrative application to live variable analysis is presented. Many of the graphs involved are constructed and analyzed before any programs are compiled, thus avoiding certain costs that low-level methods incur repeatedly at compile time. [ABSTRACT FROM AUTHOR]

关键词： control flow graph data flow analysis escapes exits goto statements high-level language jumps structured programming

来源：评论

学校读者我要写书评

暂无评论

Interprocedural and Intraprocedural Alias Analysis Algorithms

Interprocedural and Intraprocedural Alias Analysis Algorithm...

引用

2016 5th International Conference on Advanced Materials and Computer Science(ICAMCS 2016)

作者： Shaotao Li Yong Cai College of Computer Science and Electronic Engineering Hunan University Key Laboratory for Micro-nano Optoeletronic Devices of Ministry of Education

The quantity and significance of web application increases ***,the influence of vulnerabilities in web application grows as *** tools are urgently needed because manual code reviews are inefficient and ***,previous static code detection tools lack of alias analysis between variables in codes,leading to possible false positives or false *** solve this problem,we propose a set of sound and precise alias analysis algorithms which can conduct intraprocedural and interprocedural alias *** we apply them to a previous static detection *** on practical open source web applications and manually written test cases show that system with alias analysis can handle complex alias relationship accurately and detect vulnerabilities related to alias with greater ***,alias analysis' s impact on scanning speed of the system is negligible.

关键词： Vulnerabilities Detection Static Analysis Parse Tree control flow graph Alias Analysis

来源：评论

学校读者我要写书评

暂无评论

Markov chain dynamic representation model for reliability testing

Markov chain dynamic representation model for reliability te...

引用

International Conference on the Experience of Designing and Application of CAD Systems in Microelectronics

作者： Yakovyna Vitaliy Serdyuk Pavlo Nytrebych Oksana Software Department Lviv Polytechnic National University

ISBN: (纸本)9781467364614

In this paper we propose to use software classes as actual components and to build the control flow graph to represent software architecture using suffix tree. The proposed model of dynamic collection and storage of reliability testing data using high order Markov chains results in less memory usage than matrix representation and allows easy dynamic changes of Markov process order. As an example of the model we suggest to use new pattern based on Composite design pattern.

关键词： Architecture-based software reliability UML class diagram control flow graph

来源：评论

学校读者我要写书评

暂无评论

A control flow Reconstruction Algorithm for Binary Code with Mixed Codec Mode

A Control Flow Reconstruction Algorithm for Binary Code with...

引用

2010 Third Pacific-Asia Conference on Web Mining and Web-based Application (WMWA 2010)

作者： ZHAO Yuan,ZENG Guangyu,HU Gang Department of Computer Science and Technology Zhengzhou Institute of Information Science and Technology Zhengzhou,China

control flow is the basis of program analysis and comprehension,and the reconstruction of control flow is the start and sticking point in Firm-Code Reversing *** contrast with structured binary executable file (PE,ELF,etc.),firm-code is unstructured and mixed-coded,which makes it unsuitable to use traditional control flow reconstruction algorithm in the control flow reconstruction of *** researchers have been working on Firm-Code Reversing Analysis for a long time and solved many problems such as distinction between instructions and data in binary code,calculus of destination address in transform instruction using indirect addressing mode,recovery of jump table and so on,whereas the problem of reconstructing control flow from binary code with mixed codec mode is rarely *** this paper,we study binary code with mixed codec mode,present a control flow reconstruction algorithm for it and then analyze the time complexity of the algorithm.

关键词： control flow control flow graph mixed codec mode reverse engineering control flow reconstruction

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm for Basis Path Testing

An Improved Algorithm for Basis Path Testing

引用

2011 International Conference on Business Management and Electronic Information(BMEI 2011)

作者： Du Qingfeng,Dong Xiao School of Software Engineering Tongji University Shanghai,China

Basis path testing is an important test method in white box *** method generates a set of linearly independent paths,which we called basis paths,from control flow graph (CFG) and all the other paths can be expressed by ***,when applying these basis paths to designing test cases,we will always find that some of them are infeasible when understanding from business *** this paper we put forward a new idea to simply CFG,at the same time to avoid the generation of infeasible paths in the set of basis paths.

关键词： white box testing control flow graph basis path testing method improvement

来源：评论

学校读者我要写书评

暂无评论

POWER-AWARE control flow CHECKING COMPILATION: USING LESS BRANCHES TO REDUCE POWER DISSIPATION

POWER-AWARE CONTROL FLOW CHECKING COMPILATION: USING LESS BR...

引用

2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

作者： YAN-XIA WU GUO-CHANG GU KE-HUI WANG College of Computer Science and Technology Harbin Engineering University Harbin 150001 China

Satellite-borne embedded systems require the properties of low-powered and reliability in the spatial radiation environment The control flow checking is an effective way for the running systems to prevent the broken-down caused by Single Event *** software control flow checking uses a great deal of branch instructions to detect errors, thus brings great overhead in power *** this paper, a partition method of basic block is *** this partition method, branch instructions are reduced greatly, while the high error detection coverage remain *** simulated results show that compared with the traditional control flow Checking by Software Signatures(CFCSS) control flow checking algorithm, the Improved algorithm can reduce total branch instructions by over 10％, reduce the power dissipation by nearly 9％, without decreasing the error detection coverage.

关键词： control flow graph Base node control flow checking Low power dissipation

来源：评论

学校读者我要写书评

暂无评论

Iterative-free program analysis 03

Iterative-free program analysis

引用

Proceedings of the eighth ACM SIGPLAN international conference on Functional programming

作者： Mizuhito Ogawa Zhenjiang Hu Isao Sasano Japan Advanced Institute of Science and Technology The University of Tokyo

ISBN: (纸本)9781581137569

Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed point is commonly computed through an iterative procedure that repeats tracing until *** paper proposes a new method to analyze programs through recursive graph traversals instead of iterative procedures, based on the fact that most programs (without spaghetti GOTO) have well-structured control flow graphs, graphs with bounded tree width. Our main techniques are; an algebraic construction of a control flow graph, called SP Term, which enables control flow analysis to be defined in a natural recursive form, and the Optimization Theorem, which enables us to compute optimal solution by dynamic *** illustrate our method with two examples; dead code detection and register allocation. Different from the traditional standard iterative solution, our dead code detection is described as a simple combination of bottom-up and top-down traversals on SP Term. Register allocation is more interesting, as it further requires optimality of the result. We show how the Optimization Theorem on SP Terms works to find an optimal register allocation as a certain dynamic programming.

关键词： tree width control flow graph register allocation catamorphism program analysis dynamic programming SP term

来源：评论

学校读者我要写书评

暂无评论

Static Analysis of Run-Time Inter-Thread Interferences in Shared Cache Multi-Core Architectures based on Instruction Fetching Timing

Static Analysis of Run-Time Inter-Thread Interferences in Sh...

引用

2011 IEEE International Conference on Computer Science and Automation Engineering(CSAE 2011)

作者： Fangyuan Chen School of computer National University of Defense Technology Changsha China Dongsong Zhang School of computer National University of Defense Technology Changsha China Zhiying Wang School of computer National University of Defense Technology Changsha China

For real-time systems,in order to provide the basis for schedulability analysis,it is crucial to obtain Worst-Case Execution Time （WCET） of applications,which is very challenging due to the possible runtime inter-thread interferences caused by shared resources in multi-core *** multi-core platforms with shared cache,instructions of a thread may be evicted by another co-running thread,which results in the interferences in shared *** need to consider the interferences while analyzing WCET of threads on multi-core *** paper proposes a novel approach to analyzing the worst-case cache interferences based on instruction fetching timing,while judging the interferences status through instruction fetching timing *** paper presents an algorithm for instruction fetching timing based on Depth-First-Search in control flow *** approach can reasonably estimate runtime inter-thread interferences in shared cache by introducing timing relations analysis into address mapping *** show that our proposed approach improves the tightness of WCET estimation by 19.244% on average.

关键词： Multi-Core Architectures Shared Cache Runtime Inter-Thread Interferences control flow graph Instruction Fetching Timing WCET

来源：评论

学校读者我要写书评

暂无评论

Detecting concurrently executed pairs of statements using an adapted MHP algorithm 01

Detecting concurrently executed pairs of statements using an...

引用

Proceedings of the 2001 annual ACM SIGAda international conference on Ada

作者： Zhenqiang Chen Baowen Xu Huiming Yu Southeast University Nanjing 210096 China North Carolina A&T State University Greensboro NC

ISBN: (纸本)9781581133929

Information about which pairs of statements in a program can be executed concurrently is important for improving the accuracy of dataflow analysis, optimizing programs, and detecting errors. This paper presents a new method named Concurrent control flow graph for representing concurrent Ada 95 programs in a simple and precise way. Based on this method, we develop an Adapted MHP algorithm that can statically detect all pairs of statements that may be executed concurrently. This algorithm checks not only whether a rendezvous can be triggered, but also whether it can be finished. Although this algorithm generates a conservative superset of the perfect pairs of statements, it is more precise than many existing methods.

关键词： program analysis Concurrent program MHP algorithm control flow graph

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：