On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe. On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. In Herbert Kuchen, editor, Functional and Constraint Logic Programming - 20th International Workshop, WFLP 2011, Odense, Denmark, July 19th, Proceedings. Volume 6816 of Lecture Notes in Computer Science, pages 138-155, Springer, 2011. [doi]

This author has not been identified. Look up 'Tsubasa Sakata' in GoogleThis author has not been identified. Look up 'Naoki Nishida' in GoogleThis author has not been identified. Look up 'Toshiki Sakabe' in Google

runs on WebDSL