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

28th IEEE International Conference on Advanced Information Networking and Applications Workshops (IEEE WAINA)

作者： Alam, Shahid Horspool, R. Nigel Traore, Issa Univ Victoria Dept CS Victoria BC V8P5C2 Canada Univ Victoria Dept ECE Victoria BC V8P5C2 Canada

ISBN: (纸本)9781479936298

Because of the financial and other gains attached with the growing malware industry, there is a need to automate the process of malware analysis and provide real-time malware detection. To hide a malware, obfuscation techniques are used. One such technique is metamorphism encoding that mutates the dynamic binary code and changes the opcode with every run to avoid detection. This makes malware difficult to detect in real-time and generally requires a behavioral signature for detection. In this paper we present a new framework called MARD for Metamorphic Malware analysis and Real-Time Detection, to protect the end points that are often the last defense, against metamorphic malware. MARD provides: (1) automation (2) platform independence (3) optimizations for real-time performance and (4) modularity. We also present a comparison of MARD with other such recent efforts. Experimental evaluation of MARD achieves a detection rate of 99.6% and a false positive rate of 4%.

关键词： End Point Security Metamorphism Malware analysis and Detection control flow analysis Automation

来源：评论

学校读者我要写书评

暂无评论

Generation of dynamic control-dependence graphs for binary programs

Generation of dynamic control-dependence graphs for binary p...

引用

作者： Pogulis, Jakob Linköping University

学位级别：master

Dynamic analysis of binary files is an area of computer science that has many purposes. It is useful when it comes to debugging software in a development environment and the developer needs to know which statements affected the value of a specific variable. But it is also useful when analyzing a software for potential vulnerabilities, where data controlled by a malicious user could potentially result in the software executing adverse commands or executing malicious *** this thesis a tool has been developed to perform dynamic analysis of x86 binaries in order to generate dynamic control-dependence graphs over the execution. These graphs can be used to determine which conditional statements that resulted in a certain outcome. The tool has been developed for x86 Linux systems using the dynamic binary instrumentation framework PIN, developed and maintained by *** for utilizing the additional information about the control flow for a program available during the dynamic analysis in order to improve the control flow information have been implemented and tested. The basic theory of dynamic analysis as well as dynamic slicing is discussed, and a basic overview of the implementation of a dynamic analysis tool is presented. The impact on the performance of the dynamic analysis tool for the techniques used to improve the control flow graph is significant, but approaches to improving the performance are discussed

关键词： control-dependencies control-dependence graph intel-pin instrumentation dynamic analysis program analysis dependence graph dynamic dependence graph control dependency control flow analysis control flow Natural Sciences Computer and Information Science Computer Science Naturvetenskap Data- och informationsvetenskap Datavetenskap (datalogi) Information Technology Informationsteknologi

来源：评论

学校读者我要写书评

暂无评论

control-flow analysis of Function Calls and Returns by Abstract Interpretation

Control-Flow Analysis of Function Calls and Returns by Abstr...

引用

14th ACM SIGPLAN International Conference on Functional Programming

作者： Midtgaard, Jan Jensen, Thomas P. Roskilde Univ Roskilde Denmark CNRS F-75700 Paris France

ISBN: (纸本)9781605583327

We derive a control-flow analysis that approximates the interprocedural control-flow of both function calls and returns in the presence of first-class functions and tail-call optimization. In addition to an abstract environment, our analysis computes for each expression an abstract control stack, effectively approximating where function calls return across optimized tail calls. The analysis is systematically calculated by abstract interpretation of the stack-based CaEK abstract machine of Flanagan et al. using a series of Galois connections. Abstract interpretation provides a unifying setting in which we 1) prove the analysis equivalent to the composition of a continuation-passing style (CPS) transformation followed by an abstract interpretation of a stack-less CPS machine, and 2) extract an equivalent constraint-based formulation, thereby providing a rational reconstruction of a constraint-based control-flow analysis from abstract interpretation principles.

关键词： Languages Theory Verification control flow analysis abstract interpretation tail-call optimization continuation-passing style direct style constraint-based analysis

来源：评论

学校读者我要写书评

暂无评论

Protocol Knowledge Combined Directed Symbolic Execution for Binary Programs

Protocol Knowledge Combined Directed Symbolic Execution for ...

引用

3rd International Conference on Instrumentation & Measurement, Computer, Communication and control (IMCCC)

作者： Huang, Hui Lu, Yu-Liang Zhao, Jun Wu, Zhi-Yong PLA Elect Engn Inst Network Engn Dept Hefei Peoples R China North Elect Equipments Res Inst Beijing Peoples R China

ISBN: (纸本)9780769551227

Symbolic Execution based defect discovery techniques for binary programs are now widely applied. However, because of the path explosion problem, it's still not applicable for security analysis on large programs. A great many infeasible paths in the target program also reduce the performance. To fast generate test cases reaching the potentially vulnerable program points, this paper introduces constraints implied in input protocols to symbolic execution, calculates vulnerable point reachable control flow paths using static control flow analysis. The path information is then used to limit dynamic symbolic execution's path exploration space. Experiments prove the effectiveness of our method on performance enhancement in symbolic execution and defect discovery.

关键词： protocol knowledge vulnerable point control flow analysis directed symbolic execution

来源：评论

学校读者我要写书评

暂无评论

control flow analysis for BioAmbients

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第3期180卷 65-79页

作者： Nielson, Flemming Nielson, Hanne Riis Priami, Corrado Rosa, Debora Tech Univ Denmark Kongens Lyngby Denmark Univ Trento Trento Italy

This paper presents a static analysis for investigating properties of biological systems specified in BioAmbients. We exploit the control flow analysis to decode the bindings of variables induced by communications and to build a relation of the ambients that can interact with each other. We eventually apply our analysis to an example of gene regulation by positive feedback taken from the literature.

关键词： control flow analysis BioAmbients gene regulation

来源：评论

学校读者我要写书评

暂无评论

Can We Make It Faster? Efficient May-Happen-in-Parallel analysis Revisited

Can We Make It Faster? Efficient May-Happen-in-Parallel Anal...

引用

13th International Conference on Parallel and Distributed Computing, Applications, and Technologies (PDCAT)

作者： Chen, Congming Huo, Wei Li, Lung Feng, Xiaobing Xing, Kai Chinese Acad Sci State Key Lab Comp Architecture Beijing Peoples R China Chinese Acad Sci Grad Univ Beijing Peoples R China Univ Sci & Technol China Sch Comp Sci Anhui Peoples R China

ISBN: (纸本)9780769548791

May-Happen-in-Parallel (MHP) analysis is a very important and fundamental mechanism to facilitate concurrent program analysis, optimization and even concurrency bug detection. However, the inefficiency in its design and implementation keeps MHP analysis away from being practical and effective. In this paper, we investigate the state-of-art of iterative data flow based (IDFB) MHP analysis and propose a new design and corresponding systematic implementation. Specifically, we address the most severe efficiency problems in node process order of the work-list in the original approach, and resolve them in our design and implementation by using the concept of parallel level to avoid redundant node visits. Our intensive experimental study shows that the proposed design and implementation have a relative speed up of 29.02x compared with the original implementation, moreover, it achieves a relative speed up of 10.00x comparing to the state-of-art of non-IDFB approach which is claimed to be more efficient than the original IDFB approach. Our design and implementation are capable of achieving an order of magnitude efficiency improvement comparing to both IDFB and non-IDFB approaches.

关键词： Concurrent Program control flow analysis Conservative Efficiency Precision

来源：评论

学校读者我要写书评

暂无评论

PROGRAM MATCHING THROUGH CODE analysis AND ARTIFICIAL NEURAL NETWORKS

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2012年第2期22卷 225-241页

作者： Nascimento, Tiago M. Boccardo, Davidson R. Prado, Charles B. Machado, Raphael C. S. Carmo, Luiz F. R. C. Univ Fed Rio de Janeiro Rio De Janeiro Brazil Inmetro Natl Inst Metrol Qual & Technol Rio De Janeiro Brazil

Program matching refers to the mapping between equivalent codes written in different languages - including high-level and low-level languages. This equivalence is useful for some software engineering scenarios such as determining whether rewritten code is correct, which version of a program is being used, and whether a malware is present in the program. In the present work, we propose a novel approach to solve the executable code traceability by using program code analysis and artificial neural networks. From the program code analysis we obtained execution behavior properties of the codes, and from the artificial neural networks we judge about their correspondence. Our evaluation using real code examples shows an acceptable correspondence rate between 62% and 100% with the very low rate of 4% false positives.

关键词： Program analysis artificial neural network control flow analysis

来源：评论

学校读者我要写书评

暂无评论

Detecting and Preventing Type flaws: a control flow analysis with Tags

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期194卷 3-22页

作者： Bodei, Chiara Degano, Pierpaolo Gao, Han Brodo, Linda Univ Pisa Dipartimento Informat Via Pontecorvo I-56127 Pisa Italy Tech Univ Denmark Informat & Math Modelling DK-2800 Lyngby Denmark Univ Sassari Dipartimento Scienze Linguaggi I-07100 Sassari Italy

A type flaw attack on a security protocol is an attack where an honest principal is cheated on interpreting a field in a message as the one with a type other than the intended one. In this paper, we shall present an extension of the LySa calculus with tags attached to each field, indicating the intended types. We developed a control flow analysis for analysing the extended LySa, which over-approximates all the possible behaviour of a protocol and hence is able to capture any type confusion that may happen during the protocol execution. The control flow analysis has been applied to a number of security protocols, either subject to type flaw attacks or not. The results show that it is able to capture type flaw attacks on those security protocols.

关键词： Security Protocol control flow analysis Type Flaw Attacks

来源：评论

学校读者我要写书评

暂无评论

Relating complexity and precision in control flow analysis

Relating complexity and precision in control flow analysis

引用

12th ACM SIGPLAN International Conference on Functional Programming

作者： Van Horn, David Mairson, Harry G. Brandeis Univ Waltham MA 02254 USA

ISBN: (纸本)9781595938152

We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies related decision problems, quite apart from any algorithms that may implement their solutions. We identify a simple decision problem answered by this analysis and prove that in the 0CFA case, the problem is complete for polynomial time. The proof is based on a nonstandard, symmetric implementation of Boolean logic within multiplicative linear logic (MLL). We also identify a simpler version of 0CFA related to eta-expansion, and prove that it is complete for logarithmic space, using arguments based on computing paths and permutations. For any fixed k > 0, it is known that kCFA (and the analogous decision problem) can be computed in time exponential in the program size. For k = 1, we show that the decision problem is NP-hard, and sketch why this remains true for larger fixed values of k. The proof technique depends on using the approximation of CFA as an essentially nondeterministic computing mechanism, as distinct from the exactness of normalization. When k = n, so that the "depth" of the control flow analysis grows linearly in the program length, we show that the decision problem is complete for exponential time. In addition, we sketch how the analysis presented here may be extended naturally to languages with control operators. All of the insights presented give clear examples of how straightforward observations about linearity, and linear logic, may in turn be used to give a greater understanding of functional programming and program analysis.

关键词： languages theory complexity continuation control flow analysis eta expansion geometry of interaction linear logic normalization proofnet static analysis

来源：评论

学校读者我要写书评

暂无评论

Relating complexity and precision in control flow analysis

引用

ACM SIGPLAN NOTICES 2007年第9期42卷 85-96页

作者： Van Horn, David Mairson, Harry G. Brandeis Univ Waltham MA 02254 USA

关键词： languages theory complexity continuation control flow analysis eta expansion geometry of interaction linear logic normalization proofnet static analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：