menu
{ "item_title" : "Verification, Model Checking, and Abstract Interpretation", "item_author" : [" Roberto Giacobazzi", "Josh Berdine", "Isabella Mastroeni "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/64/235/872/3642358721_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Verification, Model Checking, and Abstract Interpretation|Roberto Giacobazzi

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

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783642358722
  • ISBN-10: 3642358721
  • Publisher: Springer
  • Publish Date: January 2013
  • Dimensions: 9.21 x 6.14 x 1.16 inches
  • Shipping Weight: 1.74 pounds
  • Page Count: 556

Related Categories

You May Also Like...

    1

BAM Customer Reviews