Although generally too weak to guarantee correctness, testing is an indispensable technique for the validation of reactive systems. Abstract Interpretation has been used to overcome some of the problems associated with testing such as the termination of a program run within an acceptable interval of time. We propose the use of Probabilistic Abstract Interpretation for measuring the error made in the evaluation of the reliability of systems via Monte-Carlo testing. The problem we consider is to determine the probability that a reactive system's response falls within a certain set of possible outputs, i.e. that it passes a certain test. As Monte-Carlo testing of the concrete system is not always feasible, tests can be performed instead on an ...
We present a method for approximating the semantics of probabilistic programs to the purpose of cons...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
In order to perform probabilistic program analysis we need to consider probabilistic languages or la...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
AbstractWe develop a general testing scenario for probabilistic processes, giving rise to two theori...
We develop a general testing scenario for probabilistic processes, giving rise to two theories: prob...
This work presents an executable model-based testing framework for probabilistic systems with non-de...
AbstractWhen modelling a complex system, such as one with distributed functionality, we need to choo...
In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from fa...
This paper presents a model-based testing framework for probabilistic systems. We provide algorithms...
When modelling a complex system, such as one with distributed functionality, we need to choose an ap...
One of the most studied extensions of testing theory to nondeterministic and probabilistic processe...
Abstract. This paper investigates relative precision and optimality of analyses for concurrent proba...
Abstract. One of the most studied extensions of testing theory to non-deterministic and probabilisti...
This paper considers the probabilistic may/must testing theory for processes having external, intern...
We present a method for approximating the semantics of probabilistic programs to the purpose of cons...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
In order to perform probabilistic program analysis we need to consider probabilistic languages or la...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
AbstractWe develop a general testing scenario for probabilistic processes, giving rise to two theori...
We develop a general testing scenario for probabilistic processes, giving rise to two theories: prob...
This work presents an executable model-based testing framework for probabilistic systems with non-de...
AbstractWhen modelling a complex system, such as one with distributed functionality, we need to choo...
In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from fa...
This paper presents a model-based testing framework for probabilistic systems. We provide algorithms...
When modelling a complex system, such as one with distributed functionality, we need to choose an ap...
One of the most studied extensions of testing theory to nondeterministic and probabilistic processe...
Abstract. This paper investigates relative precision and optimality of analyses for concurrent proba...
Abstract. One of the most studied extensions of testing theory to non-deterministic and probabilisti...
This paper considers the probabilistic may/must testing theory for processes having external, intern...
We present a method for approximating the semantics of probabilistic programs to the purpose of cons...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
In order to perform probabilistic program analysis we need to consider probabilistic languages or la...