With IRB approval, we obtained de-identified laboratory test data from 3 large institutions (ARUP, Intermountain, and Regenstrief). In this study we evaluated correctness of mapping local laboratory result codes to Logical Observation Identifier Names and Codes (LOINC®). We received 9,027 laboratory tests mapped to 3,669 unique LOINC codes. A one tenth sample (884 tests) was manually reviewed f...

We present an approach to detect network configuration errors, which combines the benefits of two prior approaches. Like prior techniques that analyze configuration files, our approach can find errors proactively, before the configuration is applied, and answer “what if” questions. Like prior techniques that analyze data-plane snapshots, our approach can check a broad range of forwarding proper...

This paper reports on the use of tools that statically analyze rule-bases in order to detect logical errors, such as redundancy, inconsistency, and incompleteness. The analysis uses a variant of the KB-Reducer algorithm (Ginsberg 1991). In contrast to accounts of similar tools, which seldom describe tools as used in the field, the experience described in this paper is derived from using tools t...

Experimental studies have pointed out that operational spreadsheets contain a lot of errors. In this paper, we propose to use a multidimensional rule-based data manipulation language to specify spreadsheets. This language allows formal declarative deenition of spreadsheet tabular data treatments. The main contribution of this paper is to show that from textual rule-based speciications, we can g...

The problem of detecting and eliminating duplicated data is one of the major problems in the broad area of data cleaning and data quality in data warehouse. Many times, the same logical real world entity may have multiple representations in the data warehouse. Duplicate elimination is hard because it is caused by several types of errors like typographical errors, and different representations o...

A technique for finding errors in computer programs is to translate a given program and its correctness criteria into a logical formula in mathematics and then let an automatic theorem prover check the validity of the formula. This approach gives the tool designer much flexibility in which conditions are to be checked, and the technique can reason about as many aspects of the given program as t...