menu
{ "item_title" : "Tests and Proofs", "item_author" : [" Dirk Beyer", "Chantal Keller "], "item_description" : "When are Software Verification Results Valid for Approximate Hardware.- Testing Robots using CSP.- Constraints in Dynamic Symbolic Execution: Bitvectors or Integers.- Fast, Automatic and Nearly Complete Structural Unit Test Generation Combining Genetic Algorithms and Formal Methods.- Coverage-Based Testing with Symbolic Transition Systems.- BTestBox - A tool for testing B translators and coverage of B models.- Predicting and Testing Latencies with Deep Learning: an IoT Case Study.- Learning Communicating State Machines.- Repairing Timed Automata Clock Guards through Abstraction and Testing.- Proving a Non-Blocking Algorithm for Process Renaming with TLA+.- Tame your annotations with MetAcsl: Specifying, Testing and Proving High-Level Properties.- Property-Based Test Case Generators for Free.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/03/031/156/3030311562_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" : "" } }
Tests and Proofs|Dirk Beyer

Tests and Proofs : 13th International Conference, Tap 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9

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

Overview

When are Software Verification Results Valid for Approximate Hardware.- Testing Robots using CSP.- Constraints in Dynamic Symbolic Execution: Bitvectors or Integers.- Fast, Automatic and Nearly Complete Structural Unit Test Generation Combining Genetic Algorithms and Formal Methods.- Coverage-Based Testing with Symbolic Transition Systems.- BTestBox - A tool for testing B translators and coverage of B models.- Predicting and Testing Latencies with Deep Learning: an IoT Case Study.- Learning Communicating State Machines.- Repairing Timed Automata Clock Guards through Abstraction and Testing.- Proving a Non-Blocking Algorithm for Process Renaming with TLA+.- Tame your annotations with MetAcsl: Specifying, Testing and Proving High-Level Properties.- Property-Based Test Case Generators for Free.

This item is Non-Returnable

Details

  • ISBN-13: 9783030311568
  • ISBN-10: 3030311562
  • Publisher: Springer
  • Publish Date: September 2019
  • Dimensions: 9.21 x 6.14 x 0.46 inches
  • Shipping Weight: 0.69 pounds
  • Page Count: 207

Related Categories

You May Also Like...

    1

BAM Customer Reviews