Sciweavers

1076 search results - page 114 / 216
» Operations on proofs and labels
Sort
View
PLDI
2003
ACM
14 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
HYBRID
1998
Springer
14 years 1 months ago
Formal Verification of Safety-Critical Hybrid Systems
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
Carolos Livadas, Nancy A. Lynch
AML
2008
124views more  AML 2008»
13 years 9 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
JOC
2010
82views more  JOC 2010»
13 years 3 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
CVPR
2007
IEEE
14 years 11 months ago
Real-time Planar Surface Segmentation in Disparity Space
An iterative Segmentation-Estimation framework for segmentation of planar surfaces in the disparity space is implemented on a Digital Signal Processor (DSP). Disparity of a scene ...
Ninad Thakoor, Sungyong Jung, Jean Gao