Rewriting semantics of production rule sets

DOI10.1016/j.jlap.2012.06.002zbMath1279.68188OpenAlexW2014213801MaRDI QIDQ1931912

José Meseguer, Sean Keller, Michael Katelman

Publication date: 16 January 2013

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2012.06.002

zbMATH Keywords

formal semanticsformal verificationdeadlock freedomrewriting logic semanticshazard freedomasynchronous digital circuitsquasi-delay-insensitive circuits

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items

Twenty years of rewriting logic ⋮ Programming and symbolic computation in Maude

Uses Software

• Maude
• PMaude
• PVeStA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abstract interpretation of combinational asynchronous circuits
• The rewriting logic semantics project
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Hierarchical verification of asynchronous circuits using temporal logic
• Compiling communicating processes into delay-insensitive VLSI circuits
• Conditional rewriting logic as a unified model of concurrency
• Communicating sequential processes
• Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits
• Verification of asynchronous circuits by BDD-based model checking of Petri nets
• Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement