Sciweavers

11740 search results - page 5 / 2348
» More Problems in Rewriting
Sort
View
ICTAC
2004
Springer
15 years 3 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 9 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa
GG
2004
Springer
15 years 3 months ago
Extending Graph Rewriting for Refactoring
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
Niels Van Eetvelde, Dirk Janssens
BIRTHDAY
2004
Springer
15 years 3 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
ENTCS
2007
137views more  ENTCS 2007»
14 years 9 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...