menu
{ "item_title" : "Complete Symbolic Simulation of Systemc Models", "item_author" : [" Vladimir Herdt "], "item_description" : "In his master thesis, Vladimir Herdt presents a novel approach, called complete symbolic simulation, for a more efficient verification of much larger (non-terminating) SystemC programs. The approach combines symbolic simulation with stateful model checking and allows to verify safety properties in (cyclic) finite state spaces, by exhaustive exploration of all possible inputs and process schedulings. The state explosion problem is alleviated by integrating two complementary reduction techniques. Compared to existing approaches, the complete symbolic simulation works more efficiently, and therefore can provide correctness proofs for larger systems, which is one of the most challenging tasks, due to the ever increasing complexity.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/65/812/679/3658126795_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" : "" } }
Complete Symbolic Simulation of Systemc Models|Vladimir Herdt

Complete Symbolic Simulation of Systemc Models : Efficient Formal Verification of Finite Non-Terminating Programs

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

Overview

In his master thesis, Vladimir Herdt presents a novel approach, called complete symbolic simulation, for a more efficient verification of much larger (non-terminating) SystemC programs. The approach combines symbolic simulation with stateful model checking and allows to verify safety properties in (cyclic) finite state spaces, by exhaustive exploration of all possible inputs and process schedulings. The state explosion problem is alleviated by integrating two complementary reduction techniques. Compared to existing approaches, the complete symbolic simulation works more efficiently, and therefore can provide correctness proofs for larger systems, which is one of the most challenging tasks, due to the ever increasing complexity.

This item is Non-Returnable

Details

  • ISBN-13: 9783658126797
  • ISBN-10: 3658126795
  • Publisher: Springer Vieweg
  • Publish Date: March 2016
  • Dimensions: 8.27 x 5.83 x 0.42 inches
  • Shipping Weight: 0.54 pounds
  • Page Count: 162

Related Categories

You May Also Like...

    1

BAM Customer Reviews