The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Program Generation, Termination, and Binding-Time Analysis
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Termination of Rewriting With Strategy Annotations
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On Automating Inductive and Non-inductive Termination Methods
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Transforming Context-Sensitive Rewrite Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Applying Rewriting Techniques to the Verification of Erlang Processes
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Program Termination Analysis by Size-Change Graphs (Abstract)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Termination analysis and specialization-point insertion in offline partial evaluation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Usable Rules for Context-Sensitive Rewrite Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of Priority Rewriting
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A proof of weak termination providing the right way to terminate
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |