Memory Policy Analysis for Semantics Specifications in Maude

DOI10.1007/978-3-319-27436-2_18zbMath1473.68056OpenAlexW2294570182MaRDI QIDQ5743600

Mihail Asăvoae, Adrián Riesco, Irina Măriuca Asăvoae

Publication date: 5 February 2016

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27436-2_18

zbMATH Keywords

formal semanticsslicingMaudememory policies

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• JavaFAN
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• The rewriting logic semantics project
• Formal verification of a C-like memory model and its uses for verifying program transformations
• 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
• Rewriting logic: Roadmap and bibliography
• Descendants and origins in term rewriting.
• Specification and proof in membership equational logic
• A Generic Program Slicing Technique Based on Language Definitions
• Computer Aided Verification
• Algebraic Methodology and Software Technology
• A Rewriting Logic Semantics Approach to Modular Program Analysis
• Evaluating the effectiveness of pointer alias analyses

This page was built for publication: Memory Policy Analysis for Semantics Specifications in Maude