Theoretical Computer Science
Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Journal of Symbolic Computation
Notes on the elimination of conditions
1st international workshop on Conditional Term Rewriting Systems
Machine intelligence 11
A rationale for conditional equational programming
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Handbook of theoretical computer science (vol. B)
Modular properties of conditional term rewriting systems
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A constructor-based approach to positive/negative-conditional equational specifications
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Term rewriting and all that
Automatically Proving Termination Where Simplification Orderings Fail
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Modularity of Termination Using Dependency pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Completion-Time Optimization of Rewrite-Time Goal Solving
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Proving Innermost Normalisation Automatically
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Verifying a Distributed Database Lookup Manager Written in Erlang
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Unravelings and Ultra-properties
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Canonical Conditional Rewrite Systems
Proceedings of the 9th International Conference on Automated Deduction
On Termination and Confluence of Conditional Rewrite Systems
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Simplification Orderings: History Of Results
Fundamenta Informaticae
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
| Hi-index | 0.00 |
Erlang is a functional programming language developed by Ericsson Telecom which is particularly well suited for implementing concurrent processes. In this paper we show how methods from the area of term rewriting are presently used at Ericsson. To verify properties of processes, such a property is transformed into a termination problem of a conditional term rewriting system (CTRS). Subsequently, this termination proof can be performed automatically using dependency pairs. The paper illustrates how the dependency pair technique can be applied for termination proofs of conditional TRSs. Secondly, we present two refinements of this technique, viz. narrowing and rewriting dependency pairs. These refinements are not only of use in the industrial application sketched in this paper, but they are generally applicable to arbitrary (C)TRSs. Thus, in this way dependency pairs can be used to prove termination of even more (C)TRSs automatically.