Strategies, model checking and branching-time properties in Maude
From MaRDI portal
Publication:2239275
DOI10.1016/j.jlamp.2021.100700OpenAlexW3178574993WikidataQ123905803 ScholiaQ123905803MaRDI QIDQ2239275
Rubén Rubio, Alberto Verdejo, Narciso Martí-Oliet, Isabel Pita
Publication date: 3 November 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100700
Related Items (7)
Hardware Trojan detection via rewriting logic ⋮ Simulating and model checking membrane systems using strategies in Maude ⋮ Metalevel transformation of strategies ⋮ The Maude strategy language ⋮ QMaude: quantitative specification and verification in rewriting logic ⋮ Safety enforcement via programmable strategies in Maude ⋮ Verification of the ROS NavFn planner using executable specification languages
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rewriting logic and its applications. 10th international workshop, WRLA 2014, held as a satellite event of ETAPS, Grenoble, France, April 5--6, 2014. Revised selected papers
- Results on the propositional \(\mu\)-calculus
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- The lambda calculus, its syntax and semantics
- Algebraic and logic programming. Second international conference, Nancy, France, October 1--3, 1990. Proceedings
- Conditional rewriting logic as a unified model of concurrency
- Propositional dynamic logic of regular programs
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Logical foundations of CafeOBJ
- Twenty years of rewriting logic
- Specification and proof in membership equational logic
- Parameterized strategies specification in Maude
- A logic with revocable and refinable strategies
- Labelled graph strategic rewriting for social networks
- Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics
- Solving Sudoku Puzzles with Rewriting Rules
- Abstraction and Model Checking of Core Erlang Programs in Maude
- Reasoning About Strategies
- Abstract Logical Model Checking of Infinite-State Systems Using Narrowing
- The mu-calculus and Model Checking
- Alternating-time temporal logic
- The Temporal Logic of Rewriting: A Gentle Introduction
- Foundations of the rule-based system ρLog
- “Sometimes” and “not never” revisited
- Algorithm = logic + control
- Handbook of Model Checking
- Strategic port graph rewriting: an interactive modelling framework
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
- Model Checking TLR* Guarantee Formulas on Infinite Systems
- Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application
This page was built for publication: Strategies, model checking and branching-time properties in Maude
