Markus Müller-Olm, Helmut Seidl
Proceedings of the 21st International Static Analysis Symposium
SAS, 2014.

@proceedings{SAS-2014,
	address       = "Munich, Germany",
	doi           = "10.1007/978-3-319-10936-7",
	editor        = "Markus Müller-Olm and Helmut Seidl",
	isbn          = "978-3-319-10935-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 21st International Static Analysis Symposium}",
	volume        = 8723,
	year          = 2014,
}

Contents (20 items)

4 ×#analysis
3 ×#abstract domain
2 ×#abstraction
2 ×#automation
2 ×#cost analysis
2 ×#memory management
2 ×#pointer
2 ×#source code
2 ×#termination
2 ×#verification

SAS-2014-AbdullaHH #exclamation #verification

Block Me If You Can! — Context-Sensitive Parameterized Verification (PAA, FH, LH), pp. 1–17.

SAS-2014-AlbertFR #cost analysis #distributed

Peak Cost Analysis of Distributed Systems (EA, JCF, GRD), pp. 18–33.

SAS-2014-BakhirkinBP #abstraction #analysis #approximate

Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction (AB, JB, NP), pp. 34–50.

SAS-2014-BessonJV #java #named #static analysis

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications (FB, TPJ, PV), pp. 51–67.

SAS-2014-BrotherstonG #abduction #safety #termination

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions (JB, NG), pp. 68–84.

SAS-2014-ChakarovS #fixpoint #invariant #probability

Expectation Invariants for Probabilistic Program Loops as Fixed Points (AC, SS), pp. 85–100.

SAS-2014-ChenLMKW #abstract domain #constraints

An Abstract Domain to Infer Octagonal Constraints with Absolute Value (LC, JL, AM, DK, JW), pp. 101–117.

SAS-2014-ChenHTWW #recursion #source code #using #verification

Verifying Recursive Programs Using Intraprocedural Analyzers (YFC, CH, MHT, BYW, FW), pp. 118–133.

SAS-2014-CoxCR #analysis #automation #source code

Automatic Analysis of Open Objects in Dynamic Language Programs (AC, BYEC, XR), pp. 134–150.

SAS-2014-GhorbalSP #algebra #difference #equation #polynomial

Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations (KG, AS, AP), pp. 151–167.

SAS-2014-IoossAR #equivalence #on the #reduction

On Program Equivalence with Reductions (GI, CA, SVR), pp. 168–183.

SAS-2014-LeeOY

A Progress Bar for Static Analyzers (WL, HO, KY), pp. 184–200.

SAS-2014-MadsenM #analysis #data flow #pointer #reachability

Sparse Dataflow Analysis with Pointers and Reachability (MM, AM), pp. 201–218.

SAS-2014-MandelP #ml

Reactivity of Cooperative Systems — Application to ReactiveML (LM, CP), pp. 219–236.

SAS-2014-MeshmanDVY #memory management #refinement #synthesis

Synthesis of Memory Fences via Refinement Propagation (YM, AMD, MTV, EY), pp. 237–252.

SAS-2014-MonniauxS

Speeding Up Logico-Numerical Strategy Iteration (DM, PS), pp. 253–267.

SAS-2014-SamantaOE #automation #cost analysis #program repair

Cost-Aware Automatic Program Repair (RS, OO, EAE), pp. 268–284.

SAS-2014-ToubhansCR #abstract domain #abstraction #combinator #memory management

An Abstract Domain Combinator for Separately Conjoining Memory Abstractions (AT, BYEC, XR), pp. 285–301.

SAS-2014-UrbanM #abstract domain #proving #termination

A Decision Tree Abstract Domain for Proving Conditional Termination (CU, AM), pp. 302–318.

SAS-2014-YeSX #analysis #pointer

Region-Based Selective Flow-Sensitive Pointer Analysis (SY, YS, JX), pp. 319–336.