Quantitative Aspects of Programming Languages and Systems over the past $2^4$ years and beyond

Abstract

Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security. They are essential in characterizing the behaviour of many critical systems and in estimating their properties. Hence, they need to be integrated both at the level of system modeling and within the verification methodologies and tools. Along the last two decades a variety of theoretical achievements and automated techniques have contributed to make quantitative modeling and verification mainstream in the research community. In the same period, they represented the central theme of the series of workshops entitled Quantitative Aspects of Programming Languages and Systems (QAPL) and born in 2001. The aim of this survey is to revisit such achievements and results from the standpoint of QAPL and its community.

In Proceedings QAPL 2019, arXiv:2001.06163

References in corpus (28)

• UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
• Stochastic Calculus of Wrapped Compartments
• Logical Characterization of Bisimulation Metrics
• Probabilistic Model-Based Safety Analysis
• Computing Distances between Probabilistic Automata
• Distances for Weighted Transition Systems: Games and Properties
• Two-Player Reachability-Price Games on Single-Clock Timed Automata
• Stochastically timed predicate-based communication primitives for autonomic computing
• Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes
• An expectation transformer approach to predicate abstraction and data independence for probabilistic programs
• HYPE with stochastic events
• Optimal Time-Abstract Schedulers for CTMDPs and Markov Games
• Patch-based Hybrid Modelling of Spatially Distributed Systems by Using Stochastic HYPE - ZebraNet as an Example
• Logical Characterization of Trace Metrics
• MELA: Modelling in Ecology with Location Attributes
• Analysis of Non-Linear Probabilistic Hybrid Systems
• Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
• MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
• Extended Differential Aggregations in Process Algebra for Performance and Biology
• Time Delays in Membrane Systems and Petri Nets
• Testing Reactive Probabilistic Processes
• Automated Verification of Quantum Protocols using MCMAS
• PAWS: A Tool for the Analysis of Weighted Systems
• Measuring Progress of Probabilistic LTL Model Checking
• Design and Optimisation of the FlyFast Front-end for Attribute-based Coordination
• A Stochastic Broadcast Pi-Calculus
• Language-based Abstractions for Dynamical Systems
• Injecting Abstract Interpretations into Linear Cost Models