The following pages link to (Q2722043):
Displaying 21 items.
- Verifying a distributed list system: A case history (Q1355754) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- A Maude specification of an object-oriented model for telecommunication networks (Q1608922) (← links)
- Actor theories in rewriting logic (Q1608923) (← links)
- Formal proofs about rewriting using ACL2 (Q1610218) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- A semantic framework for open processes (Q2463561) (← links)
- Modal logic for rewriting theories (Q2703697) (← links)
- Logics and automata for verification: Expressiveness and decidability issues (Q2763541) (← links)
- Certifying term rewriting proofs in ELAN (Q2841249) (← links)
- Proving modal properties of rewrite theories using Maude's metalevel (Q2850670) (← links)
- Characterization Theorems for Revision of Logic Programs (Q2851279) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules (Q2987065) (← links)
- A Verification Logic for Rewriting Logic (Q3025340) (← links)
- Abstract Certification of Global Non-interference in Rewriting Logic (Q3066121) (← links)
- (Q4636023) (← links)
- A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting (Q5166636) (← links)
- Verification for everyone? An overview of dynamic logic (Q6074988) (← links)
- A verified VCGen based on dynamic logic: an exercise in meta-verification with Why3 (Q6156936) (← links)
- QMaude: quantitative specification and verification in rewriting logic (Q6174537) (← links)
