Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL 2011)
April 1-3, 2011
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 57 of Electronic Proceedings in Theoretical Computer Science (EPTCS).
|Sponsored by the Danish Center of Excellence on Modelling Information Technology
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). For 2010 the proceedings appeared in the Electronic Proceedings in Theoretical Computer Science (EPTCS).
Based on the QAPL 2004 and QAPL 2006 events, two special issues of the journal Theoretical Computer Science (TCS) were published as volume 346(1) and volume 382(1), respectively. A special issue for the 2010 workshop is currently inviting submissions, see here for further details.
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:
Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in:
|Language design||Information systems||Asynchronous HW analysis|
|Language extension||Multi-tasking systems||Automated reasoning|
|Time-critical systems||Performance analysis||Safety|
|Embedded systems||Program analysis||Risk and hazard analysis|
|Coordination models||Protocol analysis||Scheduling theory|
|Biological systems||Concurrent systems||Resource analysis|
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.
For regular papers:
For presentation reports:
Bogdan Aman and Gabriel Ciobanu
Time Delays in Membrane Systems and Petri Nets
Aleksandr Andreychenko, Pepijn Crouzen, Linar Mikeev and Verena Wolf
On-the-fly Uniformization of Time-Inhomogeneous Infinite Markov Population Models
Luca Bortolussi, Vashti Galpin and Jane Hillston
HYPE with stochastic events
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy and Carroll Morgan
Real Reward Testing for Probabilistic Processes (Extended Abstract)
Josee Desharnais and Joseph Assouramou
Analysis of Non-Linear Probabilistic Hybrid Systems
Josee Desharnais, Mathieu Tracol and Abir Zhioua
Computing Distances between Probabilistic Automata
Uli Fahrenberg, Claus Thrane and Kim G. Larsen
Distances for WeightedTransition Systems: Games and Properties
Florian Leitner-Fischer and Stefan Leue
QuantUM: Quantitative Safety Analysis of UML Models
Two-Player Reachability-Price Games on Single-Clock Timed Automata
Daniel Seidel and Janis Voigtlander
Improvements for Free
Lei Song, Flemming Nielson and Bo Friis Nielsen
A Stochastic Broadcast Pi-Calculus
Kiraga Alain Freddy and Mullins John
Admissible adversaries in PRISM for probabilistic security analysis
Pablo Arrighi, Alejandro Diaz-Caro and Benoit Valiron.
Subject reduction in a Curry-style polymorphic type system with a vectorial structure