Scalable Bit Precise Formal Verification by Nannan (6 results)

Paperback. Condition: Brand New. 212 pages. 8.66x5.91x0.48 inches. In Stock.

Taschenbuch. Condition: Neu. Scalable Bit-precise Formal Verification of Embedded Software | Nannan He | Taschenbuch | 212 S. | Englisch | 2016 | LAP LAMBERT Academic Publishing | EAN 9783659936548 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Many of the automatic formal verification techniques choose to model a non-Boolean program variable as a bit-vector with bounded width (i.e. a vector of multiple bits like 32- or 64- bits) to achieve bit-precise verification. The major challenge of applying such formal technique to real-world embedded software is scalability. This book explores several abstraction techniques to deal with this challenge. It first proposes a tight integration of program slicing, which is an important static program analysis technique, with bounded model checking. Then it presents a new symbolic simulation for scalable formal verification. This simulation involves using distinguishing Xs as symbolic values to abstract concrete variables' values. It also defines two testability metrics - controllability and observability - as the high-level structural guidance to improve efficiency of the proof-based abstraction refinement framework. This book finally proposes a novel algorithm to discover path-oriented non-uniform encoding widths of individual variables, which may be smaller than their original modeling width but large enough for formal verification. 212 pp. Englisch.…

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Many of the automatic formal verification techniques choose to model a non-Boolean program variable as a bit-vector with bounded width (i.e. a vector of multiple bits like 32- or 64- bits) to achieve bit-precise verification. The major challenge of applying such formal technique to real-world embedded software is scalability. This book explores several abstraction techniques to deal with this challenge. It first proposes a tight integration of program slicing, which is an important static program analysis technique, with bounded model checking. Then it presents a new symbolic simulation for scalable formal verification. This simulation involves using distinguishing Xs as symbolic values to abstract concrete variables' values. It also defines two testability metrics - controllability and observability - as the high-level structural guidance to improve efficiency of the proof-based abstraction refinement framework. This book finally proposes a novel algorithm to discover path-oriented non-uniform encoding widths of individual variables, which may be smaller than their original modeling width but large enough for formal verification.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: He NannanDr. Nannan He is an assistant professor in the Department of ECET at Minnesota State University, US. She received her PhD in Computer Engineering from Virginia Tech,US(2009),and did post-doctoral research in the Computer Sci.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Many of the automatic formal verification techniques choose to model a non-Boolean program variable as a bit-vector with bounded width (i.e. a vector of multiple bits like 32- or 64- bits) to achieve bit-precise verification. The major challenge of applying such formal technique to real-world embedded software is scalability. This book explores several abstraction techniques to deal with this challenge. It first proposes a tight integration of program slicing, which is an important static program analysis technique, with bounded model checking. Then it presents a new symbolic simulation for scalable formal verification. This simulation involves using distinguishing Xs as symbolic values to abstract concrete variables' values. It also defines two testability metrics - controllability and observability - as the high-level structural guidance to improve efficiency of the proof-based abstraction refinement framework. This book finally proposes a novel algorithm to discover path-oriented non-uniform encoding widths of individual variables, which may be smaller than their original modeling width but large enough for formal verification.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 212 pp. Englisch.…