798 search results - page 63 / 160 » Proving More Properties with Bounded Model Checking |
135
click to vote
OOPSLA
2001
Springer
15 years 8 months ago
2001
Springer
Checking pre- and post-conditions of procedures and methods at runtime helps improve software reliability. In the procedural world, pre- and post-conditions have a straightforward...
179
click to vote
SIAMCOMP
2011
14 years 7 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
126
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
144
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
131
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...