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

@article{Aldini2019QuantitativeAO,
  title={Quantitative Aspects of Programming Languages and Systems over the past \$2^4\$ years and beyond},
  author={Alessandro Aldini},
  journal={ArXiv},
  year={2019},
  volume={abs/2001.06942},
  pages={1-19}
}
  • A. Aldini
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
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… Expand

References

SHOWING 1-10 OF 154 REFERENCES
The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models - (QComp 2019 Competition Report)
TLDR
The challenges in setting up a quantitative verification competition are reported, the results of QComp 2019 are presented, the lessons learned are summarised, and an outlook on the features of the next edition ofQComp is provided. Expand
Quantitative Analysis With the Probabilistic Model Checker PRISM
TLDR
The usefulness of probabilistic model checking techniques in detecting flaws and unusual trends is demonstrated, focusing mainly on the quantitative analysis of a range of best, worst and average-case system characteristics. Expand
Quantitative Security Analysis for Multi-threaded Programs
TLDR
A novel model of quantitative analysis for multi-threaded programs that also takes into account the effect of observables in intermediate states along the trace, and defines a notion of the leakage of a program trace. Expand
Precise quantitative information flow analysis - a symbolic approach
TLDR
This paper investigates the use of program specifications in QIF and presents criteria for specification admissibility and a program analysis that replaces exhaustive program exploration with symbolic execution, while incorporating user-supplied (but machine-checked) specifications. Expand
Concurrent constraint programming
TLDR
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of computing with partial information, and the concomitant notions of consistency and entailment, and develops the cc family of languages, which is very similar to Milner's CCS. Expand
UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
TLDR
A survey of U PPAAL-SMC, a major extension of the real-time verification tool UPPAAL, including modeling and specification formalisms as well as techniques applied with applications of the tool to case studies. Expand
An expectation transformer approach to predicate abstraction and data independence for probabilistic programs
TLDR
This paper revisits the well-known technique of predicate abstraction using expectation transformers, and identifies transformer properties which correspond to abstractions that yield nevertheless exact bound on the performance of infinite state probabilistic systems. Expand
Model checking mobile stochastic logic
TLDR
MoSL^+ is presented, an extension of MoSL, which incorporates some basic features of the Modal Logic for MObility (MoMo), a logic specifically designed for dealing with resource management and mobility aspects of concurrent behaviours. Expand
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
TLDR
A framework of granularity-based interfacing to speed up the analysis of a TA modeled component and derive lower and upper bounds on arrival patterns of the fine output streams using the causality closure algorithm can help to achieve tradeoffs between precision and analysis time. Expand
Stochastic Modelling of Communication Protocols from Source Code
TLDR
This work constructs a model compositionally, so that each function in the system corresponds to a sequential PEPA process, derived by abstract interpretation over the state machine of a function, using interval abstraction to represent linear expressions of integer variables. Expand
...
1
2
3
4
5
...