Sciweavers

498 search results - page 47 / 100
» Term Rewriting
Sort
View
ENTCS
2007
105views more  ENTCS 2007»
14 years 9 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 17 days ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
DAC
2006
ACM
15 years 10 months ago
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
ICNP
1998
IEEE
15 years 2 months ago
Distributed Packet Rewriting and its Application to Scalable Server Architectures
To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in such designs is the need to direc...
Azer Bestavros, Mark Crovella, Jun Liu, David Mart...
ENTCS
2007
103views more  ENTCS 2007»
14 years 9 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal