Dependency pairs for proving termination properties of conditional term rewriting systems
From MaRDI portal
(Redirected from Publication:347382)
Recommendations
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- 2D dependency pairs for proving operational termination of CTRSs
- Extending the 2D dependency pair framework for conditional term rewriting systems
- Operational termination of conditional term rewriting systems
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
Cites work
- 2D dependency pairs for proving operational termination of CTRSs
- A dependency pair framework for \(A \vee C\)-termination
- A rationale for conditional equational programming
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Computationally Equivalent Elimination of Conditions
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- Context-sensitive dependency pairs
- Extending the 2D dependency pair framework for conditional term rewriting systems
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 4130339 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 1332639 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998
- Logic for Programming, Artificial Intelligence, and Reasoning
- Logic Programming
- Mechanizing and improving dependency pairs
- MTT: The Maude Termination Tool (System Description)
- Normal forms and normal theories in conditional rewriting
- Operational termination of conditional term rewriting systems
- Proving operational termination of membership equational programs
- Proving termination properties with \textsc{mu-term}
- Rewriting Techniques and Applications
- Signature extensions preserve termination. An alternative proof via dependency pairs
- Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity
- Termination of term rewriting using dependency pairs
- Tyrolean termination tool: techniques and features
- Unravelings and ultra-properties
Cited in
(20)- Operational termination of conditional term rewriting systems
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Automatic synthesis of logical models for order-sorted first-order theories
- Use of logical models for proving infeasibility in term rewriting
- Determinization of conditional term rewriting systems
- Applications and extensions of context-sensitive rewriting
- Term orderings for non-reachability of (conditional) rewriting
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- Using well-founded relations for proving operational termination
- Automatic generation of logical models with AGES
- Relative termination via dependency pairs
- scientific article; zbMATH DE number 1722701 (Why is no real title available?)
- 2D dependency pairs for proving operational termination of CTRSs
- Extending the 2D dependency pair framework for conditional term rewriting systems
- mu-term: Verify Termination Properties Automatically (System Description)
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Verification of Erlang processes by dependency pairs
- DM-check: verifying invariants of concurrent systems by deductive model checking
- Termination of generalized term rewriting systems
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
This page was built for publication: Dependency pairs for proving termination properties of conditional term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347382)
