Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > The 22nd Nordic Workshop on Pr...

The 22nd Nordic Workshop on Programming Theory (NWPT 2010)

Marina Waldén, Luigia Petre (Eds.), The 22nd Nordic Workshop on Programming Theory (NWPT 2010). The Journal of Logic and Algebraic Programming 81(3), 2012.

Abstract:

This special issue of the Journal of Logic and Algebraic Programming (JLAP) is devoted to revised full versions of selected papers from the 22nd Nordic Workshop on Programming Theory (NWPT 2010). The workshop took place in Turku, Finland, during 10-12 November 2010.

NWPT 2010 attracted 50 participants from 13 countries. The scientific programme of the workshop consisted of four invited talks by Flemming Nielson, Luke Ong, Joachim Parrow and Kaisa Sere, as well as 28 contributed papers. This special issue includes nine articles, representing one invited talk (the paper by Parrow et al.) and eight contributed papers of the workshop. The selection reflects the range of topics presented at NWPT 2010.

The invited article brings forward current topics in process algebras, extending the authors’ previous work on the psi-calculus. Two of the articles explore the type and effect system for concurrency, one studying it in a Java-like language and the other in an lambda-calculus based, idealised language for concurrency, functions, lock handling, and thread creation. Refinement notions of interval Markov chains are then put forward, with the authors presenting several expressiveness results and complexity bounds with respect to them. A regrouping protocol for wireless sensor networks with mobile nodes, focusing on reducing the power usage is also formally modelled and validated. A variation on a program execution exploration technique is then introduced, by reversing the temporal direction of exploration, yielding an algorithm that is better performing in several cases. Reachability analysis of timed automata is studied in another article based on max-plus polyhedral, due to their avoidance of the state-space explosion of model checking. A Hoare-Floyd logic (sound and complete up to derivations) embedded on a simple imperative language with labels and jumps is introduced in another article by adding implicit pre- and post-conditions to every imperative construct. Finally, a reasoning system for a distributed object-oriented language is introduced, showing it to be compositional.

BibTeX entry:

@PERIODICAL{ejWaPe12a,
  title = {The 22nd Nordic Workshop on Programming Theory (NWPT 2010)},
  journal = {The Journal of Logic and Algebraic Programming },
  volume = {81},
  number = {3},
  editor = {Waldén, Marina and Petre, Luigia},
  publisher = {Elsevier},
  year = {2012},
}

Belongs to TUCS Research Unit(s): Distributed Systems Laboratory (DS Lab)

Publication Forum rating of this publication: level 2

Edit publication