Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"Bounded Model Checking (BMC)"”.
-
Bounded model checking of multi-threaded programs via sequentialization
… represent thread interleavings) with bounded model-checking (BMC) can be effective for finding errors in concurrent software.<br/><br/>Specifically, we target multi-threaded C programs with POSIX threads. We make the following contributions: (1) evaluate the Lal-Reps sequentialization …
-
Techniques for the formal verification of analog and mixed- signal designs
… of correct functionality, in addition to checking whether an AMS design is robust with respect to different types of inaccuracies like parameter tolerances, nonlinearities, etc. The verification framework described in this thesis is composed of two proposed methodologies each concerned …
-
Scalable and precise verification based on k-induction, symbolic execution and floating-point theory
… reasoning of realworld C programs using either Bounded Model Checking (BMC) or symbolic execution. We present three main contributions. <br/><br/>First, we describe three new technologies developed in a software verification tool to handle real-world programs: (1) a frontend based on a …
-
Bounded Model Checking of Industrial Code
Abstract: Bounded Model Checking(BMC) is an effective and precise static analysis technique that reduces program verification to satisfiability (SAT) solving. However, with a few exceptions, BMC is not actively used in software industry, especially, when compared to dynamic analysis techniques such …
-
SMT-based bounded model checking of multi-threaded software in embedded systems
… effectively about large embedded software using bounded model checking (BMC) based on Satisfiability Modulo Theories (SMT) techniques. We present three major novel contributions. First, we extend the encodings from previous SMT-based bounded model checkers to provide more accurate support for …
-
Verifikation unvollständiger Schaltkreise
… in denen einige Teile unbekannt sind; wir modellieren diese unbekannten Bereiche durch „Black Boxes“ mit unbekanntem sequentiellen Verhalten. Wir nehmen an, dass Black Boxes durch beliebige sequentielle Schaltkreise mit der gleichen Anzahl von Ein- und Ausgängen ersetzt werden können. …
-
HDL slicing for verification and test
… derived from its register-transfer level (RTL) model. Based on this approach, an elegant and a systematic approach based on “program slicing”, that allows it to be scalable for large designs, is developed. The theoretical basis for applying program slicing on hardware description languages …
-
Abstraction and Refinement Techniques for Ternary Symbolic Simulation with Guard-value Encoding
… Boolean verification algorithms such as Boolean Bounded Model Checking (BMC), as well as usually at least 2X and often 10X improvement over conventional ternary abstraction. Our memory abstraction significantly improves how the verification time scales with the design parameters and the depth …
-
Techniques and tools for the verification of concurrent systems
<p>Model checking is an automatic formal verification technique for establishing correctness of systems. It has been widely used in industry for analysing and verifying complex safety-critical systems in application domains such as avionics, medicine and computer security, where manual testing is …
-
On bounded model checking of asynchronous systems
… Transition Systems (LTSs) using a symbolic model checking technique called Bounded Model Checking (BMC). BMC is a technique that seeks to answer the question whether among the system's executions shorter than some given number of steps there is one (or more) violating a given property. …
-
Strategies for Performance and Quality Improvement of Hardware Verification and Synthesis Algorithms
… various EDA applications such as equivalence checking, model checking, Automatic Test Pattern Generation (ATPG), functional Bi-decomposition, and technology mapping need to keep pace with these challenges. In this thesis, we are concerned with improving the quality and performance of different …
-
Enhancing SAT-based Formal Verification Methods using Global Learning
… methods for design verification are Equivalence Checking and Model Checking. Equivalence Checking requires that the implementation circuit should be exactly equivalent to the specification circuit (golden model). In other words, for each possible input pattern, the implementation circuit should …
-
Abstractions and formal verification of max-plus linear systems
… practical applications, MPL systems are used to model synchronisation phenomena without concurrency. Such are widely used in railway networks, manufacturing plants, and modelling and studying biological systems. The dual of MPL systems is Min-Plus Linear (MiPL) systems which use minimisation and …
-
Exploring Abstraction Techniques for Scalable Bit-Precise Verification of Embedded Software
… more formal verification techniques have begun modeling a non-Boolean data variable as a bit-vector with bounded width (i.e. a vector of multiple bits like 32- or 64- bits) to implement bit-precise verification. One major challenge in the scalable application of such bit-precise verification on …