Jeroen Voeten
Abstract
The completeness of a collection of design transformations is an important aspect in transformational design. Completeness guarantees that any correct design can in principle be explored using the transformation system. In the field of transformational design the problem of incompleteness is not well understood and it is often believed that complete transformation systems can be constructed. In this article, we show, using a formal framework based on the theory of computation, that this is not the case if the transformation system is based on an expressive general-purpose design language such as VHDL. Only when restrictions are imposed on the design language and correctness relation, a transformation system can be made complete in theory, but this is expected to result in serious practical problems. It is shown that the incompleteness problem in transformational design is closely related to the syntactic variance problem in high-level synthesis and that this latter problem is not solvable in general either.
- BOLOGNESI, T. 1992. Catalogue of LOTOS correctness-preserving transformations. Tech. Rep. Lo/WP1/T1.2/N0045/V03, LotoSphere Consortium, Univ. Twente, Twente, The Netherlands.Google Scholar
- CAMPASANO, R. 1989. Behaviour-preserving transformations for high-level synthesis. In Proceedings of the Mathematical Sciences Institute Workshop (New York). Springer-Verlag, Berlin, Germany, pp. 106-128. Google Scholar
- CHAIYAKUL, V., GAJSKI,D.,AND RAMACHANDRAN, L. 1993. High-level transformations for minimizing syntactic variances. In Proceedings of DAC'93 (Dallas, Texas). IEEE Computer Society Press, Los Alamitos, Calif., pp. 413-418. Google Scholar
- CHERNIAVSKY, J. 1976. Simple programs realize exactly Presberger formulas. SIAM J. Comput. 5, 4, 666-677.Google Scholar
- GAJSKI, D. 1994. Introduction to high-level synthesis. IEEE Des. Test Comput. (Winter), 44-54. Google Scholar
- HILFINGER, P. 1985. A high-level language and silicon compiler for digital signal processing. In Proceedings of IEEE CICC Conference (Portland, Ore.). IEEE Computer Society Press, Piscat-away, N.J. pp. 213-216.Google Scholar
- HOFSTADTER, D. 1979. G~del, Escher, Bach: An Eternal Golden Braid. Basic Books, New York. Google Scholar
- HUIJS, C. 1996. A graph rewriting approach for transformational design of digital systems. In Proceedings of Euromicro'96 (Prague, Czech Republic). IEEE Computer Society Press, Los Alamitos, Calif., pp. 177-184.Google Scholar
- JANSSEN, M., CATTHOOR,F.,AND DE MAN, H. 1994. A specification invariant technique for operation cost minimisation in flow-graphs. In Proceedings of the 7th International Symposium on High- Level Synthesis (Niagara-on-the-Lake, Ontario, Canada). IEEE Computer Society Press, Los Alamitos, Calif., pp. 146-151. Google Scholar
- KROL,T.,VAN MEERBERGEN, J., NIESSEN, C., SMITS,W.,AND HUISKEN, J. 1992. The Sprite Input Language: an intermediate format for high level synthesis. In Proceedings of 3rd EDAC(Brussels, Belgium). IEEE Computer Society Press, Los Alamitos, Calif., pp. 186-192.Google Scholar
- LEWIS, H., AND PAPADIMITRIOU, C. 1981. Elements of the Theory of Computation. Prentice-Hall, Engelwood Cliffs, N.J. Google Scholar
- MEYER, A., AND RITCHIE, D. 1967. The complexity of loop programs. In Proceedings of 22nd National Conference of ACM (Washington D.C.). ACM, New York, pp. 465-469. Google Scholar
- MIDDELHOEK, P. 1997. Transformational Design: An Architecture Independent Interactive Design Methodology for the Synthesis of Correct and Efficient Digital Systems. Ph.D. dissertation. Univ. Twente, The Netherlands.Google Scholar
- MIDDELHOEK,P.,AND RAJAN, S. 1996. From VHDLto efficient and first-time-right designs: A formal approach. ACM Trans. Des. Automat. Elec. Syst. 1, 2, 205-250. Google Scholar
- ODIFREDDI, P. 1989. Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. North-Holland, Amsterdam, The Netherlands.Google Scholar
- TSICHRITZIS, D. 1970. The equivalence problem of simple programs. J. ACM 17, 4 (Oct.), 729-738. Google Scholar
- VAN MEERBERGEN, J., LIPPENS, P., VERHAEGH,W.,AND VAN DER WERF, A. 1995. PHIDEO: High-level synthesis for high throughput applications. J. VLSI Sig. Proc. 9, 89-104. Google Scholar
- VEMURI, R. 1990. How to prove the completeness of a set of register level design transformations. In Proceedings of DAC'90 (Orlando, Fla.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 207-212.Google Scholar
- VOETEN,J.,VAN DER PUTTEN,P.,AND STEVENS, M. 1996. Behaviour-preserving transformations in SHE : A formal approach to architecture design. In Proceedings of EUROMICRO'96 (Prague, Czech Republic). IEEE Computer Society Press, Los Alamitos, Calif., pp. 19-27.Google Scholar
Index Terms
- On the fundamental limitations of transformational design
Recommendations
A Henkin-Style Completeness Proof for the Modal Logic S5
Logic and ArgumentationAbstractThis paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell [8], but the system, based on a ...
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and ProofsThe completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
A reification calculus for model-oriented software specification
AbstractThis paper presents a transformational approach to the derivation of implementations from model-oriented specifications of abstract data types.
The purpose of this research is to reduce the number of formal proofs required in model refinement, ...
Comments