378 search results - page 37 / 76 » Automating Mathematical Program Transformations |
ISSTA
2004
ACM
15 years 4 months ago
2004
ACM
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
102
Voted
PACT
2009
Springer
15 years 5 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
100
click to vote
TPHOL
2005
IEEE
15 years 4 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
98
Voted
RR
2010
Springer
14 years 9 months ago
2010
Springer
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
GPCE
2007
Springer
15 years 5 months ago
2007
Springer
Embedded systems can be viewed as scaled-down versions of their one counterparts. In many cases, the software abstractions and libraries for embedded systems can be derived from l...