Sciweavers

2905 search results - page 276 / 581
» Formal Memetic Algorithms
Sort
View
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
15 years 4 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
DATE
2003
IEEE
112views Hardware» more  DATE 2003»
15 years 4 months ago
Automatic Generation of Simulation Monitors from Quantitative Constraint Formula
System design methodology is poised to become the next big enabler for highly sophisticated electronic products. Design verification continues to be a major challenge and simulat...
Xi Chen, Harry Hsieh, Felice Balarin, Yosinori Wat...
TLDI
2003
ACM
134views Formal Methods» more  TLDI 2003»
15 years 4 months ago
Scrap your boilerplate: a practical design pattern for generic programming
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
Ralf Lämmel, Simon L. Peyton Jones
AINA
2010
IEEE
15 years 4 months ago
Active Data Selection for Sensor Networks with Faults and Changepoints
Abstract—We describe a Bayesian formalism for the intelligent selection of observations from sensor networks that may intermittently undergo faults or changepoints. Such active d...
Michael A. Osborne, Roman Garnett, Stephen J. Robe...
DAC
2009
ACM
15 years 3 months ago
Non-cycle-accurate sequential equivalence checking
We present a novel technique for Sequential Equivalence Checking (SEC) between non-cycle-accurate designs. The problem is routinely encountered in verifying the correctness of a s...
Pankaj Chauhan, Deepak Goyal, Gagan Hasteer, Anmol...