4722 search results - page 811 / 945 » Representation-independent program analysis |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
SC
2004
ACM
14 years 1 months ago
2004
ACM
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...
SIGDOC
2004
ACM
14 years 1 months ago
2004
ACM
Software publishers and information service providers publish information about their own products and about other products and people. Additional content might be incidental, suc...
WOSP
2004
ACM
14 years 1 months ago
2004
ACM
When software products are assembled from pre-defined components, performance prediction should be based on the components also. This supports rapid model-building, using previous...