888 search results - page 107 / 178 » The Power of Temporal Proofs |
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
ENTCS
2008
14 years 10 months ago
2008
Reynolds' view of a storage cell as an expression-acceptor pair has been widely used by researchers. We present a different way of organizing semantics of state, and in parti...
IJNSEC
2007
14 years 10 months ago
2007
The recent developments in the mobile technology (mobile phones, middleware) created a need for new methods of protecting the code transmitted through the network. The oldest and ...
ENTCS
2000
14 years 9 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
CP
2010
Springer
14 years 8 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...