Sciweavers

1302 search results - page 76 / 261
» Free-Style Theorem Proving
Sort
View
RANDOM
1999
Springer
14 years 2 days ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav
ACL2
2006
ACM
13 years 11 months ago
Combining ACL2 and an automated verification tool to verify a multiplier
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...
Erik Reeber, Jun Sawada
CIIA
2009
13 years 9 months ago
LCF-style for Secure Verification Platform based on Multiway Decision Graphs
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
Sa'ed Abed, Otmane Aït Mohamed
EC
2006
163views ECommerce» more  EC 2006»
13 years 7 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
JCT
2008
109views more  JCT 2008»
13 years 7 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon