Specifying in OBJ, Verifying in REVE and Some Ideas about Time

  • Victoria Stavridou
Part of the Advances in Formal Methods book series (ADFM, volume 2)


It is widely recognised that formal specification and verification plays an important role in the design and construction of both software and hardware systems. In this paper we investigate the applicability of the OBJ specification language and the REVE theorem prover, both of which have been traditionally used in connection with software development, as tools for the specification and verification of digital systems. We therefore identify the aspects of these systems which are relevant to hardware development. In particular, we are concerned with optimising proofs in REVE and specifying behaviour of circuits through time.


Inference Rule Equational Theory Critical Pair Full Adder Automatic Theorem Prover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.A. Ashcroft and W.W. Wadge. Lucid - a non-procedural language with iteration. Comm. ACM, 20 (7), July 1977.Google Scholar
  2. [2]
    L. Bachmair, N. Dershowitz and J. Hsiang. Orderings for Equational Proofs. In Procs. of Symposium on Logic in Computer Science, IEEE, Boulder, Colorado, USA, 1987.Google Scholar
  3. [3]
    W.F. Clocksin. Logic Programming and the Specification of Circuits. Technical Report 72, University of Cambridge Computer Laboratory, Corn Exchange Street, Cambridge CB2 3QG, 1985.Google Scholar
  4. [4]
    M.S. Chandrasekhar, J.P. Privitera and K.W. Condrat. Application of Term Rewriting Techniques to Hardware Design Verification. In Procs. 24th Design Automation Conference, Miami, Florida, June 1987.Google Scholar
  5. [5]
    K. Futatsugi, J.A. Goguen, J-P. Jouannaud and J. Meseguer. Principles of OBJ2. In Procs. of Symposium on Principles of Programming Languages, pages 52–66, 1985.Google Scholar
  6. [6]
    J.A. Goguen. How to prove algebraic inductive hypotheses without induction: with applications to the correctness of data type representations. In Proceedings, Fifth Conference on Automated Deduction, pages 356373, Springer-Verlag, 1980. Lecture Notes in Computer Science, Volume 87Google Scholar
  7. [7]
    J.A. Goguen. Principles of Paramterized Programming. 1987. SRI International, Menlo Park, CA 94025, USA.Google Scholar
  8. [8]
    M.J.C. Gordon. HOL: A Machine Oriented Formulation of Higher Order Logic. Technical Report 68, Computer Laboratory, University of Cambridge, Corn Exchange Street, Cambridge CB2 3QG, UK, July 1985.Google Scholar
  9. [9]
    G. Huet and J.M. Hullot. Proof by Induction in Equational Theories with Constructors. JCCS, 2 (25), 1982.Google Scholar
  10. [10]
    G. Huet and D. Oppen. Equations and Rewrite Rules: A Survey. In R. Book, editor, Formal Languages: Perspectives and Open Problems, Academic Press, 1980.Google Scholar
  11. [11]
    J. Hsiang. Refutational Theorem Proving using Term Rewriting Systems. Ph.D. dissertation, University of Illinois at Champaign-Urbana, 1981.Google Scholar
  12. [12]
    D. Knuth and P. Bendix. Simple Word Problems in Universal Algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297, Pergamon Press, 1970.Google Scholar
  13. [13]
    D. Kapur and D.R. Musser. Proof by Consistency. Artificial Intelligence Journal, 1987. To appear.Google Scholar
  14. [14]
    D. Kapur, G. Sivakumar and H. Zhang. RRL: A Rewrite Rule Laboratory. In Procs. of 8th Conference on Automated Deduction, Oxford, UK, 1986.Google Scholar
  15. [15]
    P. Lescanne. Computer experiments with the REVE Term Rewriting System Generator. In Proceedings of the Tenth ACM Symposium on the Principles of Programming Languages, Austin, Texas, January 1983.Google Scholar
  16. [16]
    D.R. Musser and D.A. Cyrluk. Affirm-85 Reference Manual. General Electric Corporate Research and Development Center, Schenectady, NY 12301, August 1985.Google Scholar
  17. [17]
    D.R. Musser, P. Narendran and W.J. Premerlani. BIDS: A Method for Specifying and Verifying Bidirectional Hardware Devices. In Proc. of Hardware Verification Workshop, Calgary, Canada, January 1987.Google Scholar
  18. [18]
    P. Narendran and J. Stillman. Hardware Verification in the Interactive VHDL Workstation. G.E. Corporate Research and Development Center, Schenectady, NY 12345, USA, 1986.Google Scholar
  19. [19]
    V. Stavridou, H. Barringer and D.A. Edwards. Formal Specification and Verification of Hardware: A Comparative Case Study. Technical Report UMCS–87–11–1, Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, UK, 1987.Google Scholar
  20. [20]
    VHDL Tutorial for IEEE Standard 1076 VHDL. CAD Language Systems Inc, 51 Monroe St. Suite 606, Rockville, MD 20850, USA, draft edition, May 1987.Google Scholar
  21. [21]
    C.D. Walter, R.M. Gallimore, D. Coleman and V. Stavridou. UMIST OBJ Manual Version 1.0, 1986. Computation Department, UMIST, Manchester M60 1 QD, UK.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Victoria Stavridou
    • 1
  1. 1.SRI InternationalMenlo ParkUSA

Personalised recommendations