menu
{ "item_title" : "NASA Formal Methods", "item_author" : [" Klaus Havelund", "Gerard Holzmann", "Rajeev Joshi "], "item_description" : "Moving Fast with Software Verification.- Developing Verified Software Using Leon.- Timely Rollback: Specification and Verification.- Sum of Abstract Domains.- Reachability Preservation Based Parameter Synthesis for Timed Automata.- Compositional Verification of Parameterised Timed Systems.- Requirements Analysis of a Quad-Redundant Flight Control System.- Partial Order Reduction and Symmetry with Multiple Representatives.- Statistical Model Checking of Ad Hoc Routing Protocols in Lossy Grid Networks.- Efficient Guiding Strategies for Testing of Temporal Properties of Hybrid Systems.- First-Order Transitive Closure Axiomatization via Iterative Invariant Injections.- Reachability Analysis Using Extremal Rates.- Towards Realizability Checking of Contracts Using Theories.- Practical Partial Order Reduction for CSP.- A Little Language for Testing.- Detecting MPI Zero Buffer Incompatibility by SMT Encoding.- A Falsification View of Success Typing.- Verified ROS-Based Deployment of Platform-Independent Control Systems.- A Rigorous Approach to Combining Use Case Modelling and Accident Scenarios.- Are We There Yet? Determining the Adequacy of Formalized Requirements and Test Suites.- A Greedy Approach for the Efficient Repair of Stochastic Models.- Integrating SMT with Theorem Proving for Analog/Mixed-Signal Circuit Verification.- Conflict-Directed Graph Coverage.- Shape Analysis with Connectors.- Automated Conflict-Free Concurrent Implementation of Timed Component-Based Models.- Formal API Specification of the PikeOS Separation Kernel.- Data Model Bugs.- Predicting and Witnessing Data Races Using CSP.- A Benchmark Suite for Hybrid Systems Reachability Analysis.- Generalizing a Mathematical Analysis Library in Isabelle/HOL.- A Tool for Intersecting Context-Free Grammars and Its Applications.- UFIT: A Tool for Modeling Faults in UPPAAL Timed Automata.- Blocked Literals Are Universal.- Practical Formal Verification of Domain-Specific Language Applications.- Reporting Races in Dynamic Partial Order Reduction.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/31/917/523/3319175238_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" : "" } }
NASA Formal Methods|Klaus Havelund

NASA Formal Methods : 7th International Symposium, Nfm 2015, Pasadena, Ca, Usa, April 27-29, 2015, Proceedings

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

Overview

Moving Fast with Software Verification.- Developing Verified Software Using Leon.- Timely Rollback: Specification and Verification.- Sum of Abstract Domains.- Reachability Preservation Based Parameter Synthesis for Timed Automata.- Compositional Verification of Parameterised Timed Systems.- Requirements Analysis of a Quad-Redundant Flight Control System.- Partial Order Reduction and Symmetry with Multiple Representatives.- Statistical Model Checking of Ad Hoc Routing Protocols in Lossy Grid Networks.- Efficient Guiding Strategies for Testing of Temporal Properties of Hybrid Systems.- First-Order Transitive Closure Axiomatization via Iterative Invariant Injections.- Reachability Analysis Using Extremal Rates.- Towards Realizability Checking of Contracts Using Theories.- Practical Partial Order Reduction for CSP.- A Little Language for Testing.- Detecting MPI Zero Buffer Incompatibility by SMT Encoding.- A Falsification View of Success Typing.- Verified ROS-Based Deployment of Platform-Independent Control Systems.- A Rigorous Approach to Combining Use Case Modelling and Accident Scenarios.- Are We There Yet? Determining the Adequacy of Formalized Requirements and Test Suites.- A Greedy Approach for the Efficient Repair of Stochastic Models.- Integrating SMT with Theorem Proving for Analog/Mixed-Signal Circuit Verification.- Conflict-Directed Graph Coverage.- Shape Analysis with Connectors.- Automated Conflict-Free Concurrent Implementation of Timed Component-Based Models.- Formal API Specification of the PikeOS Separation Kernel.- Data Model Bugs.- Predicting and Witnessing Data Races Using CSP.- A Benchmark Suite for Hybrid Systems Reachability Analysis.- Generalizing a Mathematical Analysis Library in Isabelle/HOL.- A Tool for Intersecting Context-Free Grammars and Its Applications.- UFIT: A Tool for Modeling Faults in UPPAAL Timed Automata.- Blocked Literals Are Universal.- Practical Formal Verification of Domain-Specific Language Applications.- Reporting Races in Dynamic Partial Order Reduction.

This item is Non-Returnable

    1

Details

  • ISBN-13: 9783319175232
  • ISBN-10: 3319175238
  • Publisher: Springer
  • Publish Date: April 2015
  • Dimensions: 9.21 x 6.14 x 0.95 inches
  • Shipping Weight: 1.45 pounds
  • Page Count: 458

Related Categories

BAM Customer Reviews