Sciweavers

793 search results - page 112 / 159
» Argumentation and standards of proof
Sort
View
EUROCRYPT
2006
Springer
14 years 2 months ago
Composition Implies Adaptive Security in Minicrypt
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
Krzysztof Pietrzak
AFRIGRAPH
2001
ACM
14 years 2 months ago
Exploiting coherence of shadow rays
We present independent method to reduce the number of shadow ray tests. It can be used with standard acceleration ray tracing algorithms. Our method is conservative and produces t...
Andrzej Lukaszewski
APLAS
2003
ACM
14 years 2 months ago
Executing Verified Compiler Specification
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
Koji Okuma, Yasuhiko Minamide
AGP
1998
IEEE
14 years 2 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
GECCO
2000
Springer
158views Optimization» more  GECCO 2000»
14 years 2 months ago
Grammar based function definition in Grammatical Evolution
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the fu...
Michael O'Neill, Conor Ryan