Sciweavers

608 search results - page 70 / 122
» Interactive Oracle Proofs
Sort
View
ICCAD
2004
IEEE
260views Hardware» more  ICCAD 2004»
14 years 6 months ago
On interactions between routing and detailed placement
The main goal of this paper is to develop deeper insights into viable placement-level optimization of routing. Two primary contributions are made. First, an experimental framework...
Devang Jariwala, John Lillis
ISSTA
2009
ACM
14 years 4 months ago
An annotation assistant for interactive debugging of programs with common synchronization idioms
This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual excl...
Tayfun Elmas, Ali Sezgin, Serdar Tasiran, Shaz Qad...
DISCEX
2003
IEEE
14 years 3 months ago
Analyzing Interaction Between Distributed Denial of Service Attacks And Mitigation Technologies
Under sponsorship of the Defense Advanced Research Projects Agency’s (DARPA) Fault Tolerant Networks (FTN) program, The Johns Hopkins University Applied Physics Laboratory (JHU/...
W. J. Blackert, D. M. Gregg, A. K. Castner, E. M. ...
ICFP
2008
ACM
14 years 10 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
FOCS
2002
IEEE
14 years 2 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai