203 search results - page 2 / 41 » Proof Reflection in Coq |
TPHOL
2000
IEEE
13 years 8 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed the experiments in proof assistant Coq that are reported here.
TLCA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
CADE
2003
Springer
14 years 5 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...