Antoine Miné, David Schmidt
Proceedings of the 19th International Static Analysis Symposium
SAS, 2012.

@proceedings{SAS-2012,
	address       = "Deauville, France",
	doi           = "10.1007/978-3-642-33125-1",
	editor        = "Antoine Miné and David Schmidt",
	isbn          = "978-3-642-33124-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 19th International Static Analysis Symposium}",
	volume        = 7460,
	year          = 2012,
}

Contents (29 items)

8 ×#analysis
5 ×#source code
3 ×#proving
2 ×#abstract domain
2 ×#abstract interpretation
2 ×#abstraction
2 ×#algorithm
2 ×#composition
2 ×#higher-order
2 ×#invariant

SAS-2012-BartheGB #encryption #proving

Computer-Aided Cryptographic Proofs (GB, BG, SZB), pp. 1–2.

SAS-2012-Distefano

A Voyage to the Deep-Heap (DD), p. 3.

SAS-2012-Krishnamurthi #analysis #javascript #semantics #web

Semantics and Analyses for JavaScript and the Web (SK), p. 4.

SAS-2012-LeePMH #analysis #parallel #performance

Efficient May Happen in Parallel Analysis for Async-Finish Parallelism (JKL, JP, RM, HH), pp. 5–23.

SAS-2012-GoubaultPV #composition #static analysis

Modular Static Analysis with Zonotopes (EG, SP, FV), pp. 24–40.

SAS-2012-HoweK #analysis #parametricity #using

Polyhedral Analysis Using Parametric Objectives (JMH, AK), pp. 41–57.

SAS-2012-CacheraJJK #imperative #invariant #polynomial #source code

Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases (DC, TPJ, AJ, FK), pp. 58–74.

SAS-2012-IoualalenM #abstract domain #representation

A New Abstract Domain for the Representation of Mathematically Equivalent Expressions (AI, MM), pp. 75–93.

SAS-2012-ChengR #abstract domain #spreadsheet

An Abstract Domain to Infer Types over Zones in Spreadsheets (TC, XR), pp. 94–110.

SAS-2012-ThakurER #abstraction #algorithm

Bilateral Algorithms for Symbolic Abstraction (AVT, ME, TWR), pp. 111–128.

SAS-2012-GiacobazziM #abstract interpretation #modelling #obfuscation

Making Abstract Interpretation Incomplete: Modeling the Potency of Obfuscation (RG, IM), pp. 129–145.

SAS-2012-SanchezSSC #generative #invariant #self #using

Invariant Generation for Parametrized Systems Using Self-reflection — (Extended Version) (AS, SS, CS, BYEC), pp. 146–163.

SAS-2012-AbdullaACLR #abstraction #automation #integer #source code

Automatic Fence Insertion in Integer Programs via Predicate Abstraction (PAA, MFA, YFC, CL, AR), pp. 164–180.

SAS-2012-CalvertM #analysis #calculus #control flow

Control Flow Analysis for the Join Calculus (PC, AM), pp. 181–197.

SAS-2012-HalbwachsH #sequence

When the Decreasing Sequence Fails (NH, JH), pp. 198–213.

SAS-2012-BiallasBKK

Loop Leaping with Closures (SB, JB, AK, SK), pp. 214–230.

SAS-2012-JaffarMNS #slicing

Path-Sensitive Backward Slicing (JJ, VM, JAN, AES), pp. 231–247.

SAS-2012-GiannakopoulouRR #component #interface #learning

Symbolic Learning of Component Interfaces (DG, ZR, VR), pp. 248–264.

SAS-2012-KhedkerMR #analysis #pointer

Liveness-Based Pointer Analysis (UPK, AM, PSR), pp. 265–282.

SAS-2012-HenryMM #abstract interpretation #algorithm #analysis #evaluation

Succinct Representations for Abstract Interpretation — Combined Analysis Algorithms and Experimental Evaluation (JH, DM, MM), pp. 283–299.

SAS-2012-AlbarghouthiGC

Craig Interpretation (AA, AG, MC), pp. 300–316.

SAS-2012-DSilvaHK #satisfiability

Satisfiability Solvers Are Static Analysers (VD, LH, DK), pp. 317–333.

SAS-2012-ThakurR

A Generalization of Stålmarck’s Method (AVT, TWR), pp. 334–351.

SAS-2012-Midtgaard0M #proving

A Structural Soundness Proof for Shivers’s Escape Technique — A Case for Galois Connections (JM, MDA, MM), pp. 352–369.

SAS-2012-MadhavanRV #analysis #composition #higher-order #source code

Modular Heap Analysis for Higher-Order Programs (RM, GR, KV), pp. 370–387.

SAS-2012-Ledesma-GarzaR #analysis #functional #higher-order #reachability #source code

Binary Reachability Analysis of Higher Order Functional Programs (RLG, AR), pp. 388–404.

SAS-2012-Alonso-BlasG #approach #cost analysis #on the

On the Limits of the Classical Approach to Cost Analysis (DEAB, SG), pp. 405–421.

SAS-2012-ChenFM #linear #proving #termination

Termination Proofs for Linear Simple Loops (HYC, SF, SM), pp. 422–438.

SAS-2012-EmmiL #distributed #source code

Finding Non-terminating Executions in Distributed Asynchronous Programs (ME, AL), pp. 439–455.