Machine code disassembly routines form a fundamental component of software systems that statically analyze or modify executable programs. The task of disassembly is complicated by indirect jumps and the presence of nonexecutable data---jump tables, alignment bytes, etc.---in the instruction

Abstract not found

A great deal of software is distributed in the form ofexecutable code. The ability to reverse engineer such

This paper analyses the specification of agent control and agent knowledge in DAML-S and its conversion into executable code. Instead of the

, we address computation of patches for executables of programs. Our techniques take into account the platform-dependent structure of executables, We identify changes in the executables that are likely to be artifacts of the compilation process, and arrange to reconstruct these when the patch

The increasing frequency with which serious security flaws are discovered and the increasing rapidity with which they are exploited have made it necessary for programs to be updated far more frequently than in the past. While binary updates are generally far more convenient than source code updates

In this paper we will discuss one approach to achieving software reliability. In particular, where software systems are modeled using a formal mathematical framework that is used to verify their behaviors. Once verified these are translated to executable code. Formal system specifications

This paper describes proof-carrying code (PCC), a mechanism by which a host system can determine with certainty that it is safe to execute a program supplied (possibly in binary form) by an untrusted source. For this to be possible, the untrusted code producer must supply with the code a safety

that they could write a set of keywords expressing a command in that domain. For instance, in the web browsing domain, a user might enter click search button. We call expressions of this form keyword commands, and we present a novel approach for translating keyword commands directly into executable code. Our

language constructs, they turn out to be of limited utility at the machine code level. This paper describes two different approaches to highquality, low-cost, speculative may-alias analysis, to be applied in the context of link-time or executable code optimizers. The key idea behind our proposals