ISSTA 2011 – Proceedings

2011 International Symposium on Software Testing and Analysis (ISSTA 2011), July 17–21, 2011, Toronto, ON, Canada

Preface

Title Page
Article: issta11foreword-fm000-p (type: Frontmatter) doi:

Foreword
Article: issta11foreword-fm001-p (type: Frontmatter) doi:

Test Generation I

eXpress: Guided Path Exploration for Efficient Regression Test Generation
Kunal Taneja, Tao Xie, Nikolai Tillmann, and Jonathan De Halleux
(North Carolina State University, USA; Microsoft Research, USA)
Article: issta11full-id88-p (type: Full Paper) doi:

Statically-Directed Dynamic Automated Test Generation
Domagoj Babić, Lorenzo Martignoni, Stephen McCamant, and Dawn Song
(UC Berkeley, USA)
Article: issta11full-id90-p (type: Full Paper) doi:

Automatic Partial Loop Summarization in Dynamic Test Generation
Patrice Godefroid and Daniel Luchaup
(Microsoft Research, USA; University of Wisconsin – Madison, USA)
Article: issta11full-id96-p (type: Full Paper) doi:

Symbolic Execution with Mixed Concrete-Symbolic Solving
Corina S. Păsăreanu, Neha Rungta, and Willem Visser
(CMU, USA; NASA Ames Research Center, USA; SGT Inc., USA; Stellenbosch University, South Africa)
Article: issta11full-id86-p (type: Full Paper) doi:

Models

Polyglot: Modeling and Analysis for Multiple Statechart Formalisms
Daniel Balasubramanian, Corina S. Păsăreanu, Michael W. Whalen, Gábor Karsai, and Michael Lowry
(Vanderbilt University, USA; CMU, USA; NASA Ames Research Center, USA; University of Minnesota, USA)
Article: issta11full-id80-p (type: Full Paper) doi:

Scalable Analysis of Conceptual Data Models
Matthew J. McGill, Laura K. Dillon, and R. E. K. Stirewalt
(Michigan State University, USA; LogicBlox Inc., USA)
Article: issta11full-id37-p (type: Full Paper) doi:

Bounded Verification of Ruby on Rails Data Models
Jaideep Nijjar and Tevfik Bultan
(UC Santa Barbara, USA)
Article: issta11full-id83-p (type: Full Paper) doi:

Automated Framework for Formal Operator Task Analysis
Ayesha Yasmeen and Elsa L. Gunter
(University of Illinois at Urbana-Champaign, USA)
Article: issta11full-id87-p (type: Full Paper) doi:

Analysis of Systems and Binary Code

Efficient, Sensitivity Resistant Binary Instrumentation
Andrew R. Bernat, Kevin Roundy, and Barton P. Miller
(University of Wisconsin – Madison, USA)
Article: issta11full-id23-p (type: Full Paper) doi:

Recovering the Toolchain Provenance of Binary Code
Nathan Rosenblum, Barton P. Miller, and Xiaojin Zhu
(University of Wisconsin – Madison, USA)
Article: issta11full-id38-p (type: Full Paper) doi:

Defective Error/Pointer Interactions in the Linux Kernel
Cindy Rubio-González and Ben Liblit
(University of Wisconsin – Madison, USA)
Article: issta11full-id21-p (type: Full Paper) doi:

Concurrency

Testing Concurrent Programs on Relaxed Memory Models
Jacob Burnim, Koushik Sen, and Christos Stergiou
(UC Berkeley, USA)
Article: issta11full-id102-p (type: Full Paper) doi:

Change-Aware Preemption Prioritization
Vilas Jagannath, Qingzhou Luo, and Darko Marinov
(University of Illinois at Urbana-Champaign, USA)
Article: issta11full-id118-p (type: Full Paper) doi:

Persuasive Prediction of Concurrency Access Anomalies
Jeff Huang and Charles Zhang
(Hong Kong University of Science and Technology, China)
Article: issta11full-id9-p (type: Full Paper) doi:

Program Analysis

Demand-Driven Context-Sensitive Alias Analysis for Java
Dacong Yan, Guoqing Xu, and Atanas Rountev
(Ohio State University, USA)
Article: issta11full-id58-p (type: Full Paper) doi:

Path- and Index-sensitive String Analysis Based on Monadic Second-order Logic
Takaaki Tateishi, Marco Pistoia, and Omer Tripp
(IBM Research Tokyo, Japan; IBM Research Watson, USA; IBM Software Group, USA; Tel Aviv University, Israel)
Article: issta11full-id100-p (type: Full Paper) doi:

Saving the World Wide Web from Vulnerable JavaScript
Salvatore Guarnieri, Marco Pistoia, Omer Tripp, Julian Dolby, Stephen Teilhet, and Ryan Berg
(IBM Research Watson, USA; University of Washington, USA; IBM Software Group, USA; Tel Aviv University, Israel)
Article: issta11full-id69-p (type: Full Paper) doi:

Geometric Encoding: Forging the High Performance Context Sensitive Points-to Analysis for Java
Xiao Xiao and Charles Zhang
(Hong Kong University of Science and Technology, China)
Article: issta11full-id31-p (type: Full Paper) doi:

Faults I

Are Automated Debugging Techniques Actually Helping Programmers?
Chris Parnin and Alessandro Orso
(Georgia Tech, USA)
Article: issta11full-id119-p (type: Full Paper) doi:

On the Influence of Multiple Faults on Coverage-Based Fault Localization
Nicholas DiGiuseppe and James A. Jones
(UC Irvine, USA)
Article: issta11full-id91-p (type: Full Paper) doi:

Minimizing Reproduction of Software Failures
Martin Burger and Andreas Zeller
(Saarland University, Germany)
Article: issta11full-id43-p (type: Full Paper) doi:

Detecting Anomalies in the Order of Equally-typed Method Arguments
Michael Pradel and Thomas R. Gross
(ETH Zurich, Switzerland)
Article: issta11full-id1-p (type: Full Paper) doi:

Combinatorial and Random Testing

Feedback Driven Adaptive Combinatorial Testing
Emine Dumlu, Cemal Yilmaz, Myra B. Cohen, and Adam Porter
(Sabanci University, Turkey; University of Nebraska at Lincoln, USA; University of Maryland, USA)
Article: issta11full-id76-p (type: Full Paper) doi:

Using Binary Decision Diagrams for Combinatorial Test Design
Itai Segall, Rachel Tzoref-Brill, and Eitan Farchi
(IBM Research Haifa, Israel)
Article: issta11full-id28-p (type: Full Paper) doi:

Adaptive Random Testing: An Illusion of Effectiveness?
Andrea Arcuri and Lionel Briand
(Simula Research Laboratory, Norway; University of Oslo, Norway)
Article: issta11full-id3-p (type: Full Paper) doi:

Specification and Optimization

Iterative Refinement of Specification for Component Based Embedded Systems
Muzammil Shahbaz, K. C. Shashidhar, and Robert Eschbach
(University of Sheffield, UK; MPI-SWS, Germany; Fraunhofer IESE, Germany)
Article: issta11full-id71-p (type: Full Paper) doi:

Using Automatic Persistent Memoization to Facilitate Data Analysis Scripting
Philip J. Guo and Dawson Engler
(Stanford University, US)
Article: issta11full-id39-p (type: Full Paper) doi:

CoDeSe: Fast Deserialization via Code Generation
Milos Gligoric, Darko Marinov, and Sam Kamin
(University of Illinois at Urbana-Champaign, USA)
Article: issta11full-id97-p (type: Full Paper) doi:

Faults II

Selecting Peers for Execution Comparison
William N. Sumner, Tao Bao, and Xiangyu Zhang
(Purdue University, USA)
Article: issta11full-id116-p (type: Full Paper) doi:

Generating Analyses for Detecting Faults in Path Segments
Wei Le and Mary Lou Soffa
(University of Virginia, USA)
Article: issta11full-id73-p (type: Full Paper) doi:

Characterizing Failure-Causing Parameter Interactions by Adaptive Testing
Zhiqiang Zhang and Jian Zhang
(Chinese Academy of Sciences, China)
Article: issta11full-id84-p (type: Full Paper) doi:

The Use of Mutation in Testing Experiments and its Sensitivity to External Threats
Akbar Siami Namin and Sahitya Kakarla
(Texas Tech University, US)
Article: issta11full-id75-p (type: Full Paper) doi:

Test Generation II

Combined Static and Dynamic Automated Test Generation
Sai Zhang, David Saff, Yingyi Bu, and Michael D. Ernst
(University of Washington, USA; Google Inc., USA; UC Irvine, USA)
Article: issta11full-id111-p (type: Full Paper) doi:

Generating Parameterized Unit Tests
Gordon Fraser and Andreas Zeller
(Saarland University, Germany)
Article: issta11full-id67-p (type: Full Paper) doi:

High Coverage Testing of Haskell Programs
Tristan Allwood, Cristian Cadar, and Susan Eisenbach
(Imperial College Longon, UK; Imperial College London, UK)
Article: issta11full-id46-p (type: Full Paper) doi: