7393 search results - page 454 / 1479 » Synthesis-for-testability using transformations |
165
click to vote
SIAMSC
2010
15 years 1 months ago
2010
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
192
click to vote
TII
2010
15 years 1 months ago
2010
-This paper deals with refactoring of execution control charts of IEC 61499 basic function blocks as a means to improve the engineering support potential of the standard in develop...
196
Voted
PEPM
2012
ACM
14 years 1 months ago
2012
ACM
We share a vision of connecting the topics of bidirectional transformation and inductive program synthesis, by proposing to use the latter in approaching problematic aspects of th...
175
Voted
ACL
2012
13 years 8 months ago
2012
We present a novel approach to the task of word lemmatisation. We formalise lemmatisation as a category tagging task, by describing how a word-to-lemma transformation rule can be ...
142
click to vote
ENTCS
2008
15 years 6 months ago
2008
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and...