Sciweavers

6167 search results - page 876 / 1234
» Can Refinement be Automated
Sort
View
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 5 months ago
Morphological annotation of Korean with Directly Maintainable Resources
This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to p...
Ivan Berlocher, Hyun-Gue Huh, Eric Laporte, Jee-Su...
JODS
2006
135views Data Mining» more  JODS 2006»
15 years 5 months ago
Managing Uncertainty in Schema Matching with Top-K Schema Mappings
In this paper, we propose to extend current practice in schema matching with the simultaneous use of top-K schema mappings rather than a single best mapping. This is a natural ext...
Avigdor Gal
ENTCS
2007
113views more  ENTCS 2007»
15 years 5 months ago
On the Decidability of the Safety Problem for Access Control Policies
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...
E. Kleiner, T. Newcomb
SAC
2006
ACM
15 years 5 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
ASE
2005
103views more  ASE 2005»
15 years 5 months ago
Component Verification with Automatically Generated Assumptions
Abstract. Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. The typical approach to verifying propertie...
Dimitra Giannakopoulou, Corina S. Pasareanu, Howar...