Model checking strategy-controlled rewriting systems (extended version)
Strategies are widespread 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 an...
| Autores: | , , , |
|---|---|
| Tipo de documento: | relatório científico |
| Data de publicação: | 2019 |
| País: | España |
| Recursos: | Universidad Complutense de Madrid (UCM) |
| Repositório: | Docta Complutense |
| Idioma: | inglês |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/17476 |
| Acesso em linha: | https://hdl.handle.net/20.500.14352/17476 |
| Access Level: | Acceso aberto |
| Palavra-chave: | 004 004.4 004.43 Model checking Strategies Maude Rewriting logic Lenguajes de programación Software 1203.23 Lenguajes de Programación 3304.16 Diseño Lógico |
| Resumo: | Strategies are widespread 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 LTL model checker for the Maude specification language, based on rewriting logic, and its strategy language. This extended version includes the proofs of the propositions in the conference paper, and a complete description of the small-step operational semantics used to define model checking for the Maude strategy language. |
|---|