18 search results - page 2 / 4 » Simplification Orders for Term Graph Rewriting |
CAV
2012
Springer
11 years 8 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
RTA
2007
Springer
13 years 12 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
COSIT
2003
Springer
13 years 11 months ago
2003
Springer
The scope of this paper is a qualitative description of terrain features that can be characterized using the silhouette of a terrain. The silhouette is a profile of a landform seen...
PPDP
2009
Springer
14 years 9 days ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
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 ...