Method for validation of binary code transformations

TL;DR: In this article, the tracer objectives may be individual portions of a large tracer operation, and each of the objectives may have separate set of input objects for which data may be collected.

TL;DR: In this paper, a distributed tracing system may be compared to identify input parameters that may have a high statistical relevancy, and an iterative process may traverse multiple input objects by comparing results of multiple tracer objectives and scoring possible input objects as being possibly statistically relevant.

TL;DR: In this article, a load balanced system may incorporate instrumented systems within a group of managed devices and distribute workload among the devices to meet both load balancing and data collection, and authentication may be performed between the authenticated devices and the workload distributor to verify that the managed devices are able to receive the workloads.

TL;DR: In this paper, a tracing management system may use cost analyses and performance budgets to dispatch tracing objectives to instrumented systems that may collect trace data while running an application, which may be a mechanism to limit any adverse effects from tracing when running the application.

TL;DR: Binary code analysis is used to provide information about a program's content and structure, and is a foundation of many applications, including binary modification, binary translation, binary matching, performance profiling, debugging, extraction of parameters for performance modeling, computer security and forensics.

TL;DR: An associated decision problem is formalized and it is proved it is NP-complete, and algorithms based on dual codewords recognition are suggested which will be efficient for codes of length up to 512 if thecodewords contain no more than 1.5 errors.

TL;DR: BMAT is presented, a fast and effective tool that matches two versions of a binary program without knowledge of source code changes and enables the propagation of profile information from an older, extensively profiled build to a newer build, thus greatly reducing or even eliminating the need for re-profiling.

TL;DR: In this article, a compiler that performs retargetable object code generation for a specific processor by matching tree patterns in directed acyclic graphs derived from the source code is presented.