Memory Representations in Rewriting Logic Semantics Definitions

DOI10.1016/j.entcs.2009.05.018zbMath1347.68196OpenAlexW2122086013MaRDI QIDQ5179135

Mark Hills

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.018

zbMATH Keywords

performanceprogramming language semanticsrewriting logic

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Uses Software

• JavaFAN
• Maude
• GC
• K Prover
• KOOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
• Maude: specification and programming in rewriting logic
• A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis
• Partial Order Reduction for Rewriting Semantics of Programming Languages
• A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters
• Automated Reasoning
• Computer Aided Verification
• Algebraic Methodology and Software Technology

This page was built for publication: Memory Representations in Rewriting Logic Semantics Definitions