The following pages link to Twenty years of rewriting logic (Q1931904):
Displaying 50 items.
- Verifiable abstractions for contract-oriented systems (Q347375) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Algebraic simulations (Q844884) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- On the accuracy of formal verification of selective defenses for TDoS attacks (Q1683703) (← links)
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (Q1704601) (← links)
- Rewriting logic bibliography by topic: 1990--2011 (Q1931905) (← 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)
- Capturing constrained constructor patterns in matching logic (Q2096417) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- A constraint-based language for multiparty interactions (Q2229145) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Limited second-order functionality in a first-order setting (Q2303245) (← links)
- Labelled port graph -- a formal structure for models and computations (Q2333309) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Rewriting-based repairing strategies for XML repositories (Q2436514) (← links)
- New foundations for rewriting logic (Q2703691) (← links)
- Modal logic for rewriting theories (Q2703697) (← links)
- SICStus Prolog -- the first 25 years (Q2893089) (← links)
- José Meseguer: Scientist and Friend Extraordinaire (Q2945698) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- Two Decades of Maude (Q2945709) (← links)
- Formal Universes (Q2945710) (← links)
- Generic Proof Scores for Generate & Check Method in CafeOBJ (Q2945712) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- Weak Bisimulation as a Congruence in MSOS (Q2945724) (← links)
- Algebraic Reinforcement Learning (Q2945728) (← links)
- Liveness Properties in CafeOBJ – A Case Study for Meta-Level Specifications (Q2949707) (← links)
- A Verification Logic for Rewriting Logic (Q3025340) (← links)
- From Outermost Reduction Semantics to Abstract Machine (Q3453649) (← links)
- On the Power of Logic Resynthesis (Q4943870) (← links)
- A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell* (Q4988924) (← links)
- (Q5018490) (← links)
- (Q5020553) (← links)
- (Q5020960) (← links)
- More problems in rewriting (Q5055812) (← links)
- Symbolic Analysis of Maude Theories with Narval (Q5108507) (← links)
- Compositional Specification in Rewriting Logic (Q5108529) (← links)
- Twenty-Five Years of Preferred Subtheories (Q5172613) (← links)
- Generate & Check Method for Verifying Transition Systems in CafeOBJ (Q5256348) (← links)
- Mechanical Analysis of Reliable Communication in the Alternating Bit Protocol Using the Maude Invariant Analyzer Tool (Q5403085) (← links)
- Detection and diagnosis of deviations in distributed systems of autonomous agents (Q5889310) (← links)
- Rewriting logic as a semantic framework for concurrency: a progress report (Q6104381) (← links)
- The Maude strategy language (Q6113021) (← links)
- QMaude: quantitative specification and verification in rewriting logic (Q6174537) (← links)
- An Overview of the Maude Strategy Language and its Applications (Q6487295) (← links)
