547 search results - page 103 / 110 » On Automated Program Construction and Verification |
CADE
2003
Springer
14 years 8 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
ILP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
KDD
1998
ACM
14 years 20 days ago
1998
ACM
BAYDA is a software package for flexible data analysis in predictive data mining tasks. The mathematical model underlying the program is based on a simple Bayesian network, the Na...