Sciweavers

503 search results - page 17 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
GLVLSI
2006
IEEE
95views VLSI» more  GLVLSI 2006»
15 years 3 months ago
Test generation using SAT-based bounded model checking for validation of pipelined processors
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...
Heon-Mo Koo, Prabhat Mishra
63
Voted
AMC
2005
138views more  AMC 2005»
14 years 9 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
WCE
2007
14 years 11 months ago
Robot Motion Planning using Hyperboloid Potential Functions
—A new approach to robot path planning using hyperboloid potential functions is presented in this paper. Unlike parabolic potential functions, where the control force increases w...
A. Badawy, Colin R. McInnes
75
Voted
DAGSTUHL
2006
14 years 11 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 1 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...