Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

158

Voted

WFLP
2009
Springer

237views Algorithms» more WFLP 2009»

Semantic Labelling for Proving Termination of Combinatory Reduction Systems

15 years 10 months ago

Semantic Labelling for Proving Termination of Combinatory Reduction Systems

Download www.cs.gunma-u.ac.jp

Makoto Hamana

Real-time Traffic

Algorithms | WFLP 2009 |

claim paper

Related Content

» POP and Semantic Labeling Using SAT

» Innermost Termination of Rewrite Systems by Labeling

» Towards a Systematic Method for Proving Termination of Graph Transformation Systems

» TORPA Termination of Rewriting Proved Automatically

» Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems

» Higherorder semantic labelling for inductive datatype systems

» A Calculus for the Analysis of Wireless Network Security Protocols

» Predictive Labeling with Dependency Pairs Using SAT

» Stochastic Bigraphs

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	WFLP
Authors	Makoto Hamana

Comments (0)