Sciweavers

797 search results - page 136 / 160
» Eliminating Proofs from Programs
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 months ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke
ICALP
2003
Springer
14 years 3 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ICSE
2010
IEEE-ACM
14 years 2 months ago
An empirical study of optimizations in YOGI
Though verification tools are finding industrial use, the utility of engineering optimizations that make them scalable and usable is not widely known. Despite the fact that seve...
Aditya V. Nori, Sriram K. Rajamani
SP
2000
IEEE
14 years 2 months ago
A Practically Implementable and Tractable Delegation Logic
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum
FSTTCS
1999
Springer
14 years 2 months ago
Hoare Logic for Mutual Recursion and Local Variables
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
David von Oheimb