Combining Techniques to Reduce State Space and Prove Strong Properties

DOI10.1016/J.ENTCS.2009.05.024zbMATH Open1347.68200OpenAlexW2020419678MaRDI QIDQ5179142

Dilia E. Rodríguez

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.024

zbMATH Keywords

verificationlexicographic ordersymmetry reductionformal object-oriented specifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Cites Work

• 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
• Maude: specification and programming in rewriting logic

Related Items (2)

Merge-and-Shrink Abstraction ⋮ Title not available (Why is that?)

Uses Software

• Maude

This page was built for publication: Combining Techniques to Reduce State Space and Prove Strong Properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179142)