Sciweavers

4767 search results - page 135 / 954
» Structures for Abstract Rewriting
Sort
View
DAC
2007
ACM
16 years 3 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
CADE
2008
Springer
16 years 2 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
196
Voted
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 2 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
CC
2010
Springer
172views System Software» more  CC 2010»
15 years 9 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
114
Voted
ACSC
2006
IEEE
15 years 8 months ago
A semantic approach to boost passage retrieval effectiveness for question answering
In the current state of the rapid growth of information resources and the huge number of requests submitted by users to existing information retrieval systems; recently, Question ...
Bahadorreza Ofoghi, John Yearwood, Ranadhir Ghosh