## Verifying Adder Circuits Using Powerlists (1994)

Venue: | University of Texas at Austin, Department of Computer Sciences |

Citations: | 7 - 0 self |

### BibTeX

@TECHREPORT{Adams94verifyingadder,

author = {William Adams},

title = {Verifying Adder Circuits Using Powerlists},

institution = {University of Texas at Austin, Department of Computer Sciences},

year = {1994}

}

### OpenURL

### Abstract

We define the ripple-carry and the carry-lookahead adder circuits in the powerlist notation and we use the powerlist algebra to prove that these circuits correctly implement addition for natural numbers represented as bit vectors. 0 Introduction As hardware designs increase in complexity it is less possible to reason informally about their behaviour, or to exhaustively test all possible behaviours. Several researchers have used formal systems for hardware verification, such as the Boyer-Moore logic [2], HOL [1], Nuprl [5] and Ruby [3]. We propose the use of a new data structure, the powerlist , for circuit verification. We show how powerlists may be used to express circuits and reason about their correctness. The powerlist data structure has been recently introduced by Misra [6]. It provides a notation for compactly expressing synchronous parallel computations in a functional programming style and an algebra within which properties of such computations can be proven. The notation allo...

### Citations

225 |
Predicate Calculus and program semantics
- Dijkstra, Scholten
- 1990
(Show Context)
Citation Context ...made several suggestions for improving the presentation of the material. A Appendix: additional proofs A.0 Proof format Where we give calculational proofs we use the format from Dijkstra and Scholten =-=[0]-=-. So, for example, the proof of the identity (hai 1 hbi) 1 (hci 1 hdi) = (hai j hci) j (hbi j hdi) is presented as a chain of equalities in the following format. (hai 1 hbi) 1 (hci 1 hdi) = f Pair axi... |

88 |
Why higher-order logic is a good formalism for specifying and verifying hardware
- Gordon
- 1985
(Show Context)
Citation Context ...eason informally about their behaviour, or to exhaustively test all possible behaviours. Several researchers have used formal systems for hardware verification, such as the Boyer-Moore logic [2], HOL =-=[1]-=-, Nuprl [5] and Ruby [3]. We propose the use of a new data structure, the powerlist , for circuit verification. We show how powerlists may be used to express circuits and reason about their correctnes... |

81 |
Circuit design in Ruby
- Jones, Sheeran
- 1990
(Show Context)
Citation Context ...heir behaviour, or to exhaustively test all possible behaviours. Several researchers have used formal systems for hardware verification, such as the Boyer-Moore logic [2], HOL [1], Nuprl [5] and Ruby =-=[3]-=-. We propose the use of a new data structure, the powerlist , for circuit verification. We show how powerlists may be used to express circuits and reason about their correctness. The powerlist data st... |

59 | Powerlist: A structure for parallel recursion
- Misra
- 1994
(Show Context)
Citation Context ...the powerlist , for circuit verification. We show how powerlists may be used to express circuits and reason about their correctness. The powerlist data structure has been recently introduced by Misra =-=[6]-=-. It provides a notation for compactly expressing synchronous parallel computations in a functional programming style and an algebra within which properties of such computations can be proven. The not... |

10 |
Using Nuprl for the verification and synthesis of hardware
- Leeser
- 1992
(Show Context)
Citation Context ...mally about their behaviour, or to exhaustively test all possible behaviours. Several researchers have used formal systems for hardware verification, such as the Boyer-Moore logic [2], HOL [1], Nuprl =-=[5]-=- and Ruby [3]. We propose the use of a new data structure, the powerlist , for circuit verification. We show how powerlists may be used to express circuits and reason about their correctness. The powe... |

6 |
Mapping powerlists onto hypercubes
- Kornerup
- 1994
(Show Context)
Citation Context ...= q j r or p = q 1 r for some q; r 2 P 3 ffl h\Deltai, j and 1 satisfy the powerlist axioms Misra's powerlists are one example of such a powerlist algebra, which we call the standard model . Kornerup =-=[4]-=- has another example where j and 1 are defined differently, using the Gray-code and inverse Gray-code permutations. We refer to the standard model to provide an operational interpretation of the funct... |

1 |
Jr and Bishop C Brock. Verification of a bit-slice ALU
- Hunt
- 1989
(Show Context)
Citation Context ...ible to reason informally about their behaviour, or to exhaustively test all possible behaviours. Several researchers have used formal systems for hardware verification, such as the Boyer-Moore logic =-=[2]-=-, HOL [1], Nuprl [5] and Ruby [3]. We propose the use of a new data structure, the powerlist , for circuit verification. We show how powerlists may be used to express circuits and reason about their c... |