1716 search results - page 71 / 344 » Proving Conditional Termination |
CHARME
2003
Springer
14 years 2 months ago
2003
Springer
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
FUIN
2008
13 years 8 months ago
2008
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
BIRTHDAY
2007
Springer
14 years 2 months ago
2007
Springer
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
AICT
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper, discusses the feasibility of mobile Web Service provisioning from Smart Phones, confluencing two major recent trends in distributed information systems engineering: th...