534 search results - page 76 / 107 » Proving Termination of Rewrite Systems Using Bounds |
FOSAD
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
SIAMCO
2000
13 years 8 months ago
2000
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
QEST
2006
IEEE
14 years 2 months ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
SIAMCOMP
2002
13 years 8 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
SACMAT
2009
ACM
14 years 3 months ago
2009
ACM
Collaborative and distributed applications, such as dynamic coalitions and virtualized grid computing, often require integrating access control policies of collaborating parties. ...