1322 search results - page 175 / 265 » Unsound Theorem Proving |
128
Voted
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
We present a functional approach, based on the ACL2 logic, for the specification of system on a chip communication architectures. Our decomposition of the communications allows the...
127
click to vote
APLAS
2001
ACM
15 years 7 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
124
click to vote
AUSAI
2003
Springer
15 years 7 months ago
2003
Springer
We investigate why discretization is effective in naive-Bayes learning. We prove a theorem that identifies particular conditions under which discretization will result in naiveBay...
131
click to vote
FMCAD
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
133
Voted
TYPES
2000
Springer
15 years 6 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...