Invariant-driven specifications in Maude

DOI10.1016/j.scico.2009.03.003zbMath1192.68400OpenAlexW2017207897MaRDI QIDQ838161

Antonio Vallecillo, Francisco Durán, Manuel Roldán

Publication date: 21 August 2009

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2009.03.003

zbMATH Keywords

invariantsreflectionrewriting logicexecution strategiesmaude

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis ⋮ Safety enforcement via programmable strategies in Maude ⋮ Debugging Maude programs via runtime assertion checking and trace slicing

Uses Software

• Stratego
• SPIN
• OBJ3
• Maude
• Z2sal
• KeY
• Jaza

Cites Work

• Real-time logics: Complexity and expressiveness
• Maude's module algebra
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Conditional rewriting logic as a unified model of concurrency
• ELAN from a rewriting logic point of view
• Maude: specification and programming in rewriting logic
• Structured theories and institutions
• The B-Book
• Algebraic Methodology and Software Technology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Invariant-driven specifications in Maude