Model Checking Boolean Programs

eBook (PDF), 156 Pages
This item has not been rated yet
Price: Free
A successful approach to push the boundaries of Modelchecking is predicate abstraction. With this method, an abstraction of a program in a high-level programming language is constructed using predicates and represented as a Boolean program. It is analyzed by a dedicated checker to determine if an error state is reachable. Boolean program verification remains, despite the reduced state space, the bottleneck within the automated abstraction-refinement loop. This book introduces techniques for efficient reachability analysis of sequential and concurrent Boolean programs. We improve on known summarization algorithms for sequential Boolean programs and propose over-approximations of procedure calls. For non-recursive concurrent Boolean programs, we introduce a transformation to a representation , which exploits the symmetry inherent in replicated programs. This allows exact verification of an unbounded number of threads.
Available in PDF Format

Ratings & Reviews

Log in to review this item
There are no reviews for the current version of this product
There are no reviews for previous versions of this product

Product Details

September 28, 2011
File Format
File Size
1.95 MB

Formats for this Ebook

Required Software Any PDF Reader, Apple Preview
Supported Devices Windows PC/PocketPC, Mac OS, Linux OS, Apple iPhone/iPod Touch... (See More)
# of Devices Unlimited
Flowing Text / Pages Pages
Printable? Yes
Report This Content to Lulu >

Moderation of Questionable Content

Thank you for your interest in helping us moderate questionable content on Lulu. If you need assistance with an order or the publishing process, please contact our support team directly.

How does this content violate the Lulu Membership Agreement?


Listed In

More From Gérard Basler