328 search results - page 22 / 66 » Proving Termination of Communicating Programs |
ENTCS
2008
13 years 7 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
FTCS
1996
13 years 9 months ago
1996
In the research reported in this paper, transient faults were injected in the nodes and in the communication subsystem (by using software fault injection) of a commercial parallel...
INFOCOM
2008
IEEE
14 years 2 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...
AICT
2006
IEEE
14 years 1 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...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...