2584 search results - page 210 / 517 » On the Forward Checking Algorithm |
126
click to vote
SAS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
110
click to vote
TIT
2002
15 years 2 months ago
2002
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
121
click to vote
ATVA
2004
Springer
15 years 6 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
111
click to vote
PEPM
2000
ACM
15 years 5 months ago
2000
ACM
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
112
Voted
CSR
2008
Springer
15 years 4 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...