Author： Wang J. Topor R. Maher M.
Publisher： Springer Publishing Company
ISSN： 1383-7133
Source： Constraints, Vol.10, Iss.3, 2005-07, pp. : 219-251
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Modular Termination Proofs for Rewriting Using Dependency Pairs
By Giesl J. Arts T. Ohlebusch E.
Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. :
Using induction and rewriting to verify and complete parameterized specifications
By Bouhoula A.
Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. :