Sciweavers

2043 search results - page 369 / 409
» Reasoning About Security Models
Sort
View
KDD
2012
ACM
243views Data Mining» more  KDD 2012»
12 years 10 days ago
Storytelling in entity networks to support intelligence analysts
Intelligence analysts grapple with many challenges, chief among them is the need for software support in storytelling, i.e., automatically ‘connecting the dots’ between dispar...
M. Shahriar Hossain, Patrick Butler, Arnold P. Boe...
POPL
2008
ACM
14 years 10 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
POPL
2004
ACM
14 years 10 months ago
Abstractions from proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
LATA
2009
Springer
14 years 4 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
SIGCOMM
2009
ACM
14 years 4 months ago
Understanding TCP incast throughput collapse in datacenter networks
TCP Throughput Collapse, also known as Incast, is a pathological behavior of TCP that results in gross under-utilization of link capacity in certain many-to-one communication patt...
Yanpei Chen, Rean Griffith, Junda Liu, Randy H. Ka...