Partial Order Reduction for Rewriting Semantics of Programming Languages

DOI10.1016/j.entcs.2007.06.008zbMath1279.68207OpenAlexW2056106183MaRDI QIDQ2873775

José Meseguer, Azadeh Farzan

Publication date: 24 January 2014

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

zbMATH Keywords

model checkingprogramming language semanticsrewriting logicMaudepartial order reduction

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)

Related Items (7)

The rewriting logic semantics project: a progress report ⋮ Twenty years of rewriting logic ⋮ From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories ⋮ Memory Representations in Rewriting Logic Semantics Definitions ⋮ A rewriting logic approach to operational semantics ⋮ The Rewriting Logic Semantics Project: A Progress Report ⋮ Partial Order Reduction for Rewriting Semantics of Programming Languages

Uses Software

• veriSoft
• JavaFAN
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional rewriting logic as a unified model of concurrency
• Defining conditional independence using collapses
• A partial approach to model checking
• Maude: specification and programming in rewriting logic
• Equational rules for rewriting logic
• State space reduction using partial order techniques
• Exploiting object escape and locking information in partial-order reductions for concurrent object-oriented programs
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Partial Order Reduction for Rewriting Semantics of Programming Languages
• Dynamic partial-order reduction for model checking software
• Automated Reasoning
• Computer Aided Verification
• Algebraic Methodology and Software Technology
• Partial-order reduction in symbolic state-space exploration

This page was built for publication: Partial Order Reduction for Rewriting Semantics of Programming Languages