The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
—We propose an access control model that extends RBAC (Role-Based Access Control) to take time and location into account, and use term rewriting systems to specify access control...