Term rewriting techniques are applicable to various fields of computer science, including
software engineering, programming languages, computer algebra, program verification …

Nominal rewriting is based on the observation that if we add support for α-equivalence to
first-order syntax using the nominal-set approach, then systems with binding, including …

In addition to equations and rules, we introduce equational rules that are oriented while
having an equational interpretation. Correspondence between operational behavior and …

We investigate restricted termination and confluence properties of term rewriting systems, in
particular weak termination, weak innermost termination,(strong) innermost …

We describe a metamodel for access control, designed to take into account the specific
requirements of distributed environments. We see a distributed system consisting of several …

Recently, Arts and Giesl developed the dependency pair approach which allows automated
termination and innermost termination proofs for many term rewriting systems (TRSs) for …

This paper is concerned with the foundations of an extension of pure type systems by
abstract data types, hence the name of Abstract Data Type Systems. ADTS generalize …

Despite the widespread adoption of Role-based Access Control (RBAC) models, new
access control models are required for new applications for which RBAC may not be …

The Attribute-Based Access Control (ABAC) model is one of the most powerful access
control models in use. It subsumes popular models, such as the Role-Based Access Control …

This article extends the termination proof techniques based on reduction orderings to a
higher-order setting, by defining a family of recursive path orderings for terms of a typed …