Pages that link to "Item:Q3090877"
From MaRDI portal
The following pages link to Proving Safety Properties of Rewrite Theories (Q3090877):
Displaying 15 items.
- Proving nondeterministically specified safety properties using progress measures (Q1317438) (← links)
- Formal proofs about rewriting using ACL2 (Q1610218) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Proving modal properties of rewrite theories using Maude's metalevel (Q2850670) (← links)
- Generic Proof Scores for Generate & Check Method in CafeOBJ (Q2945712) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- Simulation and Verification of Synchronous Set Relations in Rewriting Logic (Q3098052) (← links)
- A Revised Concept of Safety for General Answer Set Programs (Q3643106) (← links)
- All-Path Reachability Logic (Q5170834) (← 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)
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs (Q5403086) (← links)
- Building correct-by-construction systems with formal patterns (Q6562511) (← links)