Pages that link to "Item:Q5941753"
From MaRDI portal
The following pages link to Verification of Erlang processes by dependency pairs (Q5941753):
Displaying 16 items.
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Determinization of conditional term rewriting systems (Q1929232) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- Towards Erlang Verification by Term Rewriting (Q3453650) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Towards Modelling Actor-Based Concurrency in Term Rewriting (Q5240184) (← links)
