Sciweavers

227 search results - page 2 / 46
» Graph Rewriting for Hardware Dependent Program Optimizations
Sort
View
PDP
2003
IEEE
13 years 11 months ago
A Flexible Library for Dependable Master-Worker Parallel Programs
We describe a robust library for parallel and dependable master-worker programs (raftnet). From a software client’s viewpoint, flexibility, hardware independence and ease of us...
Mieke Leeman, Marc Leeman, Vincenzo De Florio, Gee...
PLDI
1995
ACM
13 years 9 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
MODELS
2010
Springer
13 years 4 months ago
Transforming Process Models: Executable Rewrite Rules versus a Formalized Java Program
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
Pieter Van Gorp, Rik Eshuis
POS
1994
Springer
13 years 10 months ago
Hardware Support for Stability in a Persistent Architecture
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
Frans A. Henskens, D. M. Koch, Rasool Jalili, John...
NJC
2006
88views more  NJC 2006»
13 years 6 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...