Tuesday Schedule

Nate Rosenblum

"Program Provenance: Guessing the Source Compiler from Binary Code"

University of Wisconsin


A program's provenance encompasses the various characteristics of the
tool chain between the original source code and the resulting binary.
One obvious element of this process is the identity of the source
compiler. Recently we have developed techniques that can identify the
source compiler of binary code. Our techniques have good accuracy,
even in the case of interleaving of code from multiple compilers. In
this talk we present our current compiler inference techniques, show
how they can be used to improve the task of parsing stripped binaries,
and discuss future directions in provenance recovery.

Geoffrey Stoker

"Automatically Adapting Sampling Rates to Minimize Overhead"

University of Maryland


The sampling rate used during performance analysis is typically chosen in an informal manner and remains fixed throughout an execution run. We have developed a mathematical framework for determining the sampling rate required to provide the best balance between achieving statistical accuracy while limiting the perturbation of the result. During execution this technique can adjust the sampling rate to adapt to changing conditions. For this talk, we present the motivation for deliberate sampling rate calculation, the straightforward mathematical framework, and the concept for the tool we are developing to implement this technique.

Todd Frederick

"Binary Concolic Execution for Automatic Exploit Generation"

University of Wisconsin


Software security vulnerabilities are an ever-present threat,
and analysts often work with programs for which only the binary
code is available.
Previous work created intrusion detection
signatures for these vulnerabilities, but required a working
exploit in advance.
In this talk, we present a method that
will generate exploit strings given only the binary code and
vulnerability location.
Our approach combines concrete and
symbolic execution techniques into a concolic execution system
for binary code, supported by a new symbolic evaluation
component for Dyninst.
We present our techniques and discuss
the expected performance of our approach.

Michael Lam

"Dynamic Floating-Point Cancellation Detection"

University of Maryland


Floating-point roundoff error is a well-known problem in numerical computation; it distorts results and is difficult to characterize accurately. Cancellation refers to the loss of precision as a result of subtracting nearly-identical numbers, and is a particular subset of roundoff error that can serve as a warning flag for other harder-to-detect flaws. We have developed a tool for detecting cancellation events at runtime using dynamic binary instrumentation. In this talk we will demonstrate the techniques we used and show our results on several examples.

Sameer Shende

"Simplifying the Usage of Performance Evaluation Tools: Experiences with TAU and DyninstAPI"

University of Oregon, Performance Research Laboratory


High-end applications and systems are evolving towards more sophisticated modes of operation, higher levels of abstraction, and larger scales of execution. These trends challenge the state of technology for performance evaluation and optimization. While scalable toolsets for parallel and distributed system performance analysis exist, offering a range of capabilities and sophistication in performance observation and analysis, the tools are not as widely used by HPC application groups nor as broadly integrated in the application development, engineering, and tuning processes as they could and should be. This talk will discuss our recent work on simplifying performance instrumentation tasks in the TAU Performance System using DyninstAPI's binary rewriting capabilities. The talk will highlight the features of TAU and the DyninstAPI features that TAU currently uses. It will also present ideas for possible future work on improving support for binary rewriting and stack walking capabilities. A demonstration of a LiveDVD based HPC Linux distribution that includes DyninstAPI, TAU, PAPI, Scalasca and Vampir tools will be presented after the talk.

Condor logo
Paradyn/Condor Week 2010

University of Wisconsin

Madison, Wisconsin

April 12-April 16, 2010
Paradyn logo

Overview Local Arrangements Monday, April 12

Tuesday, April 13

Wednesday, April 14

Thursday, April 15

Friday, April 16


picture of Madison

Tuesday, April 13, 2010

Paradyn Technical Sessions and Demonstrations

Fluno Center

601 University Ave

Technical Sessions, Rm. 221

8:45am - 9:00am

Hot Topics in Dyninst Development: Program Provenance: Guessing the Source Compiler from Binary Code

Nate Rosenblum, University of Wisconsin

9:00am - 9:15am

Hot Topics in Dyninst Development: Automatically Adapting Sampling Rates to Minimize Overhead

Geoffrey Stoker, University of Maryland

9:15am - 9:45am

Binary Concolic Execution for Automatic Exploit Generation

Todd Frederick, University of Wisconsin

ppt pdf
9:45am - 10:15am

Dynamic Floating-Point Cancellation Detection

Michael Lam, University of Maryland

10:15am - 10:45am

10:45am - 11:30am

Simplifying the Usage of Performance Evaluation Tools: Experiences with TAU and DyninstAPI

Sameer Shende, University of Oregon

11:30am - 12:00pm

Upcoming Dyninst Features


Bill Williams, University of Wisconsin

12:00pm - 12:15pm

Technical Session Closing Remarks
Bart and Jeff
12:15pm - 1:30pm

Demonstrations, Rm. 221

1:30pm - 2:00pm

DyninstAPI on VXWorks
Ray Chen, University of Maryland
2:00pm - 2:30pm

Binary Rewriting in Performance Analysis Tools
Matthew Legendre, University of Wisconsin
2:30pm - 3:00pm

Malware Analysis with Dyninst
Kevin Roundy, University of Wisconsin
3:00pm - 3:30pm

3:30pm - 4:00pm

Slicing and Symbolic Evaluation
Drew Bernat, University of Wisconsin
4:00pm - 4:30pm

Blame Analysis
Nick Rutar, University of Maryland
4:30pm - 5:00pm

Load Balancing with Libra
Todd Gamblin, Lawrence Livermore National Labs