Equational Abstractions in Rewriting Logic and Maude

DOI10.1007/978-3-319-15075-8_2zbMath1335.68143OpenAlexW108697182WikidataQ123905818 ScholiaQ123905818MaRDI QIDQ2797862

Alberto Verdejo, Francisco Durán, Narciso Martí-Oliet

Publication date: 1 April 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-15075-8_2

zbMATH Keywords

model checkingabstractionrewriting logicMaudeformal environment

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Cites Work

• Algebraic simulations
• Equational abstractions
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Proving Termination of Programs Automatically with AProVE

This page was built for publication: Equational Abstractions in Rewriting Logic and Maude