Abstract— Model checking can be aided by inductive invariants, small local properties that can be proved by simple induction. We present a way to automatically extract inductive ...
Michael L. Case, Alan Mishchenko, Robert K. Brayto...
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
Ananda Basu, Saddek Bensalem, Doron Peled, Joseph ...
Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov c...