1204 search results - page 143 / 241 » Termination of Polynomial Programs |
91
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
89
Voted
AISC
2004
Springer
15 years 6 months ago
2004
Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
106
Voted
ISW
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Code obfuscations are semantics-preserving code transformations used to protect a program from reverse engineering. There is generally no expectation of complete, long-te...
107
click to vote
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
93
Voted
APLAS
2003
ACM
15 years 6 months ago
2003
ACM
This paper studies the problem of resource availability in the context of mobile code for embedded systems such as smart cards. It presents an architecture dedicated to controlling...