1147 search results - page 48 / 230 » Termination in language-based systems |
AISC
2004
Springer
14 years 15 days ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
IWOMP
2009
Springer
14 years 3 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
ALP
1994
Springer
14 years 26 days ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
ICTAC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We investigate the issue of typing confidentiality in a languagebased information-flow security approach, aiming at improving some previously proposed type systems, esp...