Sciweavers

3335 search results - page 82 / 667
» Grid result checking
Sort
View
FMCAD
2004
Springer
15 years 5 months ago
Simple Bounded LTL Model Checking
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-fo...
Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A...
ITCC
2000
IEEE
15 years 4 months ago
Segmentation of Brazilian Bank Check Logos without a Priori Knowledge
This paper presents a method to locate and extract Brazilian bank check logos automatically by employing mathematical morphology. The objective is to minimize the number of heuris...
Andreia de Jesus, Jacques Facon
ACL
1993
15 years 1 months ago
Using Bracketed Parses to evaluate a Grammar Checking Application
We describe a method for evaluating a grammar checking application with hand-bracketed parses. A randomly-selected set of sentences was submitted to a grammar checker in both brac...
Richard H. Wojcik, Philip Harrison, John Bremer
DFT
2005
IEEE
64views VLSI» more  DFT 2005»
15 years 5 months ago
Implementation of Concurrent Checking Circuits by Independent Sub-circuits
The present paper proposes a new method for detecting arbitrary faults in a functional circuit when the set of codewords is limited and known in advance. The method is based on im...
Vladimir Ostrovsky, Ilya Levin
ISQED
2002
IEEE
175views Hardware» more  ISQED 2002»
15 years 4 months ago
On the Relation between SAT and BDDs for Equivalence Checking
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...
Sherief Reda, Rolf Drechsler, Alex Orailoglu