Proving Termination by Dependency Pairs and Inductive Theorem Proving

By Fuhs Carsten  

Journal of Automated Reasoning, Vol. 47, Iss. 2, 2011-08 ,pp. : 133-160

Springer Publishing Company

Access to resources Recommend Favorite

Termination, deadlock and divergence in the -calculus with multiplicities

By Boudol G.   Laneve C.  

Electronic Notes in Theoretical Computer Science, Vol. 1, Iss. 1, 2004-01 ,pp. : 1-14

Elsevier

Access to resources Recommend Favorite

A typed -calculus for proving-by-example and bottom-up generalization procedure

By Hagiya M.  

Theoretical Computer Science, Vol. 137, Iss. 1, 1995-01 ,pp. : 3-23

Elsevier

Access to resources Recommend Favorite

Some congruence properties for -calculus bisimilarities

By Boreale M.   Sangiorgi D.  

Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,pp. : 159-176

Elsevier

Access to resources Recommend Favorite

Third Special Issue on Techniques for Automated Termination Proofs

By Giesl Jürgen   Kapur Deepak  

Journal of Automated Reasoning, Vol. 37, Iss. 3, 2006-10 ,pp. : 153-154

Springer Publishing Company

Access to resources Recommend Favorite