3228 search results - page 226 / 646 » Computationally Sound Proofs |
141
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
170
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
178
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
158
click to vote
CGI
1997
IEEE
15 years 10 months ago
1997
IEEE
In this article we propose a model of a tennis game simulation with synthetic actors as players and a referee. The behavior of these actors is based on their synthetic vision and ...
155
click to vote
ASIAN
2003
Springer
15 years 10 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...