Sciweavers

102 search results - page 20 / 21
» Semantically Restricted Argument Dependencies
Sort
View
PPOPP
2009
ACM
16 years 6 days 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
175
Voted
PODS
2009
ACM
86views Database» more  PODS 2009»
16 years 6 days 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...
81
Voted
AAAI
2008
15 years 2 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
82
Voted
VMCAI
2007
Springer
15 years 5 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
101
Voted
ACTAC
1998
71views more  ACTAC 1998»
14 years 11 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