506 search results - page 16 / 102 » Where Is the Value in a Program Verifier |
128
click to vote
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
91
Voted
ATVA
2009
Springer
15 years 7 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
110
Voted
ENTCS
2007
15 years 11 days ago
2007
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
109
click to vote
DISOPT
2007
15 years 12 days ago
2007
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...
118
Voted
FORTE
2010
15 years 1 months ago
2010
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...