Sciweavers

4217 search results - page 710 / 844
» Computational indistinguishability logic
Sort
View
100
Voted
CADE
2002
Springer
16 years 1 months ago
The Quest for Efficient Boolean Satisfiability Solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
Lintao Zhang, Sharad Malik
91
Voted
OSDI
2008
ACM
16 years 1 months ago
Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
119
Voted
OSDI
2002
ACM
16 years 1 months ago
FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides ...
Atul Adya, William J. Bolosky, Miguel Castro, Gera...
90
Voted
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 28 days ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
96
Voted
PODS
2008
ACM
110views Database» more  PODS 2008»
16 years 28 days ago
Static analysis of active XML systems
Active XML is a high-level specification language tailored to dataintensive, distributed, dynamic Web services. Active XML is based on XML documents with embedded function calls. ...
Serge Abiteboul, Luc Segoufin, Victor Vianu