Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
This book constitutes the refereed proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2013, held in Rome, Italy, in January 2013, co-located with the Symposium on Principles of Programming Languages, POPL 2013. The 27 revised full papers presented were carefully reviewed and selected from 72 submissions. The papers cover a wide range of topics including program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type system, deductive methods, program certification, debugging techniques, program transformation, optimization, hybrid and cyber-physical systems.
A Model-Constructing Satisfiability Calculus.- Automata as Proofs.- Complete Abstractions Everywhere.- Abstraction-Guided Synthesis.- SMT-Based Bisimulation Minimisation of Markov Models.- Hybrid Automata-Based CEGAR for Rectangular Hybrid Systems.- Quantifying Information Leakage of Randomized Protocols.- Reductions for Synthesis Procedures.- Towards Efficient Parameterized Synthesis.- Automatic Inference of Necessary Preconditions.- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools.- SMT-Based Array Invariant Generation.- Flow-Sensitive Fault Localization.- Static Analysis of String Encoders and Decoders.- Robustness Analysis of Networked Systems.- Causality Checking for Complex System Models.- ClabureDB: Classified Bug-Reports Database: Tool for Developers of Program Analysis Tools.- Tool Integration with the Evidential Tool Bus.- Compositional and Lightweight Dependent Type Inference for ML.- Abstract Read Permissions: Fractional Permissions without the Fractions.- Sound and Complete Flow Typing with Unions, Intersections and Negations.- Knockout Prediction for Reaction Networks with Partial Kinetic Information.- Reduced Product Combination of Abstract Domains for Shapes.- Abstraction of Syntax.- Logico-Numerical Max-Strategy Iteration.- A Constraint Solver Based on Abstract Domains.- An Abstract Interpretation of DPLL(T).- All for the Price of Few: (Parameterized Verification through View Abstraction).- Uncovering Symmetries in Irregular Process Networks.- State Space Reduction for Sensor Networks Using Two-Level Partial Order Reduction.- Compositional Sequentialization of Periodic Programs.