1855 search results - page 57 / 371 » Composing model programs for analysis |
121
click to vote
AMC
2005
15 years 2 months ago
2005
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
ENTCS
2007
15 years 2 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
142
click to vote
IT
2008
15 years 2 months ago
2008
provides a powerful abstraction basically allowing to perceiving all compute resources as entities that can be dynamically discovered and composed. These entities are called servic...
128
Voted
SIGSOFT
2008
ACM
16 years 3 months ago
2008
ACM
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
154
click to vote
TRIER
2002
15 years 2 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...