Results 1 -
1 of
1
An efficient representation for formal synthesis
- IN 10TH INTERNATIONAL SYMPOSIUM ON SYSTEM SYNTHESIS
, 1997
"... In the last years, performing synthesis by logical refinement has become an interesting alternative towards postsynthesis verification. This paper gives a case study about the complexity of formal synthesis programs within a given calculus. For a simple synthesis step, it is discussed, how one can e ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
In the last years, performing synthesis by logical refinement has become an interesting alternative towards postsynthesis verification. This paper gives a case study about the complexity of formal synthesis programs within a given calculus. For a simple synthesis step, it is discussed, how one can efficiently implement circuit transformations with respect to the complexity of the logical transformations of the underlying calculus.
