8 citations
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2009★ 8 cited
Verification of Timed Automata Using Rewrite Rules and Strategies
Emmanuel Beffara, Olivier Bournez, Hassen Kacem +1
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a clas…
cs.LO2005★ 2 cited
Termination of rewriting strategies: a generic approach
Isabelle Gnaedig, Helene Kirchner
We propose a generic termination proof method for rewriting under strategies, based on an explicit induction on the termination property. Rewriting trees on ground terms are modele…