7393 search results - page 107 / 1479 » Synthesis-for-testability using transformations |
174
click to vote
QCQC
1998
Springer
15 years 7 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
109
click to vote
UML
2005
Springer
15 years 8 months ago
2005
Springer
We present Tefkat, an implementation of a language designed speci cally for the transformation of MOF models using patterns and rules. The language adopts a declarative paradigm, w...
135
click to vote
LOPSTR
1997
Springer
15 years 7 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
133
click to vote
ENTCS
2006
15 years 3 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
122
click to vote
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...