94 search results - page 5 / 19 » Testing Whether a Set of Code Words Satisfies a Given Set of... |
IANDC
2007
13 years 8 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
PVLDB
2010
13 years 6 months ago
2010
We present Data Auditor, a tool for exploring data quality and data semantics. Given a rule or an integrity constraint and a target relation, Data Auditor computes pattern tableau...
CODES
2001
IEEE
13 years 11 months ago
2001
IEEE
Due to rapidly increasing system complexity, shortening time-tomarket, and growing demand for hard real-time systems, formal methods are becoming indispensable in the synthesis of...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...