Strategies, model checking and branching-time properties in Maude
Authors:
- Rubén RubioRRRubén Rubio
- Narciso Martí-OlietNMNarciso Martí-Oliet
- Isabel PitaIPIsabel Pita
- Alberto VerdejoAVAlberto Verdejo
- 1 November 2021
- journal article
- research article
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 123
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Gobierno de España Ministerio de Ciencia e Innovación (TIN2015-67522-C3-3-R, PID2019-108528RB-C22)
- Gobierno de Espana Ministerio de Ciencia Innovacion y Universidades (FPU17/02319)
This publication has 20 references indexed in Scilit:
- Stratego/XT 0.17. A language and toolset for program transformationScience of Computer Programming, 2008
- Efficient guided symbolic reachability using reachability expressionsInternational Journal on Software Tools for Technology Transfer, 2008
- Foundations of the rule-based system ρLogJournal of Applied Non-Classical Logics, 2006
- Alternating-time temporal logicJournal of the ACM, 2002
- Logical foundations of CafeOBJTheoretical Computer Science, 2002
- Infinite games on finitely coloured graphs with applications to automata on infinite treesTheoretical Computer Science, 1998
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Algorithm = logic + controlCommunications of the ACM, 1979