Radhia Cousot, Matthieu Martel
Proceedings of the 17th International Static Analysis Symposium
SAS, 2010.

@proceedings{SAS-2010,
	address       = "Perpignan, France",
	doi           = "10.1007/978-3-642-15769-1",
	editor        = "Radhia Cousot and Matthieu Martel",
	isbn          = "978-3-642-15768-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 17th International Static Analysis Symposium}",
	volume        = 6337,
	year          = 2010,
}

Contents (28 items)

6 ×#analysis
5 ×#source code
4 ×#invariant
3 ×#abstract domain
3 ×#automation
3 ×#termination
3 ×#verification
2 ×#abstraction
2 ×#concurrent
2 ×#generative

SAS-2010-Emerson

Time of Time (EAE), p. 1.

SAS-2010-Fahndrich #contract #verification

Static Verification for Code Contracts (MF), pp. 2–5.

SAS-2010-Goldberg #framework #in memory #memory management #optimisation #pipes and filters #validation

Translation Validation of Loop Optimizations and Software Pipelining in the TVOC Framework — In Memory of Amir Pnueli (BG), pp. 6–21.

SAS-2010-HeizmannJP #invariant #termination

Size-Change Termination and Transition Invariants (MH, NDJ, AP), pp. 22–50.

SAS-2010-Lesens #question #static analysis #using #why

Using Static Analysis in Space: Why Doing so? (DL), pp. 51–70.

SAS-2010-McCloskeyRS #array #invariant

Statically Inferring Complex Heap, Array, and Numeric Invariants (BM, TWR, MS), pp. 71–99.

SAS-2010-AlbertAGPD #analysis #approach

From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis (EA, PA, SG, GP, DVRD), pp. 100–116.

SAS-2010-AliasDFG #bound #complexity #multi #ranking #source code #termination

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs (CA, AD, PF, LG), pp. 117–133.

SAS-2010-AmatoPS #abstract domain #analysis #component

Deriving Numerical Abstract Domains via Principal Component Analysis (GA, MP, FS), pp. 134–150.

SAS-2010-BellAW #concurrent #logic #parallel #pipes and filters

Concurrent Separation Logic for Pipelined Parallelization (CJB, AWA, DW), pp. 151–166.

SAS-2010-BrauerK #abstraction #automation #using

Automatic Abstraction for Intervals Using Boolean Formulae (JB, AK), pp. 167–183.

SAS-2010-Chapoutot #abstract domain #float

Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables (AC), pp. 184–200.

SAS-2010-CheriniRB #analysis #data type

A Shape Analysis for Non-linear Data Structures (RC, LR, JOB), pp. 201–217.

SAS-2010-PredaGDCT #abstract interpretation #modelling #morphism

Modelling Metamorphism by Abstract Interpretation (MDP, RG, SKD, KC, GMT), pp. 218–235.

SAS-2010-DilligDA #constraints #online #scalability #source code #static analysis

Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis (ID, TD, AA), pp. 236–252.

SAS-2010-FarzanK #analysis #composition #concurrent #source code

Compositional Bitvector Analysis for Concurrent Programs with Nested Locks (AF, ZK), pp. 253–270.

SAS-2010-GawlitzaS #polynomial #semantics

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely (TMG, HS), pp. 271–286.

SAS-2010-GurfinkelC #abstract domain #named

Boxes: A Symbolic Abstract Domain of Boxes (AG, SC), pp. 287–303.

SAS-2010-HarrisLNR #termination

Alternation for Termination (WRH, AL, AVN, SKR), pp. 304–319.

SAS-2010-JensenMT #analysis #interprocedural #lazy evaluation

Interprocedural Analysis with Lazy Propagation (SHJ, AM, PT), pp. 320–339.

SAS-2010-HofmannKS #coq #verification

Verifying a Local Generic Solver in Coq (MH, AK, HS), pp. 340–355.

SAS-2010-MalkisPR #abstraction #refinement #thread

Thread-Modular Counterexample-Guided Abstraction Refinement (AM, AP, AR), pp. 356–372.

SAS-2010-MatringeMR #algebra #generative #hybrid #invariant #linear

Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods (NM, AVM, RR), pp. 373–389.

SAS-2010-KatoenMMM #automation #generative #invariant #probability #source code

Linear-Invariant Generation for Probabilistic Programs: — Automated Support for Proof-Based Methods (JPK, AM, LM, CCM), pp. 390–406.

SAS-2010-Might #for free

Abstract Interpreters for Free (MM), pp. 407–421.

SAS-2010-NasreG #analysis #equation #linear #points-to

Points-to Analysis as a System of Linear Equations (RN, RG), pp. 422–438.

SAS-2010-SchrijversM #data flow #strict

Strictness Meets Data Flow (TS, AM), pp. 439–454.

SAS-2010-VechevYRS #automation #parallel #source code #verification

Automatic Verification of Determinism for Structured Parallel Programs (MTV, EY, RR, VS), pp. 455–471.