1702 search results - page 50 / 341 » Doomed program points |
150
click to vote
PLDI
1999
ACM
15 years 8 months ago
1999
ACM
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
161
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
153
Voted
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
234
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
117
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...