1894 search results - page 278 / 379 » A TLA Proof System |
112
click to vote
IPL
2010
15 years 2 months ago
2010
In this paper, we re-analyse the Rate Monotonic Scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all t...
133
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
165
Voted
CANS
2009
Springer
15 years 1 months ago
2009
Springer
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
147
click to vote
NETWORKS
2011
14 years 11 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
192
Voted
SPE
2011
14 years 11 months ago
2011
Abstract. Two methods have been identified for Event-B model decomposition: shared variable and shared event. The purpose of this paper is to introduce the two approaches and the ...