| One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f = (f 1 ; : : : ; f m ) : f0; 1g n ! f0; 1g m have to deal with is nding sublogic which can be shared by di erent outputs, i.e., nding boolean functions = ( 1 ; : : : ; h ) : f0; 1g p ! f0; 1g h which can be used as common sublogic of good realizations of f 1 ; : : : ; f m . In this paper we...

In this paper we present several techniques for modeling and formal verification of the Fairisle Asynchronous Transfer Mode (ATM) switch fabric using Multiway Decision Graphs (MDGs). MDGs represent a new class of decision graphs which subsumes ROBDDs while accommodating abstract sorts and uninterpreted function symbols. The ATM device we investigated is in use for real applications in the Cambr...

1 Communication Based FPGA Synthesis for Multi-Output Boolean Functions Christoph Scholl Paul Molitor Department of Computer Science Department of Computer Science Universit at des Saarlandes Martin-Luther Universit at Halle D 66041 Saarbr ucken, FRG D-06099 Halle (Saale), FRG Tel: ++49 681 302-2274 Tel: ++49 345 622 529 Fax: ++49 681 302-4421 Fax: ++49 345 622 514 e-mail: [email protected]...

Selman and Kautz’s work on knowledge compilation has established how approximation (strengthening and/or weakening) of a propositional knowledgebase can be used to speed up query processing, at the expense of completeness. In the classical approach, the knowledge-base is assumed to be presented as a propositional formula in conjunctive normal form (CNF), and Horn functions are used to overand u...

Today’s digital designs have reached a magnitude making it intractable for humans to develop designs on a gate level. Large designs are developed with help of hardware description languages like VHDL, or with other methods using high level of abstraction. Computer based synthesis tools are applied to transfer those descriptions to layouts for implementation in programmable circuits like Field P...

node with a fresh abstract variable. However, the reachable state spaceis unnecessarily enlarged since states that are not within processor-like loops arealso generalized. As a trade-o , we propose a heuristic solution to this problem:After a certain number of state transitions (speci ed by the user), if the MDGsize of the frontier-set keeps increasing, the value of each state v...

In the modern world secure data transfer and privacy is becoming a major problem. Smart cards and other embedded devices use an encryption technology for secure data transfer. If a person want to obtain the secret data that is encrypted within these cards he can obtain it by measuring the power supply current of such device while it is performing an encryption and carefully analyzing it mathema...

protocol : THEORY BEGIN File : TYPE = fNONE,ONE,MANYg Msg : TYPE = [# first: bool, last: bool, toggle: bool #] State : TYPE = [# file : File, rn : bool, afile : bool, ... #] The automaton speci cation also changes but this is acceptable since Theorem 1 admits an abstract property pa distinct from the concrete property pc. We omit the details of this new automaton speci cation. In the abstract v...