1000 search results - page 110 / 200 » Nominal rewriting systems |
OOPSLA
2007
Springer
14 years 4 months ago
2007
Springer
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
CAV
2001
Springer
14 years 2 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
DAC
2008
ACM
14 years 11 months ago
2008
ACM
Hardware accelerators are common in embedded systems that have high performance requirements but must still operate within stringent energy constraints. To facilitate short time-t...
FAST
2007
13 years 11 months ago
2007
Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we presen...