273 search results - page 17 / 55 » A Compositional Semantics for Conditional Term Rewriting Sys... |
106
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
89
Voted
HYBRID
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. Time progress conditions in hybrid systems are usually speci ed in terms of invariants, predicates characterizing states where time can continuously progress or dually, d...
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of ...
123
Voted
ENTCS
2007
14 years 11 months ago
2007
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
94
Voted
SAC
2005
ACM
15 years 5 months ago
2005
ACM
Finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. In this paper we present a Des...