We formalise the derivation of logic programs from their speciications by deductive synthesis, and introduce the notion of uniform equivalence between logical systems. This enables us to present an incompleteness result for deductive synthesis of logic programs from rst-order logic speciications.

Most problems in logic synthesis are computationallyhard, and are solved using heuristics. This often makes algorithms un-stable; if the input is changed slightly, the new result of synthesis can be significantly different. A designer can spend much effort hand-optimizing a circuit, so it is desirable to retain as much of this human insight as possible. This motivates the need for incremental s...

A theory of composition synthesis based on inhabitation in combinatory logic is described and illustrated with examples. Composition synthesis automatically generates applicative combinations of typed combinators inhabiting a goal type. In the intended applications, combinatory type environments model repositories of components, and types are used to specify their interfaces enriched with seman...

Reversible logic synthesis is important for the design of conventional logic systems such as adiabatic logic and also for quantum logic systems since all quantum logic gates are necessarily reversible in nature. A framework is presented that improves reversible logic synthesis by employing a dynamically determined variable order for quantum multiple-valued decision diagrams (QMDD). We demonstra...

This paper describes the synthesis of dynamic differential logic to increase the resistance of FPGAs against Differential Power Analysis. Compared with an existing technique, it saves more than a factor 2 in slice utilization. Experimental results indicate that a secure version of the AES algorithm can now be implemented with a mere doubling of the slice utilization when compared with a normal ...

A function is reversible if each input vector produces a unique output vector. Reversible functions find many applications, especially in low power design, quantum computing, optical computing, and nanotechnology. Logic synthesis for reversible circuits differs substantially from traditional logic synthesis and is an active field of research at the moment. In this paper, we present the first pr...

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. The creation of such highly complex systems would not be possible without...

This report provides an overview of the current state of reversible sequential logic. We assume that the reader has a basic knowledge of reversible logic. An overview of necessary information is provided in [1]. Most research in reversible logic has concentrated on synthesis techniques for combinational logic. Sequential logic synthesis requires the incorporation of memory cells and feedback in...

Precomputation is a recently proposed logic optimization technique which selectively disables the inputs of a sequential logic circuit, thereby reducing switching activity and power dissipation, without changing logic functionality. In this paper, we present new precomputation architectures for both combinational and sequential logic and describe new precomputation-based logic synthesis methods...