Sciweavers

570 search results - page 40 / 114
» From Program Verification to Program Synthesis
Sort
View
129
Voted
LPAR
2004
Springer
15 years 7 months ago
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
Mark Bickford, Robert L. Constable, Joseph Y. Halp...
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
15 years 3 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
161
Voted
TSE
2010
120views more  TSE 2010»
14 years 9 months ago
Efficient Software Verification: Statistical Testing Using Automated Search
Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. Test data are g...
Simon M. Poulding, John A. Clark
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
15 years 7 months ago
Evolving stochastic processes using feature tests and genetic programming
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
Brian J. Ross, Janine H. Imada
AUSSOIS
2001
Springer
15 years 7 months ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi