Abstract
This paper describes a tool for use in user-directed synthesis of circuits specified using the relational VLSI description language Ruby. The synthesis method is based on syntactic rewriting of Ruby terms, combined with the introduction of constraints into the specification. The rewriting process is described in a meta-language based on the use of tactics and tacticals, which makes it possible to develop complex specialised strategies for the refinement of specifications.
Chapter PDF
Keywords
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.
References
A. Church. The Calculi of Lambda-conversion. Princeton University Press, Princeton, New Jersey, 1941.
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Science, Volume B: Formal Models and Semantics, chapter 6, pages 243–320. Elsevier Science Publishers B.V., 1990.
M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.
G. Jones and M. Sheeran. Circuit design in Ruby. In Jørgen Staunstrup, editor, Formal Methods for VLSI Design, pages 13–70. Elsevier Science Publishers B.V., 1990.
G. Jones and M. Sheeran. Relations and refinement in circuit design. In C. C. Morgan and J. C. P. Woodcock, editors, Proceedings of the 3rd. BCS FACS Workshop on Refinement, Workshops in Computing, pages 133–152, London, January 1991. BCS, Springer-Verlag.
P. Martin-Löf. Constructive mathematics and computer programming. In C. A. R. Hoare and J. C. Shepherdson, editors, Mathematical Logic and Programming Languages, pages 167–184. Prentice-Hall, London, 1985. Also published in Proc. 6th. International Congress for Logic, Methodology and Philosophy of Science, 153–175 (North-Holland, 1982).
L. C. Paulson. Logic and Computation, volume 2 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1987.
Ole Rasmussen. A Ruby rewrite system. Master's thesis, Dept. of Computer Science, Technical University of Denmark, February 1992.
L. Rossen. Formal Ruby. In Jørgen Staunstrup, editor, Formal Methods for VLSI Design, pages 179–190. Elsevier Science Publishers B.V., 1990.
L. Rossen. Proving (facts about) Ruby. In G. Birtwhistle, editor, IV Higher Order Workshop, Banff, Workshops in Computing, pages 265–283. Springer-Verlag, 1990.
L. Rossen. Ruby algebra. In G. Jones and M. Sheeran, editors, Designing Correct Circuits, Oxford 1990, Workshops in Computing, pages 297–312. Springer-Verlag, 1990.
R. Sharp. T-Ruby: A tool for handling Ruby expressions. Technical Report ID-TR: 1992-112, Dept. of Computer Science, Technical University of Denmark, September 1992.
R. Sharp. The Ruby framework. Technical Report ID-TR: 1993-xx, Dept. of Computer Science, Technical University of Denmark, 1993. To appear.
R. Sharp and O. Rasmussen. Transformational rewriting with Ruby. In L. Claesen, editor, CHDL'93. IFIP WG10.2, Elsevier Science Publishers, B.V., 1993. To appear.
J. Smith. The identification of propositions and types in Martin-Löf's type theory: A programming example. In M. Karpinski, editor, Foundations of Computation Theory, volume 158 of Lecture Notes in Computer Science, pages 445–456, Berlin, 1983. Springer-Verlag.
D. Weise. Constraints, abstraction and verification. In M. Leeser and G. Brown, editors, Workshop on Hardware Specification, Verification and Synthesis: Mathematical Aspects, volume 408 of Lecture Notes in Computer Science, pages 25–39. Springer-Verlag, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharp, R., Rasmussen, O. (1993). Rewriting with constraints in T-ruby. In: Milne, G.J., Pierre, L. (eds) Correct Hardware Design and Verification Methods. CHARME 1993. Lecture Notes in Computer Science, vol 683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021727
Download citation
DOI: https://doi.org/10.1007/BFb0021727
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56778-3
Online ISBN: 978-3-540-70655-7
eBook Packages: Springer Book Archive