(Enter summary)
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. (Update)
Context of citations to this paper: More
.... parallel prefix computation, and hardware architectures, as well as hardware circuits, including carry look ahead and ripple carry adders [1]. Informally speaking, flat) powerlists are lists of length 2 k ; k 0, of the same type of elements, called scalars by Misra, with a...
...holds for j but not for is (35) due to the ambiguity that arises when deconstructing the arguments using . 2 Adder circuits In [Ada94] Will Adams presented powerlist descriptions for two arithmetic circuits that perform addition on natural numbers: the ripple carry adder and...
Cited by: More
Powerlist: A Structure for Parallel Recursion - Misra (1994)
(Correct)
Mechanical Verification of Adder Circuits using Powerlists - Kapur, Subramaniam (1996)
(Correct)
Data Structures for Parallel Recursion - Kornerup (1997)
(Correct)
Similar documents (at the sentence level):
73.6%: Verifying Adder Circuits Using Powerlists - William Adams (1994)
(Correct)
Active bibliography (related documents): More All
0.2: Toward a Super Duper Hardware Tactic - Mark Aagaard Miriam (1993)
(Correct)
0.1: Computational Models And Program Synthesis For Parallel Out-Of-Core .. - Li (1996)
(Correct)
0.1: Mapping a Functional Notation for Parallel Programs onto Hypercubes - Kornerup (1995)
(Correct)
Similar documents based on text: More All
1.1: Defthms About Zip and Tie: Reasoning About Powerlists in ACL2 - Gamboa (1997)
(Correct)
1.0: Odd-Even Sort in Powerlists - Kornerup (1996)
(Correct)
0.9: Parlists - a Generalization of Powerlists - Kornerup (1997)
(Correct)
Related documents from co-citation: More All
8: Automated reasoning about parallel algorithms using powerlists (context) - Kapur, Subramaniam - 1994
6: Parallel prefix computation (context) - Ladner, Fisher - 1980
5: ACM Transactions on Programming Languages and Systems (context) - Misra, for et al. - 1994
BibTeX entry: (Update)
Will Adams. Verifying adder circuits using powerlists. Technical Report TR 94-02, Dept. of Computer Science, Univ. of Texas at Austin, Austin, Texas 78712, Mar. 1994. http://citeseer.ist.psu.edu/adams94verifying.html More
@techreport{ adams94verifying,
author = "William Adams",
title = "Verifying Adder Circuits Using Powerlists",
number = "CS-TR-94-02",
month = "1,",
year = "1994",
url = "citeseer.ist.psu.edu/adams94verifying.html" }
Citations (may not include all citations):
141
Predicate calculus and program semantics (context) - Dijkstra, Scholten - 1990
85
Circuit design in Ruby (context) - Jones, Sheeran - 1990
81
Why higher-order logic is a good formalism for specifying an.. (context) - Gordon - 1985
32
Powerlist: a structure for parallel recursion
- Misra - 1994
14
Using Nuprl for the verification and synthesis of hardware (context) - Leeser - 1992
8
Verification of a bit-slice ALU
- Hunt, Bishop et al. - 1989
8
Mapping powerlists onto hypercubes (context) - Kornerup - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/ftp/pub/techreports/): More
Parametric Quantitative Temporal Reasoning - Emerson, Trefler (1999)
(Correct)
Two Problems of TCP AIMD Congestion Control - Yang, Kim, Zhang, Lam (2000)
(Correct)
Enhanced Word Clustering for Hierarchical Text Classification - Dhillon, Mallela, Kumar (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC