Search for dissertations about: "Binary Decision Diagrams"
Showing result 11 - 15 of 15 swedish dissertations containing the words Binary Decision Diagrams.
-
11. Testing and Proving in Dependent Type Theory
Abstract : We show how random testing, model checking and interactive proving can be combined for functional program verification in dependent type theory. We extend the proof assistant Agda/Alfa for dependent type theory with a tool for random testing of functional programs, thus combining proving and testing in one system. READ MORE
-
12. Using Formal Methods for Product and Production Development -- Industrial Applications for Boolean Satisfiability Solvers
Abstract : Highly customized products and frequent changes in the production systems pose high demands on engineers. The amount of data and the complexity of the relations within the data are high. Thus, it is both error-prone and time consuming to analyze the data without software support. READ MORE
-
13. On Formal Methods for Large-Scale Product Configuration
Abstract : In product development companies mass customization is widely used to achieve better customer satisfaction while keeping costs down. To efficiently implement mass customization, product platforms are often used. A product platform allows building a wide range of products from a set of predefined components. READ MORE
-
14. All Around Logic Synthesis
Abstract : This dissertation is in the area of Computer-Aided Design (CAD) of digital Integrated Circuits (ICs). Today's digital ICs, such as microprocessors, memories, digital signal processors (DSPs), etc., range from a few thousands to billions of logic gates, flip-flops, and other components, packed in a few millimeters of area. READ MORE
-
15. SAT Based Model Checking
Abstract : This Thesis is a study of automatic reasoning about finite state machines (FSMs). Two techniques used in hardware verification are presented. In both, the verification is carried out by a translation of the problem into propositional logic. Satisfiability and validity of propositional formulas are decided by the use of a SAT solver. READ MORE