5757 search results - page 154 / 1152 » Dynamic Policy Programming |
164
click to vote
ESOP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
241
click to vote
PLDI
2009
ACM
16 years 1 months ago
2009
ACM
We present a novel dynamic analysis technique that finds real deadlocks in multi-threaded programs. Our technique runs in two stages. In the first stage, we use an imprecise dyn...
157
click to vote
IPL
2006
15 years 6 months ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
164
click to vote
SIGSOFT
2002
ACM
16 years 7 months ago
2002
ACM
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...
146
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...