Sciweavers

3686 search results - page 197 / 738
» Comprehensive comprehensions
Sort
View
CADE
2008
Springer
14 years 9 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
OSDI
2006
ACM
14 years 9 months ago
XFI: Software Guards for System Address Spaces
XFI is a comprehensive protection system that offers both flexible access control and fundamental integrity guarantees, at any privilege level and even for legacy code in commodit...
Úlfar Erlingsson, George C. Necula, Mart&ia...
SIGMOD
2009
ACM
228views Database» more  SIGMOD 2009»
14 years 9 months ago
Interactive anonymization of sensitive data
There has been much recent work on algorithms for limiting disclosure in data publishing. However, these algorithms have not been put to use in any comprehensive, usable toolkit f...
Xiaokui Xiao, Guozhang Wang, Johannes Gehrke
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
14 years 9 months ago
The ADO.NET entity framework: making the conceptual level real
This paper describes the ADO.NET Entity Framework, a platform for programming against data that raises the level of ion from the logical (relational) level to the conceptual (enti...
Anil Nori, José A. Blakeley, S. Muralidhar
SIGMOD
2006
ACM
158views Database» more  SIGMOD 2006»
14 years 9 months ago
A survey on ontology mapping
Ontology is increasingly seen as a key factor for enabling interoperability across heterogeneous systems and semantic web applications. Ontology mapping is required for combining ...
Namyoun Choi, Il-Yeol Song, Hyoil Han