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

A Stack Memory Abstraction and Symbolic Analysis Framework for executables

ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY 2016年第2期25卷 1–38页

作者： Anand, Kapil Elwazeer, Khaled Kotha, Aparna Smithson, Matthew Barua, Rajeev Keromytis, Angelos Univ Maryland Dept Elect & Comp Engn College Pk MD USA Columbia Univ Dept Comp Sci New York NY 10027 USA

This article makes three contributions regarding reverse-engineering of executables. First, techniques are presented for recovering a precise and correct stack-memory model in executables while addressing executable-specific challenges such as indirect control transfers. Next, the enhanced memory model is employed to define a novel symbolic analysis framework for executables that can perform the same types of program analyses as source-level tools. Third, a demand-driven framework is presented to enhance the scalability of the symbolic analysis framework. Existing symbolic analysis frameworks for executables fail to simultaneously maintain the properties of correct representation, a precise stack-memory model, and scalability. Furthermore, they ignore memory-allocated variables when defining symbolic analysis mechanisms. Our methods do not use symbolic, relocation or debug information, which are usually absent in deployed binaries. We describe our framework, highlighting the novel intellectual contributions of our approach and demonstrating its efficacy and robustness. Our techniques improve the precision of existing stack-memory models by 25%, enhance scalability of our basic symbolic analysis mechanism by 10x, and successfully uncovers five previously undiscovered information-flow vulnerabilities in several widely used programs.

关键词： executable code program analysis information-flow security

来源：评论

学校读者我要写书评

暂无评论

Towards Refinement Types for Time-Dependent Data-Flow Networks 15

Towards Refinement Types for Time-Dependent Data-Flow Networ...

引用

2015 ACM/IEEE International Conference on Formal Methods and Models for codesign (MEMOcode)

作者： Talpin, Jean-Pierre Jouvelot, Pierre Shukla, Sandeep Kumar INRIA Rennes Rennes France PSL Res Univ MINES ParisTech Paris France IIT Kanpur Kanpur Uttar Pradesh India

ISBN: (纸本)9781509002375

The concept of liquid clocks introduced in this paper is a significant step towards a more precise compile-time framework for the analysis of synchronous and polychromous languages. Compiling languages such as Lustre or Signal indeed involves a number of static analyses of programs before they can be synthesized into executable code, e.g., synchronicity class characterization, clock assignment, static scheduling or causality analysis. These analyses are often equivalent to undecidable problems, necessitating abstracting such programs to provide sound yet incomplete analyses. Such abstractions unfortunately often lead to the rejection of programs that could very well be synthesized into deterministic code, provided abstraction refinement steps could be applied for more accurate analysis. To reduce the number of false negatives occurring during the compilation process, we leverage recent advances in type theory - with the definition of decidable classes of value-dependent type systems - and formal verification, linked to the development of efficient SAT/SMT solvers, to provide a type-theoretic approach that considers all the above analyses as type inference problems. To simplify the exposition of our new approach in this paper, we define a refinement type system for a minimalistic, synchronous, stream-processing language to concisely represent, analyze, and verify logical and quantitative properties of programs expressed as stream-processing data-flow networks. Our type system provides a new framework for representing logical time (clocks) and scheduling properties, and to describe their relations with stream values and, possibly, other quantas. We show how to analyze synchronous stream processing programs (a la Lustre, Signal) to enable previously described analyses involved in compiling such programs. We also prove the soundness of our type system and elaborate on the adaptability of this core framework by outlining its extensibility to specific models of computatio

关键词： Timing devices Luster Language executable code Refining logical type theory Formal verification False Negative extensibility Soundness

来源：评论

学校读者我要写书评

暂无评论

A secure method for transferring active packet using digital signature schemes 10

A secure method for transferring active packet using digital...

引用

10th International Conference on Telecommunications (ICT 2003)

作者： Kim, Y Na, J Sohn, S ETRI Network Secur Dept Informat Secur Technol Div Yuseong Gu Taejon 305350 South Korea

ISBN: (纸本)0780376617

Active networks represent a new approach to network architecture. Active networks provide a much more flexible network infrastructure than traditional networks do. Flexibility is a powerful merit of active networks, but it can raise considerable security problems. Current active network researches have applied diverse techniques to solve them. Cryptographic technique is one way of protecting active networks. However it should not be applied conventionally, since active network paradigm is different from traditional one. It means that, at active network environments, active packets contain programmable codes should perform computations on intermediate-nodes as well as end-nodes. That is, since the packet sending-node does not know intermediate receiving-node, it cannot apply traditional cryptographic techniques can process each other only between end-nodes. This paper proposes a secure method for transferring active packets and performing computations using a transformed digital signature schemes with message recovery, at active network environment that intermediate packet receiving-nodes are not fixed. The proposed scheme uses transformed public key digital signature scheme that signing/verifying key pairs have almost same bit length and the verification-key storing server plays the role of key management server.

关键词： active networks active packets active nodes executable code digital signature schemes

来源：评论

学校读者我要写书评

暂无评论

Android App Protection via Interpretation Obfuscation 12

Android App Protection via Interpretation Obfuscation

引用

IEEE 12th International Conference on Dependable, Autonomic and Secure Computing (DASC)

作者： Shu, Junliang Li, Juanru Zhang, Yuanyuan Gu, Dawu Shanghai Jiao Tong Univ Lab Cryptol & Comp Secur Shanghai 200030 Peoples R China

ISBN: (纸本)9781479950799

To protect Android app from malicious reproduction or tampering, code obfuscation techniques are introduced to increase the difficulty of reverse engineering and program understanding. Current obfuscation schemes focus more on the protection of the meta information over the executable code which contains valuable or patented algorithms. Therefore, a more sophisticated obfuscator is needed to improve the protection on the executable code. In this paper we propose SMOG, a comprehensive executable code obfuscation system to protect Android app. SMOG is composed of two parts, an obfuscation engine and an execution environment. The obfuscation engine is at software vendor's side to conduct the obfuscation on the app's executable code, and then release the obfuscated app to the end-user along with an execution token. The execution environment is setup by integrating the received execution token, which endows the Android Dalvik VM the capability to execute the obfuscated app. SMOG is an easily deployed system which proves fine-grained level protection. The obfuscated app generated by SMOG could resist static and dynamic reverse engineering. Moreover, the benchmark result shows SMOG only costs about 5% more performance in dispatching the incoming bytecode to the proper interpreter.

关键词： Conferences Android App Execution Token Interpretation Obfuscation Reverse Engineering Static Disassembly Reverse engineering executable code Smog metainformation Androids Methyltestosterone Legal Executions End users

来源：评论

学校读者我要写书评

暂无评论

System Design for Enhanced Forward-Engineering Possibilities of Safety Critical Embedded Systems 17

System Design for Enhanced Forward-Engineering Possibilities...

引用

IEEE 17th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS)

作者： Krammer, Martin Karner, Michael Fuchs, Anton Virtual Vehicle Res Ctr Graz Austria

ISBN: (纸本)9781479945580

Due to the high overall complexity of embedded systems in the automotive domain, the concept and system design phases have shown to be important, as they lay the foundations for implementations. Therefore, front-loading principles are advantageous. In this work, we present a methodology for semi-formal notation based system design. In the end, we demonstrate a transformation scheme for the conversion from system models to executable code, featuring full traceability and support for hardware and software paradigms. An automotive use case demonstrates the capabilities of the outlined approach.

关键词： Embedded systems System design safety-critical software Safety critical automotive engineering Computer hardware executable code

来源：评论

学校读者我要写书评

暂无评论

Application of two executable computer codes for confidence intervals, decision levels and detection limits when the sample is counted an integer times equal to or greater than the blank

引用

JOURNAL OF RADIOANALYTICAL AND NUCLEAR CHEMISTRY 2013年第1期296卷 31-35页

作者： Potter, W. E. Strzelczyk, J. Univ Colorado Hosp Aurora CO 80045 USA

Poisson statistics are utilized throughout. The ratio of the sample count time to the blank count time is taken to be an integer. The expected blank count in the sample count time is assumed either known or well known. Confidence intervals are determined by mimicking a standard approach in discrete probability. A C++ computer code computes confidence intervals and detection limits for the expected net count. A separate code computes decision levels. executable versions of both codes have been developed which are expected to run on most Windows based computers.

关键词： Confidence interval Confidence level Computer code executable code Approximate confidence interval

来源：评论

学校读者我要写书评

暂无评论

Interval expressions - A functional model for interactive dynamic multimedia presentations

Interval expressions - A functional model for interactive dy...

引用

International Conference on Multimedia Computing and Systems

作者： Keramane, C Duda, A IMAG LAB GRENOBLE LSRF-38041 GRENOBLE 9FRANCE

We propose a new model for structured temporal composition of interactive dynamic multimedia presentations. It extends the notion of basic media segments to include executable code, live feeds, and links. The model is... 详细信息

ISBN: (纸本)0818674369

关键词： MULTI-MEDIA SYSTEM FUNCTIONAL MODELS Interactive executable code live feed

来源：评论

学校读者我要写书评

暂无评论

Non-Intrusive Documentation-Driven Integration Testing 8

Non-Intrusive Documentation-Driven Integration Testing

引用

8th IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)

作者： Haeser, Florian Breu, Ruth Univ Innsbruck Inst Comp Sci Qual Engn A-6020 Innsbruck Austria

ISBN: (纸本)9781479971251

Powerful development frameworks and adoption of agile development methods are continuously increasing release frequency, thus compress test cycles. Test automation, often relying on model based approaches, helps to reduce test time, however the introduction of related heavy weight processes is often quite challenging. In order to tackle this problem, we propose a bottom up testing approach, which in a nutshell, in the initial phase supports the integration tester in creating a semi-formal test case description and report. The approach, a textual domain specific framework, will guide the test expert in evolving the base language, in order to be tailored for a domain language of an organization. The evolved language can be linked to executable code, which enables in the long run (semi) automated model based regression testing.

关键词： executable code regression testing TESTING TIME initial phase Language DNA Integration integration Automatic testing bottom-up Frameworks content-based image retrieval VDM(Vienna Development Method) ecosystem-based approach program development method Art Therapy

来源：评论

学校读者我要写书评

暂无评论

Automatic Derivation of Statistical Algorithms: The EM Family and Beyond 02

Automatic Derivation of Statistical Algorithms: The EM Famil...

引用

Annual Conference on Neural Information Processing Systems

作者： Alexander G. Gray Bernd Fischer Johann Schumann Wray Buntine Carnegie Mellon University

ISBN: (纸本)0262025507

Machine learning has reached a point where many probabilistic methods can be understood as variations, extensions and combinations of a much smaller set of abstract themes, e.g., as different instances of the EM algorithm. This enables the systematic derivation of algorithms customized for different models. Here, we describe the AUTOBAYES system which takes a high-level statistical model specification, uses powerful symbolic techniques based on schema-based program synthesis and computer algebra to derive an efficient specialized algorithm for learning that model, and generates executable code implementing that algorithm. This capability is far beyond that of code collections such as Matlab toolboxes or even tools for model-independent optimization such as BUGS for Gibbs sampling: complex new algorithms can be generated without new programming, algorithms can be highly specialized and tightly crafted for the exact structure of the model and data, and efficient and commented code can be generated for different languages or systems. We present automatically-derived algorithms ranging from closed-form solutions of Bayesian textbook problems to recently-proposed EM algorithms for clustering, regression, and a multinomial form of PCA.

关键词： algorithms expectation-maximisation algorithm Model structures Bugs executable code Symbolic algebra derivation

来源：评论

学校读者我要写书评

暂无评论

Automating Uncompressing and Static Analysis of Conficker Worm

Automating Uncompressing and Static Analysis of Conficker Wo...

引用

IEEE Malaysia International Conference on Communications

作者： Lee Ling Chuan Chan Lee Yee Mahamod Ismail Kasmiran Jumari Faculty of Engineering & Built Environment Universiti Kebangsaan Malaysia

ISBN: (纸本)9781424455317;9781424455324

The infamous computer worm, Conficker, which targeting the Microsoft Windows operating system, was literally over the media. This malicious worm used modern malware technique, where it hide its malicious portion of the program code with a runtime generation and execution of program code and transforming it back into executable code at run time. This obfuscation technique poses obstacles to security researcher who want to understand the malicious features of new or unknown malware especially for those who want to create program of detection and methods of recovery. Our approach is based on observation that sequences of packed or hidden code in two different version of Conficker worm. Self-identifying when its runtime execution is checked against its static code mode and an automating uncompressing code is executed to unpack the packer. Following the extraction of the malicious worm, we focus our analysis on the features of Conficker worm.

关键词： Computer security Debugging Reverse engineering Malware Packing and unpacking Spyware Computer Security Debugging program code Reverse engineering worm Vermes Microsoft Windows(software) Runtime Automation executable code Packers Legal Executions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：