Sciweavers

10715 search results - page 113 / 2143
» From Tests to Proofs
Sort
View
B
2007
Springer
14 years 1 months ago
Security Policy Enforcement Through Refinement Process
Abstract. In the area of networks, a common method to enforce a security policy expressed in a high-level language is based on an ad-hoc and manual rewriting process [24]. We argue...
Nicolas Stouls, Marie-Laure Potet
RAS
2006
100views more  RAS 2006»
13 years 9 months ago
Aibo and Webots: Simulation, wireless remote control and controller transfer
This article introduces a new software tool that provides an accurate simulation of Sony Aibo robots and the capability to transfer controller programs from the simulation to the ...
Lukas Hohl, Ricardo A. Téllez, Olivier Mich...
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...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 11 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
TIT
2008
76views more  TIT 2008»
13 years 9 months ago
Improved Risk Tail Bounds for On-Line Algorithms
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
Nicolò Cesa-Bianchi, Claudio Gentile