Sciweavers

304 search results - page 23 / 61
» A dynamic programming approach to categorial deduction
Sort
View
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
13 years 11 months ago
Dynamic symbolic database application testing
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
Chengkai Li, Christoph Csallner
OOPSLA
2007
Springer
14 years 1 months ago
Compile-time execution structure of object-oriented programs with practical ownership domain annotations
Ownership domain annotations express and enforce design intent related to object encapsulation and communication directly in real object-oriented code. First, this work will make ...
Marwan Abi-Antoun
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
13 years 12 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
POPL
2012
ACM
12 years 3 months ago
Multiple facets for dynamic information flow
JavaScript has become a central technology of the web, but it is also the source of many security problems, including cross-site scripting attacks and malicious advertising code. ...
Thomas H. Austin, Cormac Flanagan
SENSYS
2006
ACM
14 years 1 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha