Eighth Workshop on Quantitative Aspects of Programming Languages (QAPL 2010) March 27-28, 2010 Paphos, Cyprus

News. We invite the submission of papers on Quantitative Aspects of Programming Languages and Systems for publication in a special issue of the Journal of Theoretical Computer Science (TCS). For further details see here.

The proceedings of the workshop have now been published as volume 28 of Electronic Proceedings in Theoretical Computer Science (EPTCS).

• History
• Scope
• Topics
• Invited speakers
• Submissions
• Important dates
• Program chair
• Program committee
• Accepted papers

History

The first edition of the workshop on Quantitative Aspects of Programming Languages, QAPL 2001, was held in Florence, Italy as a satellite event to the ACM conference on Principles, Logics, and Implementations of High-level Programming Languages, PLI 2001. Since its second edition, QAPL 2004 in Barcelona, Spain, the QAPL workshops have become a yearly satellite event with ETAPS.

The proceedings of all QAPL workshops between 2001 and 2009 appeared in the Electronic Notes in Theoretical Computer Science (ENTCS). Based on the QAPL 2004 and QAPL 2006 events, two special issues of the journal Theoretical Computer Science (TCS) were published in volume 346(1) and volume 382(1), respectively.

Previous editions:

• QAPL 2001, Florence, Italy. (ENTCS 59(3))
• QAPL 2004, Barcelona, Spain. (ENTCS 112)
• QAPL 2005, Edinburgh, UK. (ENTCS 153(2))
• QAPL 2006, Vienna, Austria. (ENTCS 164(3))
• QAPL 2007, Braga, Portugal. (ENTCS 190(3))
• QAPL 2008, Budapest, Hungary. (ENTCS 220(3))
• QAPL 2009, York, United Kingdom. (ENTCS 253(3))

Scope

Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, security and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. The aim of this workshop is to discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, the workshop focuses on:

• the design of probabilistic, real-time, quantum languages and the definition of semantical models for such languages;
• the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements);
• the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis);
• applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues.

Topics

Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in:

Invited speakers

• German Puebla, Technical University of Madrid, Spain
• Pasquale Malacaria, Queen Mary University of London

Submissions

1. Regular paper submissions must be original work, and must not have been previously published, nor be under consideration for publication elsewhere. Regular paper submission must not exceed 15 pages, possibly followed by a clearly marked appendix which will be removed for the proceedings and contains technical material for the reviewers.
2. A presentation reports on recent or ongoing work on relevant topics and ideas, for timely discussion and feedback at the workshop. There is no restriction as for previous/future publication of the contents of a presentation. Typically, a presentation is based on a paper which recently appeared (or which is going to appear) in the proceedings of another recognized conference, or which has not yet been submitted. The (extended) abstract of presentation submissions should not exceed 4 pages.

All submissions must be in PDF format and use the EPTCS style files. Submissions can be made through the EasyChair website.

Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Publication of a selection of the papers in a special issue of a journal is under consideration.

Important dates

For regular papers:

• Submission: December 21, 2009
• Notification: January 25, 2010
• Final version: February 15, 2010

For abstracts:

• Submission: 1 February, 2010
• Notification: 3 February, 2010

Program Chairs

• Alessandra Di Pierro, University of Verona, Italy.
• Gethin Norman, University of Glasgow, UK.

Program Committee

• Alessandro Aldini, University of Urbino, Italy
• Christel Baier, University of Dresden, Germany
• Marco Bernardo, University of Urbino, Italy
• Nathalie Bertrand, IRISA/INRIA Rennes, France
• Patricia Bouyer, LSV, CNRS & ENS de Cachan, France
• Jeremy Bradley, Imperial College London, UK
• Tomas Brazdil, Masaryk University, Czech Republic
• Frank van Breugel, York University, Canada
• Antonio Cerone, UNU-IIST, Macao
• Kostas Chatzikokolakis, Technical University of Eindohoven, the Netherlands
• Josee Desharnais, University of Laval, Canada
• Alessandra Di Pierro, University of Verona, Italy
• Susanne Graf, Verimag, France
• Marcus Groesser, Technical University Dresden, Germany
• Mieke Massink, NR-ISTI Pisa, Italy
• Paulo Mateus, Technical University of Lisbon, Portugal
• Annabelle McIver, Maquarie University, Australia
• Gethin Norman, University of Glasgow, UK
• David Parker, Oxford University, UK
• Jeremy Sproston, University of Torino, Italy
• Herbert Wiklicky, Imperial College London, UK
• Verena Wolf, Saarland University, Germany

Accepted papers

Regular papers:

• Alessandro Aldini. Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior.
• Karine Altisen, Matthieu Moy and Yanhong Liu. Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata.
• Damian Barsotti and Nicolas Wolovick. Automatic Probabilistic Program Verification through Random Variable Abstraction.
• Alessandro Bianco, Marco Faella, Fabio Mogavero and Aniello Murano. Quantitative Fairness Games.
• David Cachera and Arnaud Jobin. Injecting Abstract Interpretations into Linear Cost Models.
• Mario Coppo, Ferruccio Damiani, Maurizio Drocco, Elena Grassi and Angelo Troina. Stochastic Calculus of Wrapped Compartments.
• Sonja Georgievska and Suzana Andova. Testing Reactive Probabilistic Processes.
• Matthias Gudemann and Frank Ortmeier. Probabilistic Model-Based Safety Analysis.
• Ukachukwu Ndukwu and Annabelle McIver. An expectation transformer approach to predicate abstraction and data independence for probabilistic programs.
• Markus Rabe and Sven Schewe. Optimal Time-Abstract Schedulers for CTMDPs and Markov Games.
• Anton Stefanek, Richard Hayden and Jeremy Bradley. A new tool for the performance analysis of massively parallel computer systems.

Abstracts:

• Annabelle McIver, Joost-Pieter Katoen, Carroll Morgan and Larissa Meinicke. Linear-invariant generation for probabilistic programs.
• Joost-Pieter Katoen, Jaco van de Pol, Marielle Stoelinga and Mark Timmer. A linear process algebraic format for probabilistic systems with data (abstract)