output
20052015
most citedAutomatic and Transparent Transfer of Theorems along Isomorphisms in the Coq Proof Assistant

11 citations

researchers with a paper here
collaborating institutions
Showing 2009 · cs.LOShow all

1 paper · 2 filters

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…