3 search results - page 1 / 1 » Cdiprover3: A Tool for Proving Derivational Complexities of ... |
ESSLLI
2009
Springer
13 years 6 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
RTA
2010
Springer
14 years 12 days ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
DAC
1994
ACM
14 years 18 days ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...