Abstract: Techniques are disclosed relating to improving misprediction rates of indirect branch instructions. In one embodiment, a computer system determines misprediction information for an indirect branch instruction included in a sequence of instructions. The misprediction information is indicative of a processor not correctly predicting an actual target address of the indirect branch instruction. In some embodiments, the misprediction information includes a misprediction rate for the target address). Based on the misprediction information, the computer system inserts before the indirect branch instruction a conditional branch instruction that specifies the target address.

Abstract: A system and method for efficient bounded hash table sorting during dynamic whole program profiling of software applications. A computing system comprises a dynamic binary instrumentation (DBI) tool coupled to a virtual machine configured to translate and execute binary code of a software application. The binary code is augmented with instrumentation and analysis code during translation and execution. A dynamic binary analysis (DBA) tool identifies hierarchical layers of cycles within the application that describe the dynamic behavior of the application. Corresponding characterization information is stored in a hash table. Periodic sorting of entries of the hash table occur for highly accessed entries in deep buckets within the hash table. Repositioning the entries within the hash table may reduce pointer chasing problems and identify program phase changes within the dynamic behavior of the application.

Abstract: A system detects an application attempting to invoke an administrative utility on a target application for installation of software. In response, the system identifies the administrative utility as an installer launcher. The system then detects the installer launcher invoking execution of the target application, and in response, identifies the target application as an installation application. The system allows classification of applications as installer launchers and installation applications and in response to detecting operation of such programs, enforces installation security profiles during their operations that apply varying levels of access to certain system resources that differ from a level of access normally applied during non-installation activities.

Abstract: A system and method for efficient whole program profiling of software applications. A computing system comprises a dynamic binary instrumentation (DBI) tool coupled to a virtual machine configured to translate and execute binary code of a software application. The binary code is augmented with instrumentation and analysis code during translation and execution. Characterization information of each basic block is stored as each basic block is executed. A dynamic binary analysis (DBA) tool inspects this information to identify hierarchical layers of cycles within the application that describe the dynamic behavior of the application. A sequence of basic blocks may describe paths, a sequence of paths may describe a stratum, and a sequence of strata may describe a stratum layer. Statistics of these layers and hot paths may be determined and stored. This data storage yields a whole program profile comprising program phase changes that accurately describes the dynamic behavior of the application.

Abstract: A system and method for efficient bounded hash table sorting during dynamic whole program profiling of software applications. A computing system comprises a dynamic binary instrumentation (DBI) tool coupled to a virtual machine configured to translate and execute binary code of a software application. The binary code is augmented with instrumentation and analysis code during translation and execution. A dynamic binary analysis (DBA) tool identifies hierarchical layers of cycles within the application that describe the dynamic behavior of the application. Correpsonding characterization information is stored in a hash table. Periodic sorting of entries of the hash table occur for highly accessed entries in deep buckets within the hash table. Repositioning the entries within the hash table may reduce pointer chasing problems and identify program phase changes within the dynamic behavior of the application.