1002 search results - page 85 / 201 » Towards Graph Programs for Graph Algorithms |
142
Voted
CAV
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
133
Voted
ASWEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
101
Voted
CASES
2009
ACM
15 years 9 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
168
Voted
COMPSYSTECH
2011
14 years 2 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
140
Voted
TCBB
2011
14 years 9 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...