171 search results - page 11 / 35 » CoSP: a general framework for computational soundness proofs |
ASIAN
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
IACR
2011
13 years 11 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
BIRTHDAY
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
DAGSTUHL
2003
15 years 1 months ago
2003
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
118
click to vote
CADE
2009
Springer
16 years 7 days ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...