Verification of Timed Automata Using Rewrite Rules and Strategies
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules
arxiv.orgrank this link
2 indexed results
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules
This thesis is devoted to the study of a calculus that describes the application of conditional rewriting rules and the