Search Results: 'Symbolic Model Checking'

Search

×
×
×
×
5 results for "Symbolic Model Checking"
Model Checking Boolean Programs By Gérard Basler
Paperback: $50.80
Prints in 3-5 business days
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... More > 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.< Less
Model Checking Boolean Programs By Gérard Basler
eBook (PDF): $0.00
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... More > 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.< Less
Model Checking Boolean Programs (b/w print) By Gérard Basler
Paperback: $11.80
Prints in 3-5 business days
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... More > 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.< Less
Model Checking Boolean Programs (b/w print) By Gérard Basler
eBook (PDF): $0.00
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... More > 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.< Less
Computer-Aided Reasoning: ACL2 Case Studies By Matt Kaufmann et al.
Paperback: $22.39
Prints in 3-5 business days
(1 Ratings)
Computer-Aided Reasoning: ACL2 Case Studies illustrates how the computer-aided reasoning system ACL2 can be used in productive and innovative ways to design, build, and maintain hardware and software... More > systems. Included here are technical papers written by twenty-one contributors that report on self-contained and fully reproducible case studies, some of which are sanitized industrial projects. The papers deal with a wide variety of areas, including floating-point arithmetic, microprocessor simulation, model checking, symbolic trajectory evaluation, compilation, proof checking, real analysis, and several others. The case studies also contain exercises whose solutions are on the Web. In addition, the complete proof scripts necessary to formalize the models and prove all the properties discussed are on the Web.< Less