Constructive mathematics and computer programming
Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Constraints, abstraction and verification
Proceedings of the Mathematical Sciences Institute workshop on Hardware specification, verification and synthesis: mathematical aspects
Transformational Design in a Theorem Prover
Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience
A Formalisation of the VHDL Simulation Cycle
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
VHDL Description and Formal Verification of Systolic Multipliers
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
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
An Embedding of Ruby in Isabelle
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A declarative approach to incremental custom computing
FCCM '95 Proceedings of the IEEE Symposium on FPGA's for Custom Computing Machines
Ensuring correctness of ruby transformations
DCC'96 Proceedings of the 3rd international conference on Designing Correct Circuits
Compiling Hardware Descriptions with Relative Placement Information for Parametrised Libraries
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Synchronous digital circuits as functional programs
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This paper describes the T-Ruby system for designing VLSI circuits,starting from formal specifications in which they are described in terms ofrelational abstractions of their behaviour. The design process involvescorrectness-preserving transformations based on proved equivalences betweenrelations, together with the addition of constraints. A class ofimplementable relations is defined. The tool enables such relations to besimulated or translated into a circuit description in VHDL. The designprocess is illustrated by the derivation of a circuit for 2-dimensionalconvolution.