Sciweavers

1021 search results - page 28 / 205
» Concepts in Proof Planning
Sort
View
ICRA
1999
IEEE
109views Robotics» more  ICRA 1999»
14 years 28 days ago
Self-Reconfiguration Planning with Compressible Unit Modules
We discuss a robotic system composed of Crystalline modules. Crystaline modules can aggregate together to form distributed robot systems. Crystalline modules can move relative to ...
Daniela Rus, Marsette Vona
COLT
2004
Springer
14 years 11 days ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
ICFP
2009
ACM
14 years 9 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ICFP
2005
ACM
14 years 8 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 3 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...