6719 search results - page 1240 / 1344 » A Generalization of Automatic Sequences |
257
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
255
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
145
click to vote
RECOMB
2003
Springer
16 years 4 months ago
2003
Springer
Recent research has demonstrated quite convincingly that accurate cancer diagnosis can be achieved by constructing classifiers that are designed to compare the gene expression pro...
160
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
212
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...