2010 Proceeding- Conference Chairs:
- Jonathan Cook,
- James A. Jones
Dynamic-analysis techniques are increasingly used to complement more traditional static analysis. Approaches based on static analysis operate on a static representation of the program, consider all possible (and some infeasible) behaviors, and are thus complete, but often imprecise. Dynamic-analysis techniques, conversely, reason over a set of program executions and analyze only observed behaviors. Dynamic analysis includes both offline techniques, which operate on some captured representation of the system's behavior (e.g., a trace), and run-time techniques, which analyze the system's behavior on the fly, while the system is executing. Although inherently incomplete, dynamic analyses can be more precise than their static counterparts and show promise in aiding the understanding, development, and maintenance of robust and reliable large-scale systems. Moreover, the data they provide enable statistical inferences to be made about program behavior. In recent years, both practitioners and researchers are realizing that the limitations of static analysis can be overcome by integrating static and dynamic analysis, and that the performance of dynamic analyses can in turn be improved by leveraging static analysis.
The overall goal of WODA 2010 is to bring together researchers and practitioners working in all areas of dynamic analysis to discuss new issues, share results and ongoing work, and foster collaborations.
Proceeding Downloads
An approach for modeling dynamic analysis using ontologies
In this paper we present the possibility of using an ontology based framework in order to model Dynamic Analysis techniques. This work relies on similar ideas applied to the case of Static Analysis [22, 28, 27], in which ontologies are used to represent ...
Using compression algorithms to support the comprehension of program traces
Several software maintenance tasks such as debugging, phase-identification, or simply the high-level exploration of system functionality, rely on the extensive analysis of program traces. These usually require the developer to manually discern any ...
Detection of high-level execution patterns in reactive behavior of control programs
This paper presents an approach to extract high-level patterns from traces of programmable logic control (PLC) programs recorded with a deterministic replay debugging tool. Our deterministic replay debugging works by recording an application run in real-...
DSDSR: a tool that uses dynamic symbolic execution for data structure repair
We present DSDSR, a generic repair tool for complex data structures. Generic, automatic data structure repair algorithms have applications in many areas. Reducing repair time can may therefore have a significant impact on software robustness. Current ...
Dsc+Mock: a test case + mock class generator in support of coding against interfaces
Coding against interfaces is a powerful technique in object-oriented programming. It decouples code and enables independent development. However, code decoupled via interfaces poses additional challenges for testing and dynamic execution, as not all ...
Metrics for QoS analysis in dynamic, evolving and heterogeneous connected systems
Dynamic, evolving systems pose new challenges from the point of view of Quality of Service (QoS) analysis, calling for techniques able to combine traditional offline methods with new ones applied at run-time. Tracking the evolution and updating the ...
Index Terms
Proceedings of the Eighth International Workshop on Dynamic Analysis