177 search results - page 29 / 36 » Machine Checking Proof Theory: An Application of Logic to Lo... |
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
ATVA
2009
Springer
14 years 1 months ago
2009
Springer
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
FM
2009
Springer
13 years 12 months ago
2009
Springer
We study a clock synchronization protocol for the Chess WSN. First, we model the protocol as a network of timed automata and verify various instances using the Uppaal model checker...