5314 search results - page 113 / 1063 » Hybrid Dynamic Programming |
PLDI
2009
ACM
14 years 4 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...
IPL
2006
13 years 10 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....
SIGSOFT
2002
ACM
14 years 11 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...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
ASP
2005
Springer
14 years 3 months ago
2005
Springer
In previous work, action languages have predominantly been concerned with domains in which values are static unless changed by an action. Real domains, however, often contain value...