Pages that link to "Item:Q2503334"
From MaRDI portal
The following pages link to Semantic foundations for generalized rewrite theories (Q2503334):
Displaying 44 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude (Q730472) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- Algebraic simulations (Q844884) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude (Q1004068) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Declarative debugging of rewriting logic specifications (Q1931907) (← links)
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude (Q1951606) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems (Q2095424) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (Q2808239) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis (Q2945700) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- The Formal System of Dijkstra and Scholten (Q2945729) (← links)
- The Rewriting Logic Semantics Project: A Progress Report (Q3088267) (← links)
- Simulation and Verification of Synchronous Set Relations in Rewriting Logic (Q3098052) (← links)
- Probabilistic Real-Time Rewrite Theories and Their Expressive Power (Q3172843) (← links)
- Declarative Debugging of Rewriting Logic Specifications (Q3184739) (← links)
- MTT: The Maude Termination Tool (System Description) (Q3541712) (← links)
- A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting (Q5166636) (← links)
- Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions (Q5170164) (← links)
- Strategy-Based Proof Calculus for Membrane Systems (Q5179128) (← links)
- Hierarchical Design Rewriting with Maude (Q5179129) (← links)
- Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140) (← links)
- Model Checking TLR* Guarantee Formulas on Infinite Systems (Q5403070) (← links)
- Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way) (Q5403072) (← links)
- Mechanical Analysis of Reliable Communication in the Alternating Bit Protocol Using the Maude Invariant Analyzer Tool (Q5403085) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)
