Model-checking strategy-controlled rewriting systems

Abstract

Strategies are a widespread but ambiguous concept in Computer Science. In the domain of reduction and rewriting systems, strategies are studied as recipes to restrict and control reduction steps and rule applications, which are intimately local, in a derivation-global sense. This idea has been exploited by various tools and rewriting-based specification languages where strategies are an additional specification layer. Systems so described need to be analyzed too. This article discusses model checking of systems controlled by strategies and presents a working strategy-aware model checker built on top of the Maude specification language, based on rewriting logic, and its strategy language. Pendiente de publicación en "International Conference on Formal Structures for Computation and Deduction" (FSCD) 2019. Se envía la versión aceptada. La versión definitiva estará lista a finales de abril.