3 search results - page 1 / 1 » Cdiprover3: A Tool for Proving Derivational Complexities of ... |
126
Voted
ESSLLI
2009
Springer
14 years 10 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...
110
Voted
RTA
2010
Springer
15 years 4 months 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...
99
Voted
DAC
1994
ACM
15 years 4 months 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...