Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
390
Certified self-modifying code
- In Proc. 2007 ACM Conference on Programming Language Design and Implementation
, 2007
"... Self-modifying code (SMC), in this paper, broadly refers to any program that loads, generates, or mutates code at runtime. It is widely used in many of the world’s critical software systems to support runtime code generation and optimization, dynamic loading and linking, OS boot loader, just-in-time ..."
Abstract
-
Cited by 36 (6 self)
- Add to MetaCart
Self-modifying code (SMC), in this paper, broadly refers to any program that loads, generates, or mutates code at runtime. It is widely used in many of the world’s critical software systems to support runtime code generation and optimization, dynamic loading and linking, OS boot loader, just
Certified Self-Modifying Code
"... Self-modifying code (SMC), in this paper, broadly refers to any program that purposely loads, generates, or mutates code at runtime. It is widely used in many of the world’s critical software systems to support runtime code generation and optimization, dynamic loading and linking, OS kernel boot-loa ..."
Abstract
- Add to MetaCart
Self-modifying code (SMC), in this paper, broadly refers to any program that purposely loads, generates, or mutates code at runtime. It is widely used in many of the world’s critical software systems to support runtime code generation and optimization, dynamic loading and linking, OS kernel boot
A Model for Self-Modifying Code ⋆
"... Abstract. Self-modifying code is notoriously hard to understand and therefore very well suited to hide program internals. In this paper we introduce a program representation for this type of code: the state-enhanced control flow graph. It is shown how this program representation can be constructed, ..."
Abstract
- Add to MetaCart
Abstract. Self-modifying code is notoriously hard to understand and therefore very well suited to hide program internals. In this paper we introduce a program representation for this type of code: the state-enhanced control flow graph. It is shown how this program representation can be constructed
Harnessing Self-modifying Code for Resilient Software
- In Second NASA GSFC/IEEE Workshop on Radical Agent Concepts (WRAC
, 2005
"... Abstract. In this paper we argue that self-modifying code can become a better strategy for realizing long-lived autonomous software systems than static code, regardless how well it was validated and tested. We base our discussion on three facets – self-repairing software, adaptive software and netwo ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. In this paper we argue that self-modifying code can become a better strategy for realizing long-lived autonomous software systems than static code, regardless how well it was validated and tested. We base our discussion on three facets – self-repairing software, adaptive software
Reverse Engineering Self-Modifying Code: Unpacker Extraction
"... An important application of binary-level reverse engineering is in reconstructing the internal logic of computer malware. Most malware code is distributed in encrypted (or “packed”) form; at runtime, an unpacker routine transforms this to the original executable form of the code, which is then exec ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
unpacking and code that does not; identifying such functionality can be helpful for reverse engineering the code. This paper describes a technique for identifying and extracting the unpacker code in a self-modifying program. Our algorithm uses offline analysis of a dynamic instruction trace both to identify
Unconditional self-modifying code elimination with dynamic compiler optimizations
- 5TH INTERNATIONAL CONFERENCE ON MALICIOUS AND UNWANTED SOFTWARE CFP1059F-PRT
, 2010
"... This paper deals with the issue of self-modifying code and packed programs, a long-standing problem commonly addressed by emulation techniques and memory dumps. We propose an original semantics-based approach to simplify dynamic code analysis, by using compiler optimization techniques to get rid of ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
This paper deals with the issue of self-modifying code and packed programs, a long-standing problem commonly addressed by emulation techniques and memory dumps. We propose an original semantics-based approach to simplify dynamic code analysis, by using compiler optimization techniques to get rid
Strengthening software self-checksumming via self-modifying code
, 2005
"... Recent research has proposed self-checksumming as a method by which a program can detect any possibly malicious modification to its code. Wurster et al. developed an attack against such programs that renders code modifications undetectable to any self-checksumming routine. The attack replicated page ..."
Abstract
-
Cited by 21 (1 self)
- Add to MetaCart
operating system. In this paper, we show that their page-replication attack can be detected by self-checksumming programs with self-modifying code. Our detection is efficient, adding less than 1 microsecond to each checksum computation in our experiments on three processor families, and is robust up
AADEBUG2003 XXX1 Instrumenting self-modifying code
"... Adding small code snippets at key points to existing code fragments is called instrumentation. It is an established technique to debug certain otherwise hard to solve faults, such as memory management issues and data races. Dynamic instrumentation can already be used to analyse code which is loaded ..."
Abstract
- Add to MetaCart
or even generated at run time. With the advent of environments such as the Java Virtual Machine with optimizing Just-In-Time compilers, a new obstacle arises: self-modifying code. In order to instrument this kind of code correctly, one must be able to detect modifications and adapt the instrumentation
Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code
- Genetic algorithms: proceedings of the sixth international conference (ICGA95
, 1995
"... The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing-complete programs for a register machine. The described implementation enables the use of most program constructs, such as arithmetic operators, large indexed memory, aut ..."
Abstract
-
Cited by 51 (5 self)
- Add to MetaCart
allows us to work at the lowest level of binary machine code without any interpreting steps. In a von Neumann machine, programs and data reside in the same memory and the genetic operators can thus directly manipulate the binary machine code in memory. The genetic operators themselves are written in C
Language-Independent Sandboxing of Just-In-Time Compilation and Self-Modifying Code
"... When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such speciallydesigned languages, it is difficult to ensure the safety of highlyoptimized, dynamic language runtimes which, fo ..."
Abstract
-
Cited by 21 (3 self)
- Add to MetaCart
, for efficiency, rely on advanced techniques such as Just-In-Time (JIT) compilation, large libraries of native-code support routines, and intricate mechanisms for multi-threading and garbage collection. Each new runtime provides a new potential attack surface and this security risk raises a barrier
Results 1 - 10
of
390
