Sciweavers

209 search results - page 35 / 42
» Termination of Priority Rewriting
Sort
View
CADE
2005
Springer
14 years 8 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
BIRTHDAY
2007
Springer
14 years 1 months ago
The Hydra Battle Revisited
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
Nachum Dershowitz, Georg Moser
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography
The parallelization of two applications in symmetric cryptography is considered: block ciphering and a new method based on random sampling for the selection of basic substitution ...
Vincent Danjean, Roland Gillard, Serge Guelton, Je...
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 7 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
ENTCS
2008
106views more  ENTCS 2008»
13 years 7 months ago
Reduction Semantics and Formal Analysis of Orc Programs
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...
Musab AlTurki, José Meseguer