Memory representations in rewriting logic semantics definitions

DOI10.1016/J.ENTCS.2009.05.018MaRDI QIDQ5179135zbMATH OpenOpenAlexFDO

Authors 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) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• The rewriting logic semantics project
• The rewriting logic semantics project: a progress report
• The rewriting logic semantics project: a progress report
• The rewriting logic semantics project
• Rewriting logic semantics of a plan execution language

Cites work

• A rewrite framework for language definitions and for generation of efficient interpreters
• A rewriting semantics for ABEL with applications to hardware/software co-design and analysis
• A run-time environment for concurrent objects with asynchronous method calls
• Algebraic Methodology and Software Technology
• Automated Reasoning
• Computer Aided Verification
• scientific article; zbMATH DE number 1018876 (Why is no real title available?)
• scientific article; zbMATH DE number 2043522 (Why is no real title available?)
• Maude: specification and programming in rewriting logic
• Modular rewriting semantics in practice
• Partial order reduction for rewriting semantics of programming languages
• Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
• The rewriting logic semantics project

Describes a project that uses

Uses Software

• JavaFAN
• Maude
• GC
• K Prover
• KOOL

This page was built for publication: Memory representations in rewriting logic semantics definitions

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