Add to ORKGIn the paper Ball-Larus path profiling across multiple loop iterations appeared at OOPSLA '13 (28th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications), we present a new approach to multi-iteration path profiling that allows the profiling of all executed paths obtained as a concatenation of up to k Ball-Larus acyclic paths, where k is a user-defined parameter. The present artifact has been endorsed by the OOPSLA Artifact Evaluation Committee, and it ships as a VirtualBox disk image fully configured for using our profiler, a thorough getting started guide, source code and other materials
For aggressive path-based optimizations to be profitable in cost-senstive environments, accurate pat...
Abstract. This paper describes new techniques to help with testing and debugging, using information ...
Calling context trees are one of the most fundamental data structures for representing the interproc...
In the paper Ball-Larus path profiling across multiple loop iterations appeared at OOPSLA '13 (28th ...
Identifying the hottest paths in the control flow graph of a routine can direct optimizations to por...
The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencie...
In path profiling, a program is instrumented with code that counts the number of times particular pa...
Acyclic path profile is an abstraction of dynamic control flow paths of procedures and has been foun...
This paper presents a novel approach (called PIP) for profiling inter-procedural paths, which makes ...
Most dynamic program analysis techniques such as profile-driven compiler optimizations, software test...
Path profiles provide a more accurate characterization of a program&s dynamic behavior than basic bl...
A path profile determines how many times each acyclic path in a routine executes. This type of profi...
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence Relations This artifact...
With the evolution of multi-core, multi-threaded processors from simple-scalar processors, the perfo...
For aggressive path-based optimizations to be profitable in cost-senstive environments, accurate pat...
Abstract. This paper describes new techniques to help with testing and debugging, using information ...
Calling context trees are one of the most fundamental data structures for representing the interproc...
In the paper Ball-Larus path profiling across multiple loop iterations appeared at OOPSLA '13 (28th ...
Identifying the hottest paths in the control flow graph of a routine can direct optimizations to por...
The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencie...
In path profiling, a program is instrumented with code that counts the number of times particular pa...
Acyclic path profile is an abstraction of dynamic control flow paths of procedures and has been foun...
This paper presents a novel approach (called PIP) for profiling inter-procedural paths, which makes ...
Most dynamic program analysis techniques such as profile-driven compiler optimizations, software test...
Path profiles provide a more accurate characterization of a program&s dynamic behavior than basic bl...
A path profile determines how many times each acyclic path in a routine executes. This type of profi...
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence Relations This artifact...
With the evolution of multi-core, multi-threaded processors from simple-scalar processors, the perfo...
For aggressive path-based optimizations to be profitable in cost-senstive environments, accurate pat...
Abstract. This paper describes new techniques to help with testing and debugging, using information ...
Calling context trees are one of the most fundamental data structures for representing the interproc...