FACT: A Probabilistic Model Checker for Formal Verification with Confidence Intervals

  title={FACT: A Probabilistic Model Checker for Formal Verification with Confidence Intervals},
  author={Radu Calinescu and Kenneth Johnson and Colin Paterson},
We introduce FACT, a probabilistic model checker that computes confidence intervals for the evaluated properties of Markov chains with unknown transition probabilities when observations of these transitions are available. FACT is unaffected by the unquantified estimation errors generated by the use of point probability estimates, a common practice that limits the applicability of quantitative verification. As such, FACT can prevent invalid decisions in the construction and analysis of systems… 
Fast Parametric Model Checking through Model Fragmentation
Parametric model checking (PMC) computes algebraic formulae that express key non-functional properties of a system (reliability, performance, etc.) as rational functions of the system and environment
Software Quality Analysis with Observation-Enhanced Quantitative Verification (Tutorial)
  • R. Calinescu
  • Computer Science
    2017 IEEE International Conference on Software Architecture Workshops (ICSAW)
  • 2017
This tutorial will provide an introduction to the quantitative verification of software quality with the probabilistic model checker PRISM, followed by a presentation of two advanced techniques for observation-enhanced quantitative verification.
Quantitative Verification with Adaptive Uncertainty Reduction
Efficient Parametric Model Checking Using Domain Knowledge
ePMC speeds up the analysis of parametric Markov chains modelling the behaviour of software by exploiting domain-specific modelling patterns for the software components, and precomputes closed-form expressions for key QoS properties of such patterns.
Observation-enhanced verification of operational processes
A self-adaptive role based access control approach is developed which uses a formal definition of adaptation policies to identify potential threats in a real-world IT support system and mitigates risks to the system.
Adversarial Robustness Verification and Attack Synthesis in Stochastic Systems
This paper develops a formal framework for adversarial robustness in systems defined as discrete time Markov chains (DTMCs) and extends the framework to include deterministic, memoryless policies acting in Markov decision processes (MDPs), which includes a flexible approach for specifying several adversarial models with different capabilities to manipulate the system.
The Probabilistic Model Checker Storm (Extended Abstract)
This extended abstract gives a brief overview of the features of Storm, a new probabilistic model checker using state-of-the-art libraries that aims for both high performance and versatility.
Towards Integrated Correctness Analysis and Performance Evaluation of Software Systems (Doctoral Forum Paper)
The doctoral project described in this paper aims to bring these two areas of software verification together by enabling the joint analysis of functional and non-functional properties of software systems.
Functional Uncertainty in Real-Time Safety-Critical Systems
A model is proposed in which components are characterized by bounds on the degree of uncertainty under both worst-case and typical circumstances; the objective is to assure safety under all circumstances while optimizing for performance for typical circumstances.


PARAM: A Model Checker for Parametric Markov Models
PARAM 1.0 is presented, a model checker for parametric discrete-time Markov chains (PMCs) that can evaluate temporal properties of PMCs and certain extensions of this class.
Formal Verification With Confidence Intervals to Establish Quality of Service Properties of Software Systems
A theoretical framework, a tool chain that establish confidence intervals for the QoS properties of a software system modelled as a Markov chain with uncertain transition probabilities, and two case studies are used to assess the effectiveness of the new quantitative verification technique.
A logic for reasoning about time and reliability
This work presents a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds” and gives algorithms for checking that a given Markov chain satisfies a formula in the logic.
The Ins and Outs of the Probabilistic Model Checker MRMC
The Markov Reward Model Checker (MRMC) is a software toolfor verifying properties over probabilistic models. It supports PCTL and CSL model checking, and their rewardextensions. Distinguishing
Asymptotic Bounds for Quantitative Verification of Perturbed Probabilistic Systems
This paper considers perturbation analysis of reachability in the parametric models of these systems equipped with the norm of absolute distance, and proposes a method to compute the asymptotic bounds in the form of condition numbers for constrained reachability probabilities against perturbations of the distribution parameters of the system.
PRISM 4.0: Verification of Probabilistic Real-Time Systems
A major new release of the PRISMprobabilistic model checker is described, adding, in particular, quantitative verification of (priced) probabilistic timed automata.
Quantitative Verification in Practice
This session reports on applying state-of-the-art quantitative verification techniques and tools to a variety of industrial case studies.
Discrete-Time Rewards Model-Checked
The temporal logic probabilistic CTL is extended with reward constraints and formulae to formulate complex measures – involving expected as well as accumulated rewards – in a precise and succinct way are introduced.
Quantitative Verification: Formal Guarantees for Timeliness, Reliability and Performance
This report gives a short introduction to quantitative verification, focusing in particular on a widely used technique called model checking, and its generalisation to the analysis of quantitative aspects of a system such as timing, probabilistic behaviour or resource usage.
PROPhESY: A PRObabilistic ParamEter SYnthesis Tool
ProPhESY, a tool for analyzing parametric Markov chains (MCs), can compute a rational function (i.e., a fraction of two polynomials in the model parameters) for reachability and expected reward objectives and supports the novel feature of conditional probabilities.