Marc Pouly

Learn More
Attack–defense trees extend attack trees with defense nodes. This richer formalism allows for a more precise modeling of a system's vulnerabilities, by representing interactions between possible attacks and corresponding defensive measures. In this paper we compare the computational complexity of both formalisms. We identify semantics for which extending(More)
This work addresses the growing need of performing meaningful probabilistic analysis of security. We propose a framework that integrates the graphical security modeling technique of attack–defense trees with probabilistic information expressed in terms of Bayesian networks. This allows us to perform probabilistic evaluation of attack– defense scenarios(More)
It has been known for a long time that solving optimization problems by use of local computation techniques reduces to non-serial dynamic programming. Therefore, the valuation algebra axioms constitute in some way also the mathematical justification of dynamic programming. This paper builds up the corresponding theory from the more general perspective of(More)
The distributive law known from arithmetics is one of the best tools for a computer scientist to grapple with the intractable nature of many applications. So, efficient algorithms have been developed for the computation of Fourier and Hadamard transforms, Bayesian networks, database queries, decoding problems and many more. The fact that they all benefit(More)
Computing inference from a given knowledgebase is one of the key competences of computer science. Therefore, numerous formalisms and specialized inference routines have been introduced and implemented for this task. Typical examples are Bayesian networks, constraint systems or different kinds of logic. It is known today that these formalisms can be unified(More)