Sciweavers

102 search results - page 20 / 21
» Semantically Restricted Argument Dependencies
Sort
View
PPOPP
2009
ACM
14 years 5 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
PODS
2009
ACM
86views Database» more  PODS 2009»
14 years 5 months ago
Reverse data exchange: coping with nulls
An inverse of a schema mapping M is intended to "undo" what M does, thus providing a way to perform "reverse" data exchange. In recent years, three different f...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
AAAI
2008
13 years 7 months ago
Artificial Intelligence Needs Open-Access Knowledgebase Contents
ar for abstract concepts, and a number of formally expressed, structural restrictions. Copyright c 2008, Association for the Advancement of Artificial Intelligence (www.aaai.org). ...
Erik Sandewall
VMCAI
2007
Springer
13 years 11 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
ACTAC
1998
71views more  ACTAC 1998»
13 years 4 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene