Proceedings of the 25th International Static Analysis Symposium
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Andreas Podelski
Proceedings of the 25th International Static Analysis Symposium
SAS, 2018.

PLT
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{SAS-2018,
	doi           = "10.1007/978-3-319-99725-4",
	editor        = "Andreas Podelski",
	isbn          = "['978-3-319-99724-7', '978-3-319-99725-4']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 25th International Static Analysis Symposium}",
	volume        = 11002,
	year          = 2018,
}

Contents (25 items)

SAS-2018-Albarghouthi #named #perspective
Fairness: A Formal-Methods Perspective (AA), pp. 1–4.
SAS-2018-BagnaraBH #analysis #c #development #embedded #standard
The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software (RB, AB, PMH), pp. 5–23.
SAS-2018-Kincaid #automaton #invariant
Numerical Invariants via Abstract Machines (ZK), pp. 24–42.
SAS-2018-McMillanP #decidability #deduction #verification
Deductive Verification in Decidable Fragments with Ivy (KLM, OP), pp. 43–55.
SAS-2018-OHearn #analysis #concurrent #experience #facebook
Experience Developing and Deploying Concurrency Analysis at Facebook (PWO), pp. 56–70.
SAS-2018-Piskac #synthesis #verification
New Applications of Software Synthesis: Verification of Configuration Files and Firewall Repair (RP), pp. 71–76.
SAS-2018-Shoham #decidability #distributed #interactive #logic #protocol #using #verification
Interactive Verification of Distributed Protocols Using Decidable Logic (SS), pp. 77–85.
SAS-2018-AlpernasMPSSSV #abstract interpretation #network
Abstract Interpretation of Stateful Networks (KA, RM, AP, MS, SS, SS, YV), pp. 86–106.
SAS-2018-AlurDS #gpu #independence #source code
Block-Size Independence for GPU Programs (RA, JD, NS), pp. 107–126.
SAS-2018-BakhirkinM #constraints #representation
Extending Constraint-Only Representation of Polyhedra with Boolean Constraints (AB, DM), pp. 127–145.
SAS-2018-BecchiZ #abstract domain #performance
An Efficient Abstract Domain for Not Necessarily Closed Polyhedra (AB, EZ), pp. 146–165.
SAS-2018-BessonJL #abstract interpretation #composition #fault
Modular Software Fault Isolation as Abstract Interpretation (FB, TPJ, JL), pp. 166–186.
SAS-2018-ChawdharyK #performance
Closing the Performance Gap Between Doubles and Rationals for Octagons (AC, AK), pp. 187–204.
SAS-2018-HuckelheimLNSH #source code #verification
Verifying Properties of Differentiable Programs (JH, ZL, SHKN, SFS, PDH), pp. 205–222.
SAS-2018-JacqueminPV #analysis #bound #fault #float
A Reduced Product of Absolute and Relative Error Bounds for Floating-Point Analysis (MJ, SP, FV), pp. 223–242.
SAS-2018-JournaultMO #c #composition #source code #static analysis #string
Modular Static Analysis of String Manipulations in C Programs (MJ, AM, AO), pp. 243–262.
SAS-2018-MastroeniP #bound #verification
Verifying Bounded Subset-Closed Hyperproperties (IM, MP), pp. 263–283.
SAS-2018-MidtgaardNN #process #static analysis
Process-Local Static Analysis of Synchronous Processes (JM, FN, HRN), pp. 284–305.
SAS-2018-NamjoshiP #program analysis #program transformation
The Impact of Program Transformations on Static Program Analysis (KSN, ZP), pp. 306–325.
SAS-2018-PrabhuMV #behaviour #learning #proving #safety
Efficiently Learning Safety Proofs from Appearance as well as Behaviours (SP, KM, RV), pp. 326–343.
SAS-2018-RanzatoZ #abstract domain #linear
Invertible Linear Transforms of Numerical Abstract Domains (FR, MZ), pp. 344–363.
SAS-2018-RothenbergDH #abstraction #incremental #using #verification
Incremental Verification Using Trace Abstraction (BCR, DD, MH), pp. 364–382.
SAS-2018-RuefHC #heuristic
Volume-Based Merge Heuristics for Disjunctive Numeric Domains (AR, KH, AC), pp. 383–401.
SAS-2018-UrbanU0 #abstract interpretation
Abstract Interpretation of CTL Properties (CU, SU, PM0), pp. 402–422.
SAS-2018-Zuleger #abstraction #induction #invariant #proving #termination
Inductive Termination Proofs with Transition Invariants and Their Relationship to the Size-Change Abstraction (FZ), pp. 423–444.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.