Abstract is missing.
- Simulation and Invariance for Weak ConsistencyJade Alglave. 3-22 [doi]
- Quantitative Monitor AutomataKrishnendu Chatterjee, Thomas A. Henzinger, Jan Otop. 23-38 [doi]
- The Julia Static Analyzer for JavaFausto Spoto. 39-57 [doi]
- Automated Verification of Linearization PoliciesParosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh. 61-83 [doi]
- Structure-Sensitive Points-To Analysis for C and C++George Balatsouras, Yannis Smaragdakis. 84-104 [doi]
- Bounded Abstract InterpretationMaria Christakis, Valentin Wüstholz. 105-125 [doi]
- Completeness in Approximate TransductionMila Dalla Preda, Roberto Giacobazzi, Isabella Mastroeni. 126-146 [doi]
- Relational Verification Through Horn Clause TransformationEmanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. 147-169 [doi]
- Securing a Compiler TransformationChaoqiang Deng, Kedar S. Namjoshi. 170-188 [doi]
- Exploiting Sparsity in Difference-Bound MatricesGraeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey. 189-211 [doi]
- Flow- and Context-Sensitive Points-To Analysis Using Generalized Points-To GraphsPritam M. Gharat, Uday P. Khedker, Alan Mycroft. 212-236 [doi]
- Learning a Variable-Clustering Strategy for Octagon from Labeled Data Generated by a Static AnalysisKihong Heo, Hakjoo Oh, Hongseok Yang. 237-256 [doi]
- Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating ProgramsMatthieu Journault, Antoine Miné. 257-277 [doi]
- Generalized Homogeneous Polynomials for Efficient Template-Based Nonlinear Invariant SynthesisKensuke Kojima, Minoru Kinoshita, Kohei Suenaga. 278-299 [doi]
- On the Linear Ranking Problem for Simple Floating-Point LoopsFonenantsoa Maurica, Frédéric Mesnard, Étienne Payet. 300-316 [doi]
- Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVMDavid Menendez, Santosh Nagarakatte, Aarti Gupta. 317-337 [doi]
- A Parametric Abstract Domain for Lattice-Valued Regular ExpressionsJan Midtgaard, Flemming Nielson, Hanne Riis Nielson. 338-360 [doi]
- Cell Morphing: From Array Programs to Array-Free Horn ClausesDavid Monniaux, Laure Gonnord. 361-382 [doi]
- Loopy: Programmable and Formally Verified Loop TransformationsKedar S. Namjoshi, Nimit Singhania. 383-402 [doi]
- Abstract Interpretation of Supermodular GamesFrancesco Ranzato. 403-423 [doi]
- Validating Numerical Semidefinite Programming Solvers for Polynomial InvariantsPierre Roux, Yuen-Lam Voronin, Sriram Sankaranarayanan. 424-446 [doi]
- Enforcing Termination of Interprocedural AnalysisStefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler. 447-468 [doi]
- From Array Domains to Abstract Interpretation Under Store-Buffer-Based Memory ModelsThibault Suzanne, Antoine Miné. 469-488 [doi]
- Making k-Object-Sensitive Pointer Analysis More Precise with Still k-LimitingTian Tan, Yue Li, Jingling Xue. 489-510 [doi]