328 search results - page 28 / 66 » Proving Termination of Communicating Programs |
POPL
2001
ACM
14 years 8 months ago
2001
ACM
This paper addresses the design and verification of infrastructure for mobile computation. In particular, we study language primitives for communication between mobile agents. The...
TPDS
2008
13 years 7 months ago
2008
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
In recent years it has been shown that dynamic monitoring can be used to soundly enforce information flow policies. For programs distributed in source or bytecode form, the use o...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...