Sciweavers

899 search results - page 78 / 180
» Cost Analysis of Games, Using Program Logic
Sort
View
NIPS
1996
15 years 1 months ago
Why did TD-Gammon Work?
Although TD-Gammon is one of the major successes in machine learning, it has not led to similar impressive breakthroughs in temporal difference learning for other applications or ...
Jordan B. Pollack, Alan D. Blair
PLDI
2006
ACM
15 years 5 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
SIGMETRICS
1998
ACM
110views Hardware» more  SIGMETRICS 1998»
15 years 4 months ago
LoGPC: Modeling Network Contention in Message-Passing Programs
In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message proces...
Csaba Andras Moritz, Matthew Frank
SIGSOFT
2002
ACM
16 years 18 days ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
POPL
2008
ACM
16 years 5 days ago
Demand-driven alias analysis for C
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
Xin Zheng, Radu Rugina