Results 1  10
of
473
Efficient implementation of a BDD package
 In Proceedings of the 27th ACM/IEEE conference on Design autamation
, 1991
"... Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract

Cited by 504 (9 self)
 Add to MetaCart
to decrease memory use. Memory function efficiency is improved by using rules that detect. when equivalent functions are computed. The usefulness of the package is enhanced by an automatic and lowcost scheme for rec:ycling memory. Experimental results are given to demonstrate why various implementation trade
Termination of Term Rewriting Using Dependency Pairs
 Comput. Sci
, 2000
"... We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left and righthand sides of rewrite rules, but introduce the notion of dependency pairs to compare lefthand sides with special subter ..."
Abstract

Cited by 267 (50 self)
 Add to MetaCart
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left and righthand sides of rewrite rules, but introduce the notion of dependency pairs to compare lefthand sides with special
Lambda Lifting: Transforming Programs to Recursive Equations
, 1985
"... Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combinator) definitions which will be used as rewrite rules. Different ways of doing lambd ..."
Abstract

Cited by 218 (4 self)
 Add to MetaCart
Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combinator) definitions which will be used as rewrite rules. Different ways of doing
Automatic Transformations by Rewriting Techniques
, 1994
"... . The paper shows how term rewriting techniques can be used to automatically transform firstorder functional programs by both deforestation (eliminating useless intermediate data structures) and tupling (eliminating parallel traversals of identical data structures). Its novelty is that it include ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. The paper shows how term rewriting techniques can be used to automatically transform firstorder functional programs by both deforestation (eliminating useless intermediate data structures) and tupling (eliminating parallel traversals of identical data structures). Its novelty
Graph Rewrite Rules with Structural Recursion
"... Abstract. Graph rewrite rules, programmed by sequencing and iteration, suffice to define the computable functions on graphs—in theory. In practice however, the control program may become hard to formulate, hard to understand, and even harder to verify. Therefore, we have extended graph rewrite rules ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Abstract. Graph rewrite rules, programmed by sequencing and iteration, suffice to define the computable functions on graphs—in theory. In practice however, the control program may become hard to formulate, hard to understand, and even harder to verify. Therefore, we have extended graph rewrite
Scoped Dynamic Rewrite Rules
 Rule Based Programming (RULE’01), volume 59/4 of Electronic Notes in Theoretical Computer Science
, 2001
"... The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the contextfree nature of rewrite rules. The first problem is addressed by languages supporting userdefinable rewriting strategies. This paper addresses the second problem b ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
by extending rewriting strategies with scoped dynamic rewrite rules. Dynamic rules are generated at runtime and can access variables available from their definition context. Rules generated within a rule scope are automatically retracted at the end of that scope. The technique is illustrated by means
Parallelizing Functional Programs by Term Rewriting
, 1997
"... List homomorphisms are functions that can be computed in parallel using the divideandconquer paradigm. We study the problem of finding a homomorphic representation of a given function, based on the BirdMeertens theory of lists. A previous work proved that to each pair of leftward and rightward se ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
problem and an inductive claim, both solvable by term rewriting techniques. To solve the former we present a sound generalization procedure which yields the required representation, and terminates under reasonable assumptions. We illustrate the method and the procedure by the parallelization of the scanfunction
Automatic Parallelization and Optimization of Programs by Proof Rewriting
"... Abstract. We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized and optimized program. To achieve this goal, we present new proof rules for generating proof trees and a rewrite ..."
Abstract
 Add to MetaCart
Abstract. We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized and optimized program. To achieve this goal, we present new proof rules for generating proof trees and a
Verification of recursive parallel systems ∗.
, 2003
"... In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs, allowi ..."
Abstract
 Add to MetaCart
In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs
Integrating association rule mining with relational database systems: Alternatives and implications
 Data Mining and Knowledge Discovery
"... Abstract. Data mining on large data warehouses is becoming increasingly important. In support of this trend, we consider a spectrum of architectural alternatives for coupling mining with database systems. These alternatives include: loosecoupling through a SQL cursor interface; encapsulation of a m ..."
Abstract

Cited by 146 (5 self)
 Add to MetaCart
also compare these alternatives on the basis of qualitative factors like automatic parallelization, development ease, portability and interoperability. As a byproduct of this study, we identify some primitives for native support in database systems for decisionsupport applications. Keywords: mining
Results 1  10
of
473