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 20 of 58 for “"Bounded Model Checking"”.
-
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 …
-
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. …
-
Bounded model checking v nástroji Java PathFinder
… práce je věnovaná aplikaci formální metody bounded model checking pro automatickou opravu chyb. Oprava se specializuje na chyby spojené se souběžností. Práce je zaměřena na programy napsané v jazyce Java, a proto pro verifikační metodu byl zvolen model checker Java Pathfinder, který je určen …
-
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 …
-
Expressive and efficient bounded model checking of concurrent software
… threaded and concurrent programs, based on the model checker ESBMC. A<br/>technique for evaluating LTL formulae over finite program traces is proposed and evaluated over a piece of industrial software and a suite of benchmarks, with favourable results. Efficient formulations of the model …
-
Automata-theoretic and bounded model checking for linear temporal logic
In this work we study methods for model checking the temporal logic LTL. The focus is on the automata-theoretic approach to model checking and bounded model checking. We begin by examining automata-theoretic methods to model check LTL safety properties. The model checking problem can be reduced to …
-
Expressive and Efficient Memory Representation for Bounded Model Checking of C programs
… approaches rely on the theory of arrays to model memory access. The limitation of the theory of arrays in terms of scalability and compatibility with SAT/SMT solvers is well-known, and there has been many attempts at optimizing either the theory itself or memory encodings based on theory of …
-
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 …
-
Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction
… of this thesis, a novel approach for k-induction bounded model checking using signal domain constraints and property partitioning for proving unreachability of branches in Verilog RTL code is presented. To do this, it approach uses program slicing with respect to the variables of the property …
-
Efficient symbolic model checking of concurrent systems
… methods are gaining popularity. Symbolic model checking techniques are based on modeling the behavior of the system as a formula and reducing the analysis problem to symbolic manipulation of formulas by computational tools. In this work, the aim is to make symbolic model checking, in …
-
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 …
-
Formal Verification of Time-Triggered Systems
… protocols must be error-free. The following modeling considerations make the formal verification of these protocols difficult: faults, real-time constraints, distributed control, nonfunctional behavioral requirements, and intricate protocol interactions. We describe a methodology for the …
-
Symbolische Methoden für die probabilistische Verifikation : Zustandsraumreduktion und Gegenbeispiele
… interaktive Markow-Ketten sind weitverbreitete Modellklassen zur Analyse von stochastischen Systemen. Ein grundlegendes Problem bei ihrer Analyse ist die Anzahl der Zustände. Diese wächst nämlich im Allgemeinen exponentiell in der Größe des zugehörigen Highlevel-Modells. <br> <br>Wir entwickeln …
-
Improving Scalability for Formal Analysis through Automated Tightening of Analysis Bounds
… novel approaches to improving the scalability of bounded model checking, a formal technique frequently used to analyze software designs and systems. First, I describe a method of analyzing evolving software systems which can automatically determine domain-specific optimizations that can …
-
Advancing Property Directed Reachability for Classical and Fully Observable Nondeterministic Planning
… that has been developed in the 21st century for model checking hardware and software systems, as well as for automated planning. To solve classical planning problems, PDR searches iteratively solve a series of small decision problems about whether a particular state can be progressed a single …
-
Witness generation in existential CTL model checking
… verifies the system early in the design phase, model checking explores the state space of the system exhaustively and rigorously to determine if the system satisfies the specifications and detect fatal errors that may be missed by simulation and testing. One essential advantage of model checking …
-
Formal Verification of Concurrent Embedded Software
… based on the formal verification technique, bounded model checking. The internal model is able to represent an entire automotive control unit, including the hardware configuration as well as real-time operating systems like AUTOSAR and OSEK. The proof engine used to check the model is a newly …
-
Formal Verification of Concurrent Embedded Software
… based on the formal verification technique, bounded model checking. The internal model is able to represent an entire automotive control unit, including the hardware configuration as well as real-time operating systems like AUTOSAR and OSEK. The proof engine used to check the model is a newly …
-
Smart Contract Analysis Through Communication Abstractions
… and to accelerate counterexample search in bounded analysis (e.g., fuzzing and bounded model checking). We implement local bundle abstraction in SmartACE, and show order-of-magnitude improvements in time when compared to a state-of-the-art smart contract verification tool.
-
Design Verification for Sequential Systems at Various Abstraction Levels
… performance and capacity of a typical SAT-based bounded model checking framework. Secondly, we present a novel method for performing dynamic abstraction within a framework for abstraction-refinement based model checking. Experiments on a wide range of industrial designs have shown that the …
Page 1 of 3