CiME is a rewriting toolbox. Distributed since 1996 as open source, at URL . Beyond a few dozens of users, CiME is used as back-end for other tools such as the TALP tool developed by Enno Ohlebusch at Bielefeld university for termination of logic programs; the MU-TERM tool ( slucas/csr/termination/muterm/ ) for termination of context-sensitive rewriting; the CARIBOO tool (developed at INRIA Nancy Grand-Est) for termination of rewriting under strategies; and the MTT tool ( duran/MTT/ ) for termination of Maude programs. CiME2 is no longer maintained, and the currently developed version is CiME3, available at . The main new feature of CiME3 is the production of traces for Coq. CiME3 is also developed by the participants of the A3PAT project at the CNAM, and is distributed under the Cecill-C licence.

References in zbMATH (referenced in 21 articles )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Babić, Domagoj; Cook, Byron; Hu, Alan J.; Rakamarić, Zvonimir: Proving termination of nonlinear command sequences (2013)
  2. Bouhoula, Adel; Jacquemard, Florent: Sufficient completeness verification for conditional and constrained TRS (2012)
  3. Bosser, Anne-Gwenn; Courtieu, Pierre; Forest, Julien; Cavazza, Marc: Structural analysis of narratives with the Coq proof assistant (2011)
  4. Baudet, Mathieu; Cortier, Véronique; Kremer, Steve: Computationally sound implementations of equational theories against passive adversaries (2009)
  5. Durán, Francisco; Lucas, Salvador; Meseguer, José; Gutiérrez, Francisco: Web services and interoperability for the Maude termination tool (2009) ioport
  6. Courtieu, Pierre; Forest, Julien; Urbain, Xavier: Certifying a termination criterion based on graphs, without graphs (2008)
  7. Durán, Francisco; Lucas, Salvador; Marché, Claude; Meseguer, José; Urbain, Xavier: Proving operational termination of membership equational programs (2008)
  8. Koprowski, Adam; Zantema, Hans: Certification of proving termination of term rewriting by matrix interpretations (2008)
  9. Lucas, Salvador; Meseguer, José: Termination of just/fair computations in term rewriting (2008)
  10. Chrząszcz, Jacek; Walukiewicz-Chrząszcz, Daria: Towards rewriting in Coq (2007)
  11. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: On tree automata that certify termination of left-linear term rewriting systems (2007)
  12. Lucas, Salvador: On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (2006)
  13. Lucas, Salvador: Proving termination of context-sensitive rewriting by transformation (2006)
  14. Wehrman, Ian; Stump, Aaron; Westbrook, Edwin: Slothrop: Knuth-Bendix completion with a modern termination checker (2006)
  15. Contejean, Evelyne; Corbineau, Pierre: Reflecting proofs in first-order logic with equality (2005)
  16. Contejean, Evelyne; Marché, Claude; Tomás, Ana Paula; Urbain, Xavier: Mechanically proving termination using polynomial interpretations (2005)
  17. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: On tree automata that certify termination of left-linear term rewriting systems (2005)
  18. Lucas, Salvador: Polynomials over the reals in proofs of termination: from theory to practice (2005)
  19. Marché, Claude; Urbain, Xavier: Modular and incremental proofs of AC-termination (2005)
  20. Zantema, H.: Termination of string rewriting proved automatically (2005)

1 2 next