Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456

Address: [go: Go Back, main page]
Remove Scripts Accept Cookies Show Images Show Referer Rotate13 Base64 Strip Meta Strip Title Session Cookies

Concurrency Column in the February 2004 Issue of BEATCS

19 January 2004

I have posted the contribution to the Concurrency Column for the February 2004 issue of the Bulletin of the European Association for Theoretical Computer Science. This is a beautiful piece, entitled Process Algebra Needs Proof Methodology, written by Wan Fokkink, Jan Friso Groote and Michel Reniers. The paper recounts how the authors' struggle with a correctness proof for the most complex sliding window protocol presented in Tanenbaum's Computer Networks textbook led to the development of several useful proof techniques. The main message of this contribution is that, after more than a decade of experience, the mathematics of process algebraic verification needs to be developed further.

I trust that readers of the Concurrency Column will enjoy reading this paper as much as I did, and will be inspired to contribute to research in this area.

Feel free to contact me if you have ideas for future contributions to the Concurrency Column.