Scope

The Distributed Algorithms community has, over the last decades, developed an impressing number of ingenious algorithms to solve truly hard problems, and also has come up with numerous subtle impossibility results. However, much of this fascinating work (models, algorithms, results, proofs) remained accessible only to insiders of the community. The Concurrency Theory community has, also over the last decades, developed and studied an equally impressing amount of semantical models, theories, and verification techniques. However, these theories have not yet had the desired impact on a wider audience; in essence, there have not yet been enough examples of non-trivial practical applications.

Interestingly—and unfortunately—this co-development happened mostly independently with very little exchange between the two separate communities. Worse, although ultimately addressing similar problems, different vocabularies and terminologies have been invented such that even the communication between the communities is rendered difficult. Clearly, the two communities would benefit from getting to know each other better. On the one hand, the Concurrency Theory community offers formal reasoning techniques and proximity to well-understood programming languages, and would profit from proofs of applicability on tough examples. On the other hand, the Distributed Computing community offers challenging applications, while the required proof work is quite likely to profit from formal semantics techniques, especially the more recent ones.

Thus, the aim of this workshop is to invite the researchers of the two communities to gently get to know the basic models, techniques, and problems of each others fields, in order to achieve some cross-fertilization.

Format

e-mail to the webadmin of this site