Sciweavers

882 search results - page 11 / 177
» A Taste of Rewrite Systems
Sort
View
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
CADE
2012
Springer
11 years 10 months ago
Proving Non-looping Non-termination Automatically
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
Fabian Emmes, Tim Enger, Jürgen Giesl
CONCURRENCY
2008
99views more  CONCURRENCY 2008»
13 years 7 months ago
TRIBLER: a social-based peer-to-peer system
Most current P2P file sharing systems treat their users as anonymous, unrelated entities, and completely disregard any social relationships between them. However, social phenomena...
Johan A. Pouwelse, Pawel Garbacki, Jun Wang, Arno ...
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
A comparison between two logical formalisms for rewriting
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino
ENTCS
2002
111views more  ENTCS 2002»
13 years 7 months ago
Comparing Meseguer's Rewriting Logic with the Logic CRWL
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino Tarjuelo