## An Example of Interactive Hardware Transformation (1993)

### Cached

### Download Links

Citations: | 10 - 1 self |

### BibTeX

@MISC{Zhu93anexample,

author = {Zheng Zhu and Steven D. Johnson},

title = {An Example of Interactive Hardware Transformation},

year = {1993}

}

### Years of Citing Articles

### OpenURL

### Abstract

This article presents an example of correct circuit design through interactive transformation. Interactive transformation differs from traditional hardware design transformation frameworks in that it focuses on the issue of finding suitable hardware architecture for the specified system and the issue of architecture correctness. The transformation framework divides every transformation in designs into two steps. The first step is to find a proper architecture implementation. Although the framework does not guarantee existence of such an implementation, nor its discovery, it does provide a characterization of architectural implementation so that the question "is this a correct implementation?" can be answered by equational rewriting. The framework allows a correct architecture implementation to be automatically incorporated with control descriptions to obtain a new system description. The significance of this transformation framework lies in the fact that it requires simpler mechanism o...

### Citations

275 | An initial algebra approach to the specification, correctness, and implementation of abstract data types - Goguen, Thatcher, et al. - 1978 |

226 | Fundamentals of Algebraic Specification 1 - Ehrig, Mahr - 1985 |

102 |
Universal Algebra
- Grätzer
- 1979
(Show Context)
Citation Context ...s2;H2 i the following 1. 1\ 2 = ! where ! is the identity relation; 2. 1[ 2 = { where { is the complete relation. This result is a variation of Birkho 's. The proof of original result can be found in =-=[18]-=-, page 120. Furthermore, it can be proven that 1 and 2 de ned above automatically satisfy condition 2 and condition 3. They also satisfy condition 1 if and only if the algebras corresponding to s 0 1 ... |

82 |
Initiality, induction and computability
- Meseguer, Goguen
- 1985
(Show Context)
Citation Context ... cation and semantics, we NOs3. A Formal Framework of Hardware Speci cation 5 do not attempt to associate our hardware speci cation with any of the particular abstract data type semantics proposed in =-=[2, 3, 4,5,6,7]-=-. Some of the de nitions were inspired by [2]. More detailed discussion on the specifying hardware architecture in an algebraic framework can be found in [8, 9]. 3.1 Specifying Hardware Architecture a... |

49 |
Synthesis of Digital Designs from Recursion Equations. ACMDistinguished Dissertation Series
- Johnson
- 1983
(Show Context)
Citation Context ...istent with .s4. Speci cation of Hardware Systems 7 4 Speci cation of Hardware Systems This section gives a simple speci cation of circuits. It is a simpli ed version of Johnson's functional notation =-=[10]-=- with an emphasis on the idea of separating architecture from control in circuit specications. As we can see in this section that a control of a hardware system is a recursive structure over the under... |

47 |
Tutorial on high-level synthesis
- McFarland, Camposano
- 1988
(Show Context)
Citation Context ... unit, buses etc. This type of problem has been extensively studied and successfully applied to an area of design automation. It is called scheduling and allocation in high level synthesis literature =-=[16, 17]-=-. The main techniques used to solve the problem are control and data ow analysis. The second kind of resource sharing is complicated components such as memory or registers. Since these components have... |

44 |
Final algebra semantics and data type extensions
- Wand
- 1979
(Show Context)
Citation Context ... cation and semantics, we NOs3. A Formal Framework of Hardware Speci cation 5 do not attempt to associate our hardware speci cation with any of the particular abstract data type semantics proposed in =-=[2, 3, 4,5,6,7]-=-. Some of the de nitions were inspired by [2]. More detailed discussion on the specifying hardware architecture in an algebraic framework can be found in [8, 9]. 3.1 Specifying Hardware Architecture a... |

27 |
Behavior-preserving transformations for high-level synthesis
- Camposano
- 1990
(Show Context)
Citation Context ... unit, buses etc. This type of problem has been extensively studied and successfully applied to an area of design automation. It is called scheduling and allocation in high level synthesis literature =-=[16, 17]-=-. The main techniques used to solve the problem are control and data ow analysis. The second kind of resource sharing is complicated components such as memory or registers. Since these components have... |

24 | Formal verification of hardware correctness: Introduction and survey of current research - Camurati, Prinetto - 1988 |

23 | Final data types and their specification - Kamin - 1983 |

18 |
Manipulating logical organization with system factorizations
- Johnson
- 1989
(Show Context)
Citation Context ...d in pipelined architectural designs and other areas of hardware designs. In order to replace combinational signals by registers, new registers need to be introduced. However, as we have discussed in =-=[15, 19]-=- that introducing new registers will not a ect the correctness of circuit description if they are not referenced in the datapaths to those original registers. Let G a set of combinational signals an a... |

16 |
OBJ as a theorem prover, with application to hardware verification
- Goguen
- 1989
(Show Context)
Citation Context ...s theorem is that it characterizes implementation in terms of equational rewriting mechanisms. Therefore, the correctness of implementations can be examined with a help of theorem provers such as OBJ =-=[13]-=- and AFFIRM [14]. In the example, the rst derivor d was to transfer an architecture with stack to one with memory (From Speci cation 2. to Speci cation 3.). It is speci ed as follows: 1. The function ... |

13 |
An Initial Algebra Approach to the Speci cation, Correctness and Implementation of Abstract Data Types
- Goguen, Thatcher, et al.
- 1978
(Show Context)
Citation Context ... cation and semantics, we NOs3. A Formal Framework of Hardware Speci cation 5 do not attempt to associate our hardware speci cation with any of the particular abstract data type semantics proposed in =-=[2, 3, 4,5,6,7]-=-. Some of the de nitions were inspired by [2]. More detailed discussion on the specifying hardware architecture in an algebraic framework can be found in [8, 9]. 3.1 Specifying Hardware Architecture a... |

13 |
Fundamentals of Algebraic Speci cation 1
- Ehrig, Mahr
- 1985
(Show Context)
Citation Context |

12 |
A tactical framework for digital design
- Johnson, Bose, et al.
- 1988
(Show Context)
Citation Context ...)) Speci cation 1 The Machine Speci cation 1 is a simple stackmachine speci cation. The rst transformation is the abstraction or encapsulation of all the arithmetic operations into an arithmetic unit =-=[11, 12]-=-. The result of the transformation is Speci cation 2. machine (M-i, a-i, S) = if rd(M-i, a-i)=='stop' then machine (M-i, a-i, S) else machine (M-i, dcr(a-i), push(arith(rd(M-i, a-i), top(S), top(pop(S... |

10 | An Overview of AFFIRM: A Specification and Verification System. Information Processing 80 - Gerhart, Musser, et al. - 1980 |

6 |
An algebraic framework for data abstraction in hardware description
- Zhu, Johnson
- 1990
(Show Context)
Citation Context ...ata type semantics proposed in [2, 3, 4,5,6,7]. Some of the de nitions were inspired by [2]. More detailed discussion on the specifying hardware architecture in an algebraic framework can be found in =-=[8, 9]-=-. 3.1 Specifying Hardware Architecture and System Let S be a set of sorts. An S-sorted signature isanS! S-sorted familyh w!sj w2S and s2Si. An element of w!s is a function symbol of arity w and of sor... |

5 |
A system of digital design derivation
- Johnson, Bose
- 1989
(Show Context)
Citation Context ...)) Speci cation 1 The Machine Speci cation 1 is a simple stackmachine speci cation. The rst transformation is the abstraction or encapsulation of all the arithmetic operations into an arithmetic unit =-=[11, 12]-=-. The result of the transformation is Speci cation 2. machine (M-i, a-i, S) = if rd(M-i, a-i)=='stop' then machine (M-i, a-i, S) else machine (M-i, dcr(a-i), push(arith(rd(M-i, a-i), top(S), top(pop(S... |

4 |
An algebraic characterization of structural synthesis for hardware
- Zhu, Johnson
- 1989
(Show Context)
Citation Context ...ata type semantics proposed in [2, 3, 4,5,6,7]. Some of the de nitions were inspired by [2]. More detailed discussion on the specifying hardware architecture in an algebraic framework can be found in =-=[8, 9]-=-. 3.1 Specifying Hardware Architecture and System Let S be a set of sorts. An S-sorted signature isanS! S-sorted familyh w!sj w2S and s2Si. An element of w!s is a function symbol of arity w and of sor... |

2 |
Final data types and their speci cation
- Kamin
- 1983
(Show Context)
Citation Context |

2 |
A formal language model of local microcode synthesis
- Mahmood, Mavaddat, et al.
- 1989
(Show Context)
Citation Context ...is analogous to the problems of allocation and scheduling in high level synthesis (e.g. [16, 17]), register allocation and code generation in compiler design (e.g [20]) and microcode generation (e.g. =-=[21]-=-). [9] gives a formalization of the serialization problem in the current algebraic framework. Unfortunately, it is readily proved that the serialization problem is unsolvable in general [9]. Neverthel... |

2 | Universal Algebra - atzer, G - 1979 |

1 |
Formal veri cation of hardware correctness: Introduction and survey of current research
- Camurati, Prinetto
- 1988
(Show Context)
Citation Context ...rs have recognized the necessity of combining them. The power of veri cation systems is usually measured by their expressiveness. But a trade-o for expressiveness is proof complexity in those systems =-=[1]-=-. The following diagram gives a list of formal systems in the order of their expressive power versus the degree of proof complexity. A compromise between expressiveness and proof complexity has always... |

1 |
Initial and nal algebra semanitcs for data type speci cation: Two characterization theorems
- Bergstra, Tucker
- 1983
(Show Context)
Citation Context |

1 |
An overview of AFFIRM: A speci cation and veri cation system
- Gerhart, Musser, et al.
- 1980
(Show Context)
Citation Context ...t it characterizes implementation in terms of equational rewriting mechanisms. Therefore, the correctness of implementations can be examined with a help of theorem provers such as OBJ [13] and AFFIRM =-=[14]-=-. In the example, the rst derivor d was to transfer an architecture with stack to one with memory (From Speci cation 2. to Speci cation 3.). It is speci ed as follows: 1. The function is: is identity ... |

1 |
A product oriented hardware algebra
- Zhu, Johnson
- 1990
(Show Context)
Citation Context ...nted out this mapping is actually the one for an abstract data type (stack) to another (memory/address) rather than H 1! H 2. But since we can prove that the product preserves implementation relation =-=[15]-=-, we consider that the mapping of H 1!H 2 as the natural extension of that of the abstract data types. Let Es and Em denote the sets of equations specifying stack and memory respectively 1 and Ea deno... |

1 |
Current research of serialization problem in digital design derivation
- Boyer, Zhu
- 1990
(Show Context)
Citation Context ...9]. Nevertheless, heuristic algorithms have been found to cope with similar problems (such as register allocation or microcode generation). Although research e ort has been made to solve this problem =-=[22]-=-, nding suitable heuristics to solve the serialization problem remains a topic in our research. 7 Conclusion This paper presents a formalized approachtohardware design derivation. The basic idea is un... |

1 | Initial and final algebra semanitcs for data type specification: Two characterization theorems - Bergstra, Tucker - 1983 |