Sciweavers

Share
LISP
2008

Proving operational termination of membership equational programs

8 years 3 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for advanced features such as evaluation strategies, rewriting modulo, use of extra variables in conditions, partiality, and expressive type systems (possibly including polymorphism and higher-order). However, many of those features are, at best, only partially supported by current term rewriting termination tools (for instance MU-TERM, CiME, APROVE, TTT, TERMPTATION, etc.) while they may be essential to ensure termination. We present a sequence of theory transformations that can be used to bridge the gap between expressive membership equational programs and such termination tools, and prove the correctness of such transformations. We also discuss a prototype tool performing the transformations on MAUDE equational programs and sending the resulting transformed theories to some of the aforementioned standard termina...
Francisco Durán, Salvador Lucas, Claude Mar
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where LISP
Authors Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain
Comments (0)
books