236 search results - page 2 / 48 » Automated Generation of Interesting Theorems |
EC
2008
13 years 4 months ago
2008
This work describes how evolutionary computation can be used to synthesize lowlevel image operators that detect interesting points on digital images. Interest point detection is a...
FLOPS
2010
Springer
13 years 12 months ago
2010
Springer
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
IJAIT
2006
13 years 5 months ago
2006
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
CADE
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...