115 search results - page 9 / 23 » Verifying Probabilistic Procedural Programs |
171
Voted
ICFP
2009
ACM
15 years 11 months ago
2009
ACM
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...
103
Voted
CC
2004
Springer
15 years 3 months ago
2004
Springer
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...
182
Voted
ICLP
2009
Springer
15 years 11 months ago
2009
Springer
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...
83
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
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...
91
Voted
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...