4767 search results - page 63 / 954 » Structures for Abstract Rewriting |
DAGSTUHL
2007
13 years 10 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
The publish-subscribe paradigm is an effective approach for data publishers to asynchronously disseminate relevant data to a large number of data subscribers. A lot of recent res...
RTA
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
FROCOS
2007
Springer
14 years 21 days ago
2007
Springer
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...