Sciweavers

280 search results - page 9 / 56
» Termination Tools in Ordered Completion
Sort
View
FROCOS
2005
Springer
14 years 1 months ago
Proving Liveness with Fairness Using Rewriting
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
Adam Koprowski, Hans Zantema
ISMIS
2000
Springer
14 years 4 hour ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
CADE
2003
Springer
14 years 8 months ago
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
Renate A. Schmidt, Ullrich Hustadt
AISC
2008
Springer
13 years 10 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
ANCS
2006
ACM
14 years 2 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang