Model checking strategy-controlled rewriting systems
From MaRDI portal
Recommendations
Cites work
- A completeness theorem in modal logic
- Abstraction and model checking of core Erlang programs in Maude
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Alternating-time temporal logic
- Conditional rewriting logic as a unified model of concurrency
- Deduction, strategies, and rewriting
- Handbook of model checking
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- LTL to Büchi automata translation: fast and more deterministic
- Modelling and verifying contract-oriented systems in Maude
- Modular structural operational semantics with strategies
- Reasoning about strategies: on the model-checking problem
- Rewriting strategies and strategic rewrite programs
- Solving Sudoku puzzles with rewriting rules
- Strategies and simulations in a semantic framework
- Term Rewriting and All That
- The lambda calculus, its syntax and semantics
- The Maude LTL model checker
- Using Maude and its strategies for defining a framework for analyzing Eden semantics
Cited in
(7)- Strategies, model checking and branching-time properties in Maude
- Programming and symbolic computation in Maude
- 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
- An Overview of the Maude Strategy Language and its Applications
This page was built for publication: Model checking strategy-controlled rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089038)
