1422 search results - page 128 / 285 » Complementation in Abstract Interpretation |
121
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
151
click to vote
LCPC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we propose an approach to automatic compiler parallelization based on language extensions that is applicable to a broader range of program structures and a...
136
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
144
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
152
click to vote
ACSD
2006
IEEE
15 years 10 months ago
2006
IEEE
Recently, the formal approach of I–Systems has been newly hed through an abstract axiomatic system where events in system components are solely derived and defined from their b...