16th Workshop on Quantitative Aspects of Programming Languages and SystemsQAPL 2019
Quantitative aspects of computation refer to the use of physical quantities (time, bandwidth, etc.) as well as mathematical quantities (for example, probabilities) for the characterisation of the behaviour and for determining the properties of systems. 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 the QAPL workshop series is to discuss the explicit use of time and probability and general quantities either directly in the model or as a tool for the analysis or synthesis of systems. The 16th edition of QAPL will also focus on discussing the developments, challenges and results in this area covered by our workshop in its nearly 20-year history.
Call for Papers
The aim of the QAPL workshop series is to discuss the explicit use of time, probability and general quantities either directly in the model or as a tool for the analysis of systems.
The following main themes are relevant to the QAPL workshop:
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);
the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance analysis);
applications to safety-critical systems, communication protocols, asynchronous hardware, etc.
The topics of the workshop are transversal to all areas of Computer Science including Systems, Languages, Semantics, Analysis, Information Security etc., and consists in the probabilistic, timing and generally quantitative aspects of the various areas. Particular relevance will be given to the emerging areas of Quantum Computation, Bioinformatics and System Biology.
In order to encourage participation and discussion, this workshop solicits two types of submissions - extended abstracts and presentations:
Extended Abstracts: 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 6 pages (excluding the bibliography), additional technical material, proofs etc. can be provided in a clearly marked appendix which will be read by reviewers at their discretion. Regular papers will be reviewed by the PC.
Presentation Reports concern 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 recognised conference, or which has not yet been submitted. The (extended) abstract of presentation submissions should not exceed 3 pages. Presentation reports will be selected by the PC Chairs (based on the availability of presentation time).
The workshop PC will review all regular paper submissions based on their relevance, merit, originality, and technical content. Presentation reports will receive a lightweight review to establish their relevance for the workshop. The authors of accepted submissions of both types are expected to present and discuss their work at the workshop. Accepted regular papers (allowing for minor corrections) will be published electronically in the pre-proceedings available during the workshop and (extended versions of up to 12-15 pages) after the workshop and a second review round in the Electronic Proceedings in Theoretical Computer Science (EPTCS) as post-proceedings. We also plan a special issue of a journal.
Sun 7 Apr Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
09:00 - 10:30
|Principles of QAPL: What I learned in nearly 20 years and what I still don’t understand|
Herbert WiklickyImperial College London
|Probabilistic output analyses for deterministic programs -reusing existing non-probabilistic analyses|
Maja KirkebyRoskilde UniversityPre-print
11:00 - 12:30
|A Faster-Than Relation for Semi-Markov Decision Processes|
Mathias Ruggaard PedersenAalborg University, Giorgio BacciAalborg University, Kim LarsenAalborg UniversityPre-print
|Automatic Synthesis of Polynomial Probabilistic Invariants via Geometric Persistence|
|Towards Digital Twins for the Description of Automotive Software Systems|
Jan Olaf BlechAalto UniversityPre-print
14:00 - 15:30
|Invited talk: Exact and Approximate Reductions of Quantitative Models|
I: Max TschaikowskiTU Wien
|Coherent Resolutions of Nondeterminism|
Marco BernardoUniversity of Urbino
16:00 - 18:00
|Quantitative Separation Logic - A Logic for Reasoning about Probabilistic Pointer Programs |
Kevin BatzRWTH Aachen University, Benjamin Lucien KaminskiRWTH Aachen University; University College London, Joost-Pieter KatoenRWTH Aachen University, Christoph MathejaRWTH Aachen University, Thomas NollRWTH Aachen UniversityDOI
|An Adequate Semantics for Hybrid While|
|Recent Applications and Quantitative Aspects of Spatial Model Checking|
|Equational Characterization Metaresults for Bisimulation and Trace Semantics in ULTraS|
Marco BernardoUniversity of Urbino