Sciweavers

115 search results - page 9 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
CC
2004
Springer
163views System Software» more  CC 2004»
14 years 23 days ago
Declarative Composition of Stack Frames
When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Christian Lindig, Norman Ramsey
ICLP
2009
Springer
14 years 8 months ago
Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
Henning Christiansen, Ole Torp Lassen
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 27 days ago
Learned mutation strategies in genetic programming for evolution and adaptation of simulated snakebot
In this work we propose an approach of incorporating learned mutation strategies (LMS) in genetic programming (GP) employed for evolution and adaptation of locomotion gaits of sim...
Ivan Tanev
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
14 years 1 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks