Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008) March 29-30, 2008 Budapest, Hungary

Satellite Event of

• History
• Scope
• Topics
• Invited speaker
• Submissions
• Important dates
• Program chair
• Program committee
• Schedule

Previous editions:

• QAPL 2007, Braga, Portugal. (ENTCS 190(3))
• QAPL 2006, Vienna, Austria. (ENTCS 164(3))
• QAPL 2005, Edinburgh, UK. (ENTCS 153(2))
• QAPL 2004, Barcelona, Spain. (ENTCS 112)
• QAPL 2001, Florence, Italy. (ENTCS 59(3))

Scope

• 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

Invited speaker

Simon Gay, University of Glasgow, UK
Formal Modelling and Analysis of Quantum Protocols

Quantum communication and cryptographic protocols are well on the way to becoming an important practical technology. Although a large amount of successful research has been done on proving their correctness, most of this work does not make use of familiar techniques from formal methods: formal logics for specification, formal modelling languages, separation of levels of abstraction, compositional analysis, and so on. We argue that these techniques will be necessary for the analysis of large-scale systems that combine quantum and classical components, and present the results of initial investigation in several areas.

Jean-Francois Raskin, Universite Libre de Bruxelles, Belgium
On Optimal Strategies in Timed Reachability Games:

Weighted timed game automata extend timed game automata with costs on both locations and transitions. The reachability problem for weighted timed game asks, given a set of states G and a cost K, if player 1 has a strategy to force the game into G with cost less than K no matter how player 2 behaves. Recently, this problem has attracted a lot of attention. In this talk, we will review several results that show that in general the problem is undecidable but that several interesting sub cases are decidable.

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.

Important dates