Sciweavers

6608 search results - page 940 / 1322
» On the Completeness of Model Checking
Sort
View
ECCC
2011
202views ECommerce» more  ECCC 2011»
15 years 1 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
16 years 8 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
DAC
2005
ACM
16 years 7 months ago
Word level predicate abstraction and refinement for verifying RTL verilog
el Predicate Abstraction and Refinement for Verifying RTL Verilog Himanshu Jain CMU SCS, Pittsburgh, PA 15213 Daniel Kroening ETH Z?urich, Switzerland Natasha Sharygina CMU SCS an...
Himanshu Jain, Daniel Kroening, Natasha Sharygina,...
ICSE
2008
IEEE-ACM
16 years 7 months ago
A verification system for timed interval calculus
Timed Interval Calculus (TIC) is a highly expressive set-based notation for specifying and reasoning about embedded real-time systems. However, it lacks mechanical proving support...
Chunqing Chen, Jin Song Dong, Jun Sun 0001
WWW
2005
ACM
16 years 7 months ago
Using XForms to simplify Web programming
The difficulty of developing and deploying commercial web applications increases as the number of technologies they use increases and as the interactions between these technologie...
Richard Cardone, Danny Soroker, Alpana Tiwari