209 search results - page 26 / 42 » Termination of Priority Rewriting |
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms...
ENTCS
2007
13 years 7 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
Orc is a language proposed by Jayadev Misra [19] for orchestration of distributed services. Orc is very simple and elegant, based on a few basic constructs, and allows succinct an...
FSEN
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...