RTA
2009
Springer
14 years 6 months ago
2009
Springer
RTA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
RTA
2009
Springer
14 years 6 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
RTA
2009
Springer
14 years 6 months ago
2009
Springer
RTA
2009
Springer
14 years 6 months ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
RTA
2009
Springer
14 years 6 months ago
2009
Springer
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
RELMICS
2009
Springer
14 years 6 months ago
2009
Springer
RELMICS
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Boolean Contact Algebras (BCA) establish the algebraic counterpart of the mereotopolopy induced by the Region Connection Calculus (RCC). Similarly, Stonian p-ortholattice...
RELMICS
2009
Springer
14 years 6 months ago
2009
Springer
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...
RELMICS
2009
Springer
14 years 6 months ago
2009
Springer
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to ...