Matthew B. Dwyer, Frank Tip
Proceedings of the 20th International Symposium on Software Testing and Analysis
ISSTA, 2011.

@proceedings{ISSTA-2011,
	address       = "Toronto, Ontario, Canada",
	editor        = "Matthew B. Dwyer and Frank Tip",
	isbn          = "978-1-4503-0562-4",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 20th International Symposium on Software Testing and Analysis}",
	year          = 2011,
}

Contents (35 items)

11 ×#testing
7 ×#analysis
6 ×#automation
6 ×#generative
4 ×#modelling
4 ×#performance
3 ×#adaptation
3 ×#fault
3 ×#named
2 ×#combinator

ISSTA-2011-TanejaXTH #generative #named #performance #testing

eXpress: guided path exploration for efficient regression test generation (KT, TX, NT, JdH), pp. 1–11.

ISSTA-2011-BabicMMS #automation #generative #testing

Statically-directed dynamic automated test generation (DB, LM, SM, DS), pp. 12–22.

ISSTA-2011-GodefroidL #automation #generative #summary #testing

Automatic partial loop summarization in dynamic test generation (PG, DL), pp. 23–33.

ISSTA-2011-PasareanuRV #execution #symbolic computation

Symbolic execution with mixed concrete-symbolic solving (CSP, NR, WV), pp. 34–44.

ISSTA-2011-BalasubramanianPWKL #analysis #modelling #multi #named #statechart

Polyglot: modeling and analysis for multiple Statechart formalisms (DB, CSP, MWW, GK, MRL), pp. 45–55.

ISSTA-2011-McGillDS #analysis #concept #modelling #scalability

Scalable analysis of conceptual data models (MJM, LKD, REKS), pp. 56–66.

ISSTA-2011-NijjarB #bound #modelling #ruby #verification

Bounded verification of Ruby on Rails data models (JN, TB), pp. 67–77.

ISSTA-2011-YasmeenG #analysis #automation #framework

Automated framework for formal operator task analysis (AY, ELG), pp. 78–88.

ISSTA-2011-BernatRM #performance

Efficient, sensitivity resistant binary instrumentation (ARB, KAR, BPM), pp. 89–99.

ISSTA-2011-RosenblumMZ

Recovering the toolchain provenance of binary code (NER, BPM, XZ), pp. 100–110.

ISSTA-2011-Rubio-GonzalezL #fault #interactive #kernel #linux #pointer

Defective error/pointer interactions in the Linux kernel (CRG, BL), pp. 111–121.

ISSTA-2011-BurnimSS #concurrent #memory management #modelling #source code #testing

Testing concurrent programs on relaxed memory models (JB, KS, CS), pp. 122–132.

ISSTA-2011-JagannathLM

Change-aware preemption prioritization (VJ, QL, DM), pp. 133–143.

ISSTA-2011-HuangZ #concurrent #persuasion #predict

Persuasive prediction of concurrency access anomalies (JH, CZ), pp. 144–154.

ISSTA-2011-YanXR #alias #analysis #java

Demand-driven context-sensitive alias analysis for Java (DY, G(X, AR), pp. 155–165.

ISSTA-2011-TateishiPT #analysis #higher-order #logic #monad #string

Path- and index-sensitive string analysis based on monadic second-order logic (TT, MP, OT), pp. 166–176.

ISSTA-2011-GuarnieriPTDTB #javascript #web

Saving the world wide web from vulnerable JavaScript (SG, MP, OT, JD, ST, RB), pp. 177–187.

ISSTA-2011-XiaoZ #analysis #encoding #geometry #java #performance #points-to

Geometric encoding: forging the high performance context sensitive points-to analysis for Java (XX, CZ), pp. 188–198.

ISSTA-2011-ParninO #automation #debugging #question

Are automated debugging techniques actually helping programmers? (CP, AO), pp. 199–209.

ISSTA-2011-DiGiuseppeJ #fault #locality #multi #on the

On the influence of multiple faults on coverage-based fault localization (ND, JAJ), pp. 210–220.

ISSTA-2011-BurgerZ

Minimizing reproduction of software failures (MB, AZ), pp. 221–231.

ISSTA-2011-PradelG #detection #order

Detecting anomalies in the order of equally-typed method arguments (MP, TRG), pp. 232–242.

ISSTA-2011-DumluYCP #adaptation #combinator #feedback #testing

Feedback driven adaptive combinatorial testing (ED, CY, MBC, AAP), pp. 243–253.

ISSTA-2011-SegallTF #combinator #design #diagrams #using

Using binary decision diagrams for combinatorial test design (IS, RTB, EF), pp. 254–264.

ISSTA-2011-ArcuriB #adaptation #effectiveness #question #random testing #testing

Adaptive random testing: an illusion of effectiveness? (AA, LCB), pp. 265–275.

ISSTA-2011-ShahbazSE #component #embedded #refinement #specification

Iterative refinement of specification for component based embedded systems (MS, KCS, RE), pp. 276–286.

ISSTA-2011-GuoE #automation #data analysis #persistent #using

Using automatic persistent memoization to facilitate data analysis scripting (PJG, DRE), pp. 287–297.

ISSTA-2011-GligoricMK #code generation #named #performance

CoDeSe: fast deserialization via code generation (MG, DM, SK), pp. 298–308.

ISSTA-2011-SumnerBZ #comparison #execution

Selecting peers for execution comparison (WNS, TB, XZ), pp. 309–319.

ISSTA-2011-LeS #analysis #detection #fault #generative

Generating analyses for detecting faults in path segments (WL, MLS), pp. 320–330.

ISSTA-2011-ZhangZ #adaptation #interactive #parametricity #testing

Characterizing failure-causing parameter interactions by adaptive testing (ZZ, JZ), pp. 331–341.

ISSTA-2011-NaminK #testing #using

The use of mutation in testing experiments and its sensitivity to external threats (ASN, SK), pp. 342–352.

ISSTA-2011-ZhangSBE #automation #generative #testing

Combined static and dynamic automated test generation (SZ, DS, YB, MDE), pp. 353–363.

ISSTA-2011-FraserZ #generative #testing

Generating parameterized unit tests (GF, AZ), pp. 364–374.

ISSTA-2011-AllwoodCE #haskell #source code #testing

High coverage testing of Haskell programs (TORA, CC, SE), pp. 375–385.