Sciweavers

154 search results - page 3 / 31
» Dependence Flow Graphs: An Algebraic Approach to Program Dep...
Sort
View
ICS
1997
Tsinghua U.
13 years 10 months ago
Sparse Code Generation for Imperfectly Nested Loops with Dependences
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
Vladimir Kotlyar, Keshav Pingali
LISP
2002
107views more  LISP 2002»
13 years 6 months ago
Dependent Types for Program Termination Verification
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Hongwei Xi
SERP
2008
13 years 8 months ago
Mapping Data-Flow Dependencies onto Distributed Embedded Systems
Model-driven development (MDD) is an emerging paradigm and has become state-of-the-art for embedded systems software design. In the overall design process, several steps have to be...
Stefan Kugele, Wolfgang Haberl
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
11 years 9 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
PLDI
1994
ACM
13 years 10 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali