Abstract Binary rewriting consists in disassembling a program to modify its instructions. However, existing solutions suffer from shortcomings terms of soundness and performance. We present SaBRe , load-time system for selective binary rewriting. rewrites specific constructs—particularly calls functions—when the is loaded into memory, intercepts them using plugins through simple API. also discu...

Rewriting with non-symmetric relations can be considered as a computational model of many specification languages based on nonsymmetric relations. For instance, Logics of Inequalities, Ordered Algebras, Rewriting Logic, Order-Sorted Algebras, Subset Logic, Unified Algebras, taxonomies, subtypes, Refinement Calculus, all them use some kind of non-symmetric relation on expressions. We have develo...

In this paper we outline the use of term rewriting techniques for modeling the dynamic behavior of Web sites. We associate rewrite rules to each Web page expressing the Web pages which are immediately reachable from this page. The obtained system permits the application of well-known results from the rewriting theory to analyse interesting properties of the Web site. In particular, we briefly d...

This paper studies rr-, lr-, rl-, and ll-automatic structures for finitely generated submonoids of monoids presented by confluent rewriting system that are either finite and special or regular andmonadic. A new technique is developed that uses an automaton to ‘translate’ betweenwords in the original rewriting system andwords over the generators for the submonoid. This is applied to show that th...

We address the problem of efficient rewriting and narrowing strategies for general term rewriting systems. Several strategies have been proposed over the last two decades, the most efficient of all being the natural rewriting and narrowing strategies of Escobar. All the strategies so far, including natural rewriting and narrowing, assume that the given term rewriting system is left-linear and c...

Shostak's congruence closure algorithm is demystiied, using the framework of ground completion on (possibly nonterminating, non-reduced) rewrite rules. In particular, the canonical rewriting relation induced by the algorithm on ground terms by a given set of ground equations is precisely constructed. The main idea is to extend the signature of the original input to include new constant symbols ...

This work investigates the suitability of rewriting logic as a semantic framework for modeling real time and hybrid systems We present a general method to specify and symbolically simulate such systems in rewriting logic and illustrate it with a well known benchmark We also show how a wide range of real time and hybrid system models can be naturally expressed and are uni ed within our approach ...

This work presents a method that combines two techniques: L-systems and Genetic Algorithms (GA) to search for a rewriting expression describing leaf shapes. An L-system is used to construct the shape of a given rewriting expression and GA is used to search for the rewriting expression's fitting parameters. The replacement of real value parameters with tag-functions is introduced. The result sho...

ROC! is a deterministic rewrite strategy language which includes the rewrite rulesas basic operators, and the deterministic choice and the repetition as high-level strategyoperators. In this paper we present a method which, for a given term rewriting system(TRS) R, constructs a new TRS R such that R-rewriting is equivalent (sound and com-plete) with R-rewriting constrained by RO...