Semantic foundations for generalized rewrite theories

DOI10.1016/j.tcs.2006.04.012zbMath1097.68051OpenAlexW2029227380MaRDI QIDQ2503334

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.04.012

zbMATH Keywords

semantics membership equational logic conditional rewriting logic contextual rewrites

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Equational classes, universal algebra in model theory (03C05)

Related Items (45)

Probabilistic Real-Time Rewrite Theories and Their Expressive Power ⋮ Algebraic simulations ⋮ Declarative Debugging of Rewriting Logic Specifications ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Rewriting modulo SMT and open system analysis ⋮ Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude ⋮ Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis ⋮ Verifying Reachability-Logic Properties on Rewriting-Logic Specifications ⋮ The Formal System of Dijkstra and Scholten ⋮ The rewriting logic semantics project: a progress report ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Declarative debugging of rewriting logic specifications ⋮ Local confluence of conditional and generalized term rewriting systems ⋮ Strategies in conditional narrowing modulo SMT plus axioms ⋮ Verifying hierarchical Ptolemy II discrete-event models using real-time maude ⋮ MTT: The Maude Termination Tool (System Description) ⋮ Exploring conditional rewriting logic computations ⋮ Model Checking TLR* Guarantee Formulas on Infinite Systems ⋮ Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way) ⋮ Mechanical Analysis of Reliable Communication in the Alternating Bit Protocol Using the Maude Invariant Analyzer Tool ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions ⋮ An algebraic semantics for MOF ⋮ Strategy-Based Proof Calculus for Membrane Systems ⋮ Hierarchical Design Rewriting with Maude ⋮ Operational Termination of Membership Equational Programs: the Order-Sorted Way ⋮ Formalization and correctness of the PALS architectural pattern for distributed real-time systems ⋮ Context-sensitive dependency pairs ⋮ Modeling and analyzing mobile ad hoc networks in Real-Time Maude ⋮ Proving semantic properties as first-order satisfiability ⋮ Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Programming and symbolic computation in Maude ⋮ Ground confluence of order-sorted conditional specifications modulo axioms ⋮ Applications and extensions of context-sensitive rewriting ⋮ Debugging Maude programs via runtime assertion checking and trace slicing ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ A rewriting logic approach to operational semantics ⋮ The Rewriting Logic Semantics Project: A Progress Report ⋮ Simulation and Verification of Synchronous Set Relations in Rewriting Logic ⋮ A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ Symbolic computation in Maude: some tapas

Uses Software

Cites Work

This page was built for publication: Semantic foundations for generalized rewrite theories