Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Verification, Model Checking, and Abstract Interpretation: 14th International Conference, Vmcai 2013, Rome, Italy, January 20-22, 2013, Proceedings

Verification, Model Checking, and Abstract Interpretation: 14th International Conference, Vmcai 2013, Rome, Italy, January 20-22, 2013, Proceedings

Giacobazzi, Roberto
Berdine, Josh
Mastroeni, Isabella

Paperback

FictionGeneral Computers

ISBN10: 3642358721
ISBN13: 9783642358722
Publisher: Springer
Published: Jan 7 2013
Pages: 556
Weight: 1.74
Height: 1.16 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Computers

View All