Skip to main content
SpringerLink
Log in

An Instruction Set Process Calculus

  • Conference paper
  • First Online:
Formal Methods in Computer-Aided Design (FMCAD 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1522))

Included in the following conference series:

Abstract

We have created a calculus for reasoning about hardware and firmware at the algorithmic state machine (ASM) and instructionset processor (ISP) levels of description. The calculus is a value-passing process algebra that extends the Mealy machine model to include parallel composition. It supports reasoning about the composed behavior of synchronous ASM and ISP components and microcode. We present an overview of the calculus and its application including an example showing the equivalence of a microcoded machine to its target instruction set specified by both ASM and ISP descriptions. The calculus, its properties, and the examples have been deeply embedded, proved, and verified as conservative extensions to the logic of the Higher Order Logic (HOL90) theorem prover.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. R. Barbacci. Instruction Set Processor Specifications ISPS: The Notation and its Applications. IEEE Trans. Comp., C-30(7), January 1981.

    Google Scholar 

  2. Thomas C. Bartee. Digital Computer Fundamentals — Sixth Edition. McGraw Hill New York, 1984.

    Google Scholar 

  3. Gerard Berry. The Foundations of Esterel. In G. Plotkin C. Stirling and M. Tofte, editors, Proof, Language, and Interaction: Essays in Honour of Robin Milner. MIT Press, 1998.

    Google Scholar 

  4. Christopher R. Clare. Designing Logic Systems Using State Machines. McGraw Hill, 1973.

    Google Scholar 

  5. D. Siewiorek, C. Bell, and A. Newell. Computer Structures — Principles and Examples. McGraw-Hill New York, 1982.

    Google Scholar 

  6. M.J.C. Gordon. A proof generating system for higher-order logic. In G. Birtwistle and P. A. Subramanyam, editors, VLSI specification, verification and synthesis. Kluwer, 1987.

    Google Scholar 

  7. Gordon L. Smith, Ralph Bahnsen, and Harry Halliwell. Boolean Comparison of Hardware and Flowcharts. IBM J. Res. Develop., 26(1):106–116, January 1982.

    Google Scholar 

  8. Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill New York, 1982.

    Google Scholar 

  9. T. F. Melham. A Package for Inductive Relation Definitions in HOL. In Proceedings of the 1991 International Tutorial and Workshop on the HOL Theorem Proving system. IEEE Computer Society Press, Davis, California, August 1991.

    Google Scholar 

  10. George Milne. Circal and the representation of communication, concurrency and time. In ACM Transactions on Programming Languages and Systems, April 1985.

    Google Scholar 

  11. Robin Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  12. Robin Milner. Communication and Concurrency. Prentice Hall, New York, 1989.

    MATH  Google Scholar 

  13. Monica Nesi. A Formalization of the Process Algebra CCS in Higher Order Logic. Technical Report 278, University of Cambridge, December 1992.

    Google Scholar 

  14. Colin Stirling. Modal and Temporal Logics for Processes. In Logics for Concurrency, number 1043 in Lecture Notes in Computer Science, pages 149–237. Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Semiconductor, 2900 Semiconductor Dr., Santa Clara, CA, 95052

    Shiu -Kai Chin

  2. EE/CS Dept., Syracuse University, Syracuse, NY, 13244

    Jang Dae Kim

Authors
  1. Shiu -Kai Chin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jang Dae Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Utah, 50 S Central Campus, Salt Lake City, UT, 841112-9205, USA

    Ganesh Gopalakrishnan

  2. Department of Computer Science, Brigham Young University, 3361 TMCB, Provo, UT, 84602-6576, USA

    Phillip Windley

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chin, S.K., Kim, J.D. (1998). An Instruction Set Process Calculus. In: Gopalakrishnan, G., Windley, P. (eds) Formal Methods in Computer-Aided Design. FMCAD 1998. Lecture Notes in Computer Science, vol 1522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49519-3_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-49519-3_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65191-8

  • Online ISBN: 978-3-540-49519-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation