{"product_id":"9783658126797","title":"BestMasters: Efficient Formal Verification of Finite Non-Terminating Programs","description":"\u003ch1\u003eBestMasters: Efficient Formal Verification of Finite Non-Terminating Programs\u003c\/h1\u003e \u003ch2\u003eHerdt, Vladimir\u003c\/h2\u003e \u003cp\u003e\u003c\/p\u003e\u003cp\u003eIn his\nmaster thesis, Vladimir Herdt presents a novel approach, called complete\nsymbolic simulation, for a more efficient verification of\nmuch larger (non-terminating) SystemC programs. The\napproach combines symbolic simulation with stateful model checking and allows\nto verify safety properties in (cyclic) finite state spaces, by exhaustive\nexploration of all possible inputs and process schedulings. The state explosion\nproblem is alleviated by integrating two complementary reduction techniques. Compared\nto existing approaches, the complete symbolic simulation works more efficiently,\nand therefore can provide correctness proofs for larger systems, which is one\nof the most challenging tasks, due to the ever increasing complexity.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer Vieweg\u003c\/p\u003e \u003cp\u003ePublication Date: 2016-03-29\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9783658126797\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-3-658-12680-3\u003c\/p\u003e \u003cp\u003eDimensions: 210cm x148cm\u003c\/p\u003e \u003cp\u003ePages: 162\u003c\/p\u003e ","brand":"Springer Fachmedien Wiesbaden","offers":[{"title":"Default Title","offer_id":47409351229580,"sku":"9783658126797","price":49.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783658126797.jpg?v=1775834962","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9783658126797","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}