328 search results - page 52 / 66 » Proving Termination of Communicating Programs |
DIALM
2010
ACM
13 years 5 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
JACM
2002
13 years 7 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
TAPSOFT
1995
Springer
13 years 11 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...