1302 search results - page 94 / 261 » Free-Style Theorem Proving |
DAC
2003
ACM
14 years 11 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
CSL
2002
Springer
13 years 10 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
FAC
2000
13 years 10 months ago
2000
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
INFORMATICALT
2000
13 years 10 months ago
2000
Two models for an age-structured nonlimited population dynamics with maternal care of offspring are presented. One of them deals with a bisexual population and includes a harmonic ...