Events at MF 6.132

–

In my last colloquium, I discussed the importance of explainable AI (XAI) and steps towards explaining ML classifiers. In particular, I showed how to obtain abductive explanations (AXps), how certain AXps may be illogical from the user’s perspective, and how to omit AXps based on given criterion. Moreover, I illustrated how one could extract an …continue reading

–

Within the theory of model checking one of the techniques to combat the state space explosion is symmetry reduction. The main idea is to combine symmetric states, resulting in a reduced state space. This technique poses two main challenges: symmetry detection and symmetry reduction. In the previous talks we presented a technique that relies on …continue reading

–

We previously introduced Quasi Decision Diagrams (QDDs) which act as a replacement of Binary Decision Diagrams. In this talk, we discuss how QDDs can be used for reachability analysis, and we highlight the challenges that arise. We also propose solutions for these challenges, which remain to be evaluated within the overall reachability pipeline.

–

I have previously presented template modal μ-calculus formulae for capturing a variety of liveness properties under a number of different completion criteria. We have since improved on this work: we have designed a formula for strong fairness that is polynomial in the number of non-blockable actions, rather than exponential. Additionally, Lise Arendsen has formalized the …continue reading

–

We make reasoning about potentially overlapping arrays easier, by providing specification constructs to indicate and verify that two arrays are not aliases, or that they are immutable, so they can be modelled as mathematical sequences. All our techniques are implemented in the VerCors program verifier. We illustrate how our techniques improve scalability through a large …continue reading

–

In this talk, I will give an overview of the main instruments that I encountered during my PhD to reason formally on the behaviour of processes exhibiting both nondeterministic and probabilistic behaviour. We will talk about behavioural equivalences, their approximated versions and behavioural metrics. If time permits, we will also discuss the logical characterisations of …continue reading