메뉴 건너뛰기




Volumn 56, Issue 10, 2007, Pages 1401-1414

Automatic verification of arithmetic circuits in RTL using stepwise refinement of term rewriting systems

Author keywords

Arithmetic logic unit; Hardware description languages; Register transfer level implementation; Verification

Indexed keywords

COMPUTER CIRCUITS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; MULTIPLYING CIRCUITS; VERIFICATION;

EID: 34548775713     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2007.1073     Document Type: Article
Times cited : (36)

References (40)
  • 2
    • 0028416361 scopus 로고
    • Using Term Rewriting to Verify Software
    • Apr
    • S. Antoy and J. Gannon, "Using Term Rewriting to Verify Software," IEEE Trans. Software Eng., vol. 20, no. 4, pp. 259-274, Apr. 1994.
    • (1994) IEEE Trans. Software Eng , vol.20 , Issue.4 , pp. 259-274
    • Antoy, S.1    Gannon, J.2
  • 5
    • 0001146101 scopus 로고
    • A Signed Binary Multiplication Technique
    • A.D. Booth, "A Signed Binary Multiplication Technique," J. Mechanics and Applied Math., pp. 236-240, 1951.
    • (1951) J. Mechanics and Applied Math , pp. 236-240
    • Booth, A.D.1
  • 6
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • Aug
    • R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.
    • (1986) IEEE Trans. Computers , vol.35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 7
    • 0026107125 scopus 로고
    • On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
    • Feb
    • R.E. Bryant, "On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication," IEEE Trans. Computers, vol. 40, no. 2, pp. 205-213, Feb. 1991.
    • (1991) IEEE Trans. Computers , vol.40 , Issue.2 , pp. 205-213
    • Bryant, R.E.1
  • 14
    • 0004179302 scopus 로고
    • Microprocessor Verification in PVS: A Methodology and Simple Example
    • Technical Report SRI-CSL-93-12, Menlo Park, Calif
    • D. Cyrluk, "Microprocessor Verification in PVS: A Methodology and Simple Example," Technical Report SRI-CSL-93-12, Menlo Park, Calif., 1993.
    • (1993)
    • Cyrluk, D.1
  • 16
    • 0001582662 scopus 로고    scopus 로고
    • A Mechanically Checked Proof of IEEE Compliance of a Register-Transfer-Level Specification of the AMD-K7 Floating-Point Multiplication, Division, and Square Root Instructions
    • Dec
    • D.M. Russinoff, "A Mechanically Checked Proof of IEEE Compliance of a Register-Transfer-Level Specification of the AMD-K7 Floating-Point Multiplication, Division, and Square Root Instructions," LMS J. Computation and Math., vol. 1, pp. 148-200, Dec. 1998.
    • (1998) LMS J. Computation and Math , vol.1 , pp. 148-200
    • Russinoff, D.M.1
  • 20
    • 0009899010 scopus 로고    scopus 로고
    • Correctness and Verification of Hardware Systems Using Maude
    • Univ. of Wales, Swansea
    • N. Harman, "Correctness and Verification of Hardware Systems Using Maude," technical report, Univ. of Wales, Swansea, 2000.
    • (2000) technical report
    • Harman, N.1
  • 24
    • 0003197380 scopus 로고
    • An Overview of Rewrite Rule Laboratory (RRL)
    • D. Kapur and H. Zhang, "An Overview of Rewrite Rule Laboratory (RRL)," J. Computer and Math. with Applications, vol. 29, no. 2, pp. 91-114, 1995.
    • (1995) J. Computer and Math. with Applications , vol.29 , Issue.2 , pp. 91-114
    • Kapur, D.1    Zhang, H.2
  • 26
    • 0001834942 scopus 로고
    • Term Rewriting Systems
    • S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, eds, Oxford Univ. Press
    • J. Klop, "Term Rewriting Systems," Handbook of Logic in Computer Science, S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, eds., vol. 2, pp. 1-116. Oxford Univ. Press, 1992.
    • (1992) Handbook of Logic in Computer Science , vol.2 , pp. 1-116
    • Klop, J.1
  • 27
    • 34548704527 scopus 로고    scopus 로고
    • M. Kaufmann and D. Russinoff, Verification of Pipeline Circuits, Proc. ACL2 Workshop 2000, Technical Report TR-00-29, Dept. of Computer Sciences, Univ. of Texas at Austin, Oct. 2000.
    • M. Kaufmann and D. Russinoff, "Verification of Pipeline Circuits," Proc. ACL2 Workshop 2000, Technical Report TR-00-29, Dept. of Computer Sciences, Univ. of Texas at Austin, Oct. 2000.
  • 29
    • 0029720348 scopus 로고    scopus 로고
    • An Efficient Equivalence Checker for Combinational Circuits
    • Y. Matsunaga, "An Efficient Equivalence Checker for Combinational Circuits," Proc. 33rd Conf. Design Automation (DAC '96), pp. 629-634, 1996.
    • (1996) Proc. 33rd Conf. Design Automation (DAC '96) , pp. 629-634
    • Matsunaga, Y.1
  • 30
    • 85029644584 scopus 로고
    • Using the HOL Prove Assistant for Proving the Correctness of Term Rewriting Rules Reducing Terms of Sequential Behavior
    • M. Mutz, "Using the HOL Prove Assistant for Proving the Correctness of Term Rewriting Rules Reducing Terms of Sequential Behavior," Proc. Third Int'l Workshop Computer Aided Verification (CAV '91), pp. 277-287, 1991.
    • (1991) Proc. Third Int'l Workshop Computer Aided Verification (CAV '91) , pp. 277-287
    • Mutz, M.1
  • 36
    • 0022121184 scopus 로고
    • High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
    • Sept
    • N. Takagi, H. Yasuura, and S. Yajima, "High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree," IEEE Trans. Computers, vol. 34, no. 9, pp. 789-796, Sept. 1985.
    • (1985) IEEE Trans. Computers , vol.34 , Issue.9 , pp. 789-796
    • Takagi, N.1    Yasuura, H.2    Yajima, S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.