scispace - formally typeset
Search or ask a question
Author

Enno Ohlebusch

Bio: Enno Ohlebusch is an academic researcher. The author has contributed to research in topics: Rewriting & Term (time). The author has an hindex of 1, co-authored 1 publications receiving 472 citations.

Papers
More filters
Book ChapterDOI
01 Jan 2002
TL;DR: This chapter presents the basic concepts of term rewriting that are needed in this book and suggests several survey articles that can be consulted.
Abstract: In this chapter we will present the basic concepts of term rewriting that are needed in this book. More details on term rewriting, its applications, and related subjects can be found in the textbook of Baader and Nipkow [BN98]. Readers versed in German are also referred to the textbooks of Avenhaus [Ave95], Bundgen [Bun98], and Drosten [Dro89]. Moreover, there are several survey articles [HO80, DJ90, Klo92, Pla93] that can also be consulted.

501 citations


Cited by
More filters
01 Jan 1990
TL;DR: In this paper, the authors give a readable but rigorous introduction to the theory of term rewriting systems, a technique used in computer science, especially functional programming, for abstract data type specification and automatic theorem-proving.
Abstract: From the Publisher: This book, the first on the subject in English, gives a readable but rigorous introduction to the theory of term rewriting systems. These are a technique used in computer science, especially functional programming, for abstract data type specification and automatic theorem-proving. The book is self-contained, and begins with a discussion of elementary systems and progresses to the most general cases that involve concepts such as second-order lambda calculus. Exercises are included throughout, and solutions to a selection of them are provided. Complete proofs of results that are often buried in the literature are also given, so researchers in functional programming, theoretical computer science, and logic will find this book useful.

645 citations

Journal ArticleDOI
TL;DR: This work presents techniques to prove termination and innermost termination of term rewriting systems automatically, and introduces the notion of dependency pairs to compare left- and right-hand sides of rewrite rules, which results in a technique which allows to apply existing methods for automated termination proofs toterm rewriting systems where they failed up to now.

603 citations

Journal Article
TL;DR: This chapter gives an overview of the main ingredients involved in the composition of transformation systems with Stratego/XT, where the abstraction levels of rules, strategies, tools, and systems are distinguished.
Abstract: Stratego/XT is a framework for the development of transformation systems aiming to support a wide range of program transformations. The framework consists of the transformation language Stratego and the XT collection of transformation tools. Stratego is based on the paradigm of rewriting under the control of programmable rewriting strategies. The XT tools provide facilities for the infrastructure of transformation systems including parsing and pretty-printing. The framework addresses the entire range of the development process; from the specification of transformations to their composition into transformation systems. This chapter gives an overview of the main ingredients involved in the composition of transformation systems with Stratego/XT, where we distinguish the abstraction levels of rules, strategies, tools, and systems.

310 citations

Posted Content
TL;DR: In this paper, the authors propose an abstract approach to coalition formation that focuses on simple merge and split rules transforming partitions of a group of players, and identify conditions under which every iteration of these rules yields a unique partition.
Abstract: We propose an abstract approach to coalition formation that focuses on simple merge and split rules transforming partitions of a group of players. We identify conditions under which every iteration of these rules yields a unique partition. The main conceptual tool is a specific notion of a stable partition. The results are parametrized by a preference relation between partitions of a group of players and naturally apply to coalitional TU-games, hedonic games and exchange economy games.

289 citations

Book ChapterDOI
10 Aug 2009
TL;DR: This tutorial shows the reader how to use Maude-NPA, and how it works, and also gives some of the theoretical background behind the tool.
Abstract: In this tutorial, we give an overview of the Maude-NRL Protocol Analyzer (Maude-NPA), a tool for the analysis of cryptographic protocols using functions that obey different equational theories. We show the reader how to use Maude-NPA, and how it works, and also give some of the theoretical background behind the tool.

224 citations