911 search results - page 117 / 183 » Combining programs and state machines |
CADE
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
KBSE
1999
IEEE
14 years 1 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
JFP
2008
13 years 8 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
ICML
1995
IEEE
14 years 9 months ago
1995
IEEE
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...