Sciweavers

8132 search results - page 153 / 1627
» Dependability, Abstraction, and Programming
Sort
View
EMNLP
2006
15 years 8 months ago
Context-Dependent Term Relations for Information Retrieval
Co-occurrence analysis has been used to determine related words or terms in many NLP-related applications such as query expansion in Information Retrieval (IR). However, related w...
Jing Bai, Jian-Yun Nie, Guihong Cao
NJC
2006
88views more  NJC 2006»
15 years 6 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...
TCAD
2008
114views more  TCAD 2008»
15 years 6 months ago
Word-Level Predicate-Abstraction and Refinement Techniques for Verifying RTL Verilog
el Predicate Abstraction and Refinement Techniques for Verifying RTL Verilog Himanshu Jain, Daniel Kroening, Natasha Sharygina, and Edmund M. Clarke, Fellow, IEEE As a first step, ...
Himanshu Jain, Daniel Kroening, Natasha Sharygina,...
IPL
2010
134views more  IPL 2010»
15 years 3 months ago
Refining abstract interpretations
cally Refining Abstract Interpretations Bhargav S. Gulavani1 , Supratik Chakraborty1 , Aditya V. Nori2 , and Sriram K. Rajamani2 1 IIT Bombay 2 Microsoft Research India Abstract. A...
Bhargav S. Gulavani, Supratik Chakraborty, Aditya ...
CONCUR
2010
Springer
15 years 6 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa