Sciweavers

1805 search results - page 75 / 361
» Functional programming with structured graphs
Sort
View
GLVLSI
2007
IEEE
167views VLSI» more  GLVLSI 2007»
14 years 5 months ago
A new approach to logic synthesis of multi-output boolean functions on pal-based CPLDS
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
Dariusz Kania
PPOPP
2010
ACM
14 years 8 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...
LCPC
1991
Springer
14 years 2 months ago
An Executable Representation of Distance and Direction
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
Richard Johnson, Wei Li, Keshav Pingali
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 10 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 11 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert