290 search results - page 49 / 58 » Theorem Proving Using Lazy Proof Explication |
79
Voted
COMPSAC
1999
IEEE
15 years 1 months ago
1999
IEEE
The use of formal methods has been growing steadily and there have been a number of successful applications of formal methods in a range of application areas. It seems agreed that...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
104
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
CADE
2007
Springer
15 years 9 months ago
2007
Springer
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
PPDP
2005
Springer
15 years 2 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....