Sökning: "logic synthesis"

Visar resultat 1 - 5 av 53 avhandlingar innehållade orden logic synthesis.

1. 1. Representation of Compositional Relational Programs

   Författare :Görkem Paçacı; Andreas Hamfelt; Alberto Pettorossi; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Programming; Syntax; Logic Programming; Combilog; CombInduce; Prolog; Variable-free; Point-free; Tacit; Compositional Relational Programming; Combinatory Logic; Predicate-Functor Logic; Program Synthesis; Meta-interpreters; Meta-interpretative Synthesis; Decompositional Synthesis; Inductive Synthesis; Inductive Logic Programming; Usability; Cognitive Dimensions of Notations; Visual Variables; Usability testing; Programming Language usability; Empirical evidence; Informationssystem; Information Systems;

   Sammanfattning : Usability aspects of programming languages are often overlooked, yet have a substantial effect on programmer productivity. These issues are even more acute in the field of Inductive Synthesis, where programs are automatically generated from sample expected input and output data, and the programmer needs to be able to comprehend, and confirm or reject the suggested programs. LÄS MER

3. 2. All Around Logic Synthesis

   Författare :Maxim Teslenko; Hannu Tenhunen; Michel Berklaar; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph dominators; FPGA mapping; redundancy removal; RBN; Computer science; Datavetenskap;

   Sammanfattning : 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. LÄS MER

4. 3. Graph dominators in logic synthesis and verification

   Författare :René Krenz; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formal verification; logic synthesis; dominators; equivalence checking; decomposition; Computer science; Datavetenskap;

   Sammanfattning : This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. LÄS MER

5. 4. Dominator-based Algorithms in Logic Synthesis and Verification

   Författare :René Krenz-Bååth; Johnny Öberg; Joao Marques-Silva; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; graph dominators; formal verification; logic synthesis; equivalence checking; decomposition; Electrical engineering; Elektroteknik;

   Sammanfattning : Today's EDA (Electronic Design Automation) industry faces enormous challenges. Their primary cause is the tremendous increase of the complexity of modern digital designs. Graph algorithms are widely applied to solve various EDA problems. LÄS MER

7. 5. Runtime Service Composition via Logic-Based Program Synthesis

   Författare :Sven Lämmermann; KTH; []
   Nyckelord :service composition; logic-based program synthesis; intuitionistic logic; natural deduction; specification; Java;

   Sammanfattning : .... LÄS MER