Sciweavers

798 search results - page 117 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Strong Supervision From Weak Annotation: Interactive Training of Deformable Part Models
We propose a framework for large scale learning and annotation of structured models. The system interleaves interactive labeling (where the current model is used to semiautomate t...
Steven Branson, Pietro Perona, Serge Belongie
DLT
2007
13 years 9 months ago
Duplication Roots
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
Peter Leupold
IANDC
2010
84views more  IANDC 2010»
13 years 6 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit deï...
Arie Matsliah, Ofer Strichman
POPL
2007
ACM
14 years 8 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...
CADE
2002
Springer
14 years 8 months ago
Reasoning by Symmetry and Function Ordering in Finite Model Generation
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...
Gilles Audemard, Belaid Benhamou