Skip to main content

Rewriting UNITY

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 2003)

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

Included in the following conference series:

  • 320 Accesses

Abstract

In this paper we describe the implementation of the UNITY formalism as an extension of general-purpose languages and show its translation to C abstract syntax using PHOBOS, our generic front-end in the Mojave compiler. PHOBOS uses term rewriting to define the syntax and semantics of programming languages, and automates their translation to an internal compiler representation. Furthermore, it provides access to formal reasoning capabilities using the integrated MetaPRL theorem prover, through which advanced optimizations and transformations can be implemented or formal proofs derived.

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

Access this chapter

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. Stuart F. Allen, Robert L. Constable, Douglas J. Howe, and William Aitken. The semantics of reflected proof. In Proc. of Fifth Symp. on Logic in Comp. Sci., pages 95–197. IEEE, June 1990.

    Google Scholar 

  2. F. Andersen, K. Petersen, and J. Petterson. Program verification using HOL-UNITY. In International Workshop on Higher Order Logic and its Applications, volume 780 of Lecture Notes in Computer Science, pages 1–16. Springer-Verlag, Heidelberg, Germany, 1994.

    Google Scholar 

  3. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley Publishing Company, Reading, MA, USA, 1988.

    MATH  Google Scholar 

  4. Lars Cremean, William Dunbar, David van Gogh, Jason Hickey, Eric Klavins, Jason Meltzer, and Richard M. Murray. The Caltech multi-vehicle wireless testbed. In Proceedings of the Conference on Decision and Control (CDC). IEEE Press, 2002. http://www.cs.caltech.edu/~mvwt/.

  5. D. C. DeRoure. Parallel implementation of UNITY. In The PUMA and GENESIS Projects, pages 67–75, 1991.

    Google Scholar 

  6. M. J. C. Gordon and T. F. Melham. Introduction to HOL—A theorem proving environment for higher order logic. Cambridge University Press, Cambridge, England, 1993.

    MATH  Google Scholar 

  7. A. Granicz and J. Hickey. Phobos: A front-end approach to extensible compilers. In 36th Hawaii International Conference on System Sciences. IEEE, 2002.

    Google Scholar 

  8. B. Heyd and P. Cregut. A modular coding of UNITY in Coq. In Proceedings of the International Conference on Theorem Proving in Higher Order Logics (TPHOLs), 1996.

    Google Scholar 

  9. Jason Hickey and Alexey Nogin. Fast tactic-based theorem proving. In Theorem Proving in Higher Order Logics (TPHOLs 2000), August 2000.

    Google Scholar 

  10. Jason J. Hickey. Nuprl-Light: An implementation framework for higher-order logics. In 14th International Conference on Automated Deduction. Springer, 1997.

    Google Scholar 

  11. Martin Huber. MasPar UNITY version 1.0. ftp://sanfrancisco.ira.uka.de/pub/maspar/maspar_unity.tar.Z, 1992.

  12. J. Hickey, J. D. Smith, A. Granicz, N. Gray, C. Tapus, and B. Aydemir. The Mojave Research Group Website. http://mojave.cs.caltech.edu/.

  13. Eric Klavins. Communication complexity of multi-robot systems. In Fifth International Workshop on the Algorithmic Foundations of Robotics, Nice, France, December 2002. Proceedings to appear as a book in the Springer-Verlag series on advanced robotics.

    Google Scholar 

  14. Aleksey Nogin and Jason Hickey. Sequent schema for derived rules. In Theorem Proving in Higher-Order Logics (TPHOLs’ 02), 2002.

    Google Scholar 

  15. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover. Number 828 in Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, Germany, 1994.

    MATH  Google Scholar 

  16. Lawrence C. Paulson. Mechanizing UNITY in Isabelle. ACM Transactions on Computational Logic, 1(1):3–32, 2000.

    Article  MathSciNet  Google Scholar 

  17. S. Radha and C. R. Muthukrishnan. A portable implementation of UNITY on Von Neumann machines. Computer Languages, 18(1):17–30, 1993.

    Article  Google Scholar 

  18. Daniel M. Zimmerman. Dynamic UNITY. PhD thesis, Department of Computer Science, California Institute of Technology, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Granicz, A., Zimmerman, D.M., Hickey, J. (2003). Rewriting UNITY. In: Nieuwenhuis, R. (eds) Rewriting Techniques and Applications. RTA 2003. Lecture Notes in Computer Science, vol 2706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44881-0_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-44881-0_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40254-1

  • Online ISBN: 978-3-540-44881-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics