Eran Yahav
Proceedings of the 18th International Static Analysis Symposium
SAS, 2011.

@proceedings{SAS-2011,
	address       = "Venice, Italy",
	doi           = "10.1007/978-3-642-23702-7",
	editor        = "Eran Yahav",
	isbn          = "978-3-642-23701-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 18th International Static Analysis Symposium}",
	volume        = 6887,
	year          = 2011,
}

Contents (27 items)

6 ×#source code
4 ×#abstraction
4 ×#analysis
3 ×#abstract interpretation
3 ×#concurrent
3 ×#using
3 ×#verification
2 ×#bound
2 ×#performance
2 ×#program analysis

SAS-2011-McMillan

Widening and Interpolation (KLM), p. 1.

SAS-2011-NoriR #machine learning #program analysis

Program Analysis and Machine Learning: A Win-Win Deal (AVN, SKR), pp. 2–3.

SAS-2011-Mitchell #program analysis #security #web

Program Analysis for Web Security (JCM), p. 4.

SAS-2011-Kastner #design #experience #named

Astrée: Design and Experience (DK), p. 5.

SAS-2011-Feret #formal method #reduction

Formal Model Reduction (JF), p. 6.

SAS-2011-MadhavanRV #abstract interpretation #analysis

Purity Analysis: An Abstract Interpretation Formulation (RM, GR, KV), pp. 7–24.

SAS-2011-GorogiannisKO #abduction #abstraction #complexity

The Complexity of Abduction for Separated Heap Abstractions (NG, MIK, PWO), pp. 25–42.

SAS-2011-MadhusudanQ #performance #using

Efficient Decision Procedures for Heaps Using STRAND (PM, XQ), pp. 43–59.

SAS-2011-BlackshearCSS #analysis #precise

The Flow-Insensitive Precision of Andersen’s Analysis in Practice (SB, BYEC, SS, MS), pp. 60–76.

SAS-2011-FlexederPS #analysis #assembly

Side-Effect Analysis of Assembly Code (AF, MP, HS), pp. 77–94.

SAS-2011-MaKFH #execution #symbolic computation

Directed Symbolic Execution (KKM, YPK, JSF, MH), pp. 95–111.

SAS-2011-GodefroidLR #composition #generative #incremental #summary #testing #validation

Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation (PG, SKL, CRG), pp. 112–128.

SAS-2011-BouajjaniEP #concurrent #on the #source code

On Sequentializing Concurrent Programs (AB, ME, GP), pp. 129–145.

SAS-2011-VafeiadisN #optimisation #verification

Verifying Fence Elimination Optimisations (VV, FZN), pp. 146–162.

SAS-2011-HuangZ #concurrent #debugging #performance #source code

An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs (JH, CZ), pp. 163–179.

SAS-2011-MightH #abstract interpretation #concurrent #higher-order #product line #source code #static analysis

A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs (MM, DVH), pp. 180–197.

SAS-2011-ElderLSAR #abstract domain

Abstract Domains of Affine Relations (ME, JL, TS, TA, TWR), pp. 198–215.

SAS-2011-VerdoolaegeCB #approximate #integer #transitive #tuple

Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations (SV, AC, AB), pp. 216–232.

SAS-2011-SchrammelJ #data flow #source code #verification

Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs (PS, BJ), pp. 233–248.

SAS-2011-McMillanZ #abstract interpretation #invariant

Invisible Invariants and Abstract Interpretation (KLM, LDZ), pp. 249–262.

SAS-2011-AvniK #abstraction #framework #query

An Abstraction-Refinement Framework for Trigger Querying (GA, OK), pp. 263–279.

SAS-2011-ZulegerGSV #abstraction #analysis #bound #imperative #source code

Bound Analysis of Imperative Programs with the Size-Change Abstraction (FZ, SG, MS, HV), pp. 280–297.

SAS-2011-SuterKK #recursion #satisfiability #source code

Satisfiability Modulo Recursive Programs (PS, ASK, VK), pp. 298–315.

SAS-2011-MisailovicRR #program transformation

Probabilistically Accurate Program Transformations (SM, DMR, MCR), pp. 316–333.

SAS-2011-EsparzaG #abstraction #probability

Probabilistic Abstractions with Arbitrary Domains (JE, AG), pp. 334–350.

SAS-2011-DonaldsonHKR #using #verification

Software Verification Using k-Induction (AFD, LH, DK, PR), pp. 351–368.

SAS-2011-MonniauxG #bound #fixpoint #model checking #using

Using Bounded Model Checking to Focus Fixpoint Iterations (DM, LG), pp. 369–385.