Ensuring correctness of ruby transformations

Authors:
Ole Rasmussen
Affiliations:
Dept. of Information Technology, Technical University of Denmark, Lyngby
Venue:
DCC'96 Proceedings of the 3rd international conference on Designing Correct Circuits
Year:
1996

Citing 4
Cited 2

Set theory for verification. I: from foundations to functions

Journal of Automated Reasoning
Using a language of functions and relations for VLSI specification

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Reasoning about Array Structure Using a Dependently Typed Logic

CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
Transformational Rewriting with Ruby

CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications

The T-Ruby Design System

Formal Methods in System Design
Decidability results for sets with atoms

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Equivalence transformations are widely used in practical designs of VLSI circuits using Ruby. This paper demonstrates how proofs of these equivalences easily may be performed within a formal framework by a theorem prover. The proof tool used is called RubyZF and contains a semantical embedding of Ruby within Zermelo-Fraenkel set theory using the Isabelle theorem prover. The use of the system is exemplified by a concrete example taken from the T-Ruby design system.