Todays Electronic Design Automation industry is greatly affected by increased Non Recurring Engineering (NRE) costs and Time-to-Market (TTM) due to the incremental and iterative steps followed in the conventional digi...
详细信息
ISBN:
(纸本)9781479969654
Todays Electronic Design Automation industry is greatly affected by increased Non Recurring Engineering (NRE) costs and Time-to-Market (TTM) due to the incremental and iterative steps followed in the conventional digital IC design and automation flow. Reducing NRE cost and TTM at the same time is a daunting task to the research community without compromising on the performance. However, the complexity of hierarchical design steps can be reduced drastically by mapping the input register-transfer level (RTL) description directly to their corresponding physical designs stored in pre-computed technology libraries. We use the Dynamic Libraries, which store the layouts of the already designed blocks and their references for the later use in further designs which reduces the design time and design cost significantly. Further we have exploited the functional symmetry and negation-permutation-negation (NPN) class representations to decoct the library size and number of comparisons to further improvise on design time which results in reduced TTM. the functional symmetry reduced the number of required pre-computed circuits in our experiments from 1031 to 222 (464.4% reduction in the memory size). We further validated our methodology with adders and multiplier blocks which are the basic elements of any processor or controller.
the integration of the generate-and-test paradigm and semirings for the aggregation of results provides a parallel programming framework for large scale data-intensive applications. the so-called GTA framework allows ...
详细信息
In this paper, we describe a compiler back end and library for web client application development in Agda, a dependently typed functionalprogramming language. the compiler back end targets ECMAScript (also known as J...
详细信息
the proceedings contain 18 papers. the topics discussed include: a library for declarative resolution-independent 2D graphics;analysing the entire Wikipedia history with database supported Haskell;a declarative compos...
ISBN:
(纸本)9783642452833
the proceedings contain 18 papers. the topics discussed include: a library for declarative resolution-independent 2D graphics;analysing the entire Wikipedia history with database supported Haskell;a declarative compositional timing analysis for multicores using the latency-rate abstraction;a portable and efficient implementation of coinductive logicprogramming;logicObjects: enabling logicprogramming in Java through linguistic symbiosis;a declarative-friendly API for web document manipulation;the generalized intensional transformation for implementing lazy functional languages;Terminyzer: an automatic non-termination analyzer for large logic programs;reversible language extensions and their application in debugging;dependently typed web client applications: FRP in Agda in HTML5;proS QLite: Prolog file based databases via an SQLite interface;and parallel performance of declarative programming using a PGAS model.
To improve debugging turnaround time of complex System-on-chip (SoC) designs on FPGA based logic emulation systems, it is important to minimize the iterations through design recompilation or FPGA reconfiguration proce...
详细信息
We present the design of a compiler for a functionallogicprogramming language and discuss the compiler's implementation. the source program is abstracted by a constructor based graph rewriting system obtained fr...
详细信息
ISBN:
(纸本)9783642298226
We present the design of a compiler for a functionallogicprogramming language and discuss the compiler's implementation. the source program is abstracted by a constructor based graph rewriting system obtained from a functionallogic program after syntax desugaring, lambda lifting and similar transformations provided by a compiler's front-end. this system is non-deterministic and requires a specialized normalization strategy. the target program consists of 3 procedures that execute graph replacements originating from either rewrite or pull-tab steps. these procedures are deterministic and easy to encode in an ordinary programming language. We describe the generation of the 3 procedures, discuss the correctness of our approach, highlight some key elements of an implementation, and benchmark the performance of a proof-of-concept. Our compilation scheme is elegant and simple enough to be presented in one page.
this paper presents the functional composition (FC), a new paradigm for combinational logic synthesis. FC is based on the following principles: (1) representation of logic functions as a bonded pair of functional/stru...
详细信息
ISBN:
(纸本)9781467310369
this paper presents the functional composition (FC), a new paradigm for combinational logic synthesis. FC is based on the following principles: (1) representation of logic functions as a bonded pair of functional/structural representations;(2) it starts from a set of initial functions;(3) simpler functions are associated to create more complex ones;(4) a partial order that enables dynamic programming is respected;(5) a set of allowed functions is maintained to reduce execution time/memory consumption. We present functional composition algorithms variants for Boolean factoring, AIG rewriting, minimum decision chain computation and SOP generation.
this paper discusses the use of logicprogramming techniques in the specification and verification of secure systems. the secure systems specifications discussed are formal and directly executable. the advantages of e...
详细信息
functionallogic languages extend the setting of functionalprogramming by non-deterministic choices, free variables and narrowing. Most existing approaches to simulate logic features in functional languages do not pr...
详细信息
ISBN:
(纸本)9783642244513
functionallogic languages extend the setting of functionalprogramming by non-deterministic choices, free variables and narrowing. Most existing approaches to simulate logic features in functional languages do not preserve laziness, i.e., they can only model strict logicprogramming like in Prolog. Lazy functionallogicprogramming however, has interesting properties supporting a more declarative style of programming search without sacrificing efficiency. We will present a recently developed technique to reduce all logic extensions to the single problem of generating unique identifiers. the impact of this reduction is a general scheme for compiling functionallogic programs to lazy functional programs without side effects. One of the design goals is that the purely functional parts of a program should not suffer from significant run-time overhead. Preliminary experiments confirm our hope for significant improvements of run-time performance even for non-deterministic programs but suggest further work to improve the memory requirements of those.
this paper shows how belief revision techniques can be used in Defeasible logic to change rule-based theories characterizing the deliberation process of cognitive agents. We discuss intention reconsideration as a stra...
详细信息
ISBN:
(纸本)9783642225451;9783642225468
this paper shows how belief revision techniques can be used in Defeasible logic to change rule-based theories characterizing the deliberation process of cognitive agents. We discuss intention reconsideration as a strategy to make agents compliant withthe norms regulating their behavior.
暂无评论