1000 search results - page 111 / 200 » Nominal rewriting systems |
IANDC
2011
13 years 5 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
FSTTCS
1993
Springer
14 years 2 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We determine the robust Nash equilibrium (RNE) for a wide range of problems in communications systems and networks that are faced with uncertainty in their parameters’ values. T...
COMPSEC
2004
13 years 9 months ago
2004
Security technology suitable for the burgeoning embedded system market has not been widespread. Untrusted code downloaded from the Internet poses numerous security risks due to th...
SOFSEM
2010
Springer
13 years 7 months ago
2010
Springer
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...