International audienceWe introduce an automated workflow to verify a variety of temporal properties on systems of agents that interact through virtual stigmergies. By mechanically reducing the property and the system under verification to an MCL query and a sequential LNT program (both MCL and LNT being languages available in the CADP formal verification toolbox), we may reuse efficient modelchecking procedures that can give us a verdict on whether the property is satisfied by the system. Among other things, this procedure allows us to verify that a system satisfies a given predicate infinitely often during its execution, which is an improvement over previous verification approaches. We demonstrate the capabilities of this workflow by verif...
We present automatic verification techniques for concurrent stochastic multi-player games (CSGs) wit...
Abstract We propose a method for the specification and the automated verifica-tion of temporal prope...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
International audienceWe introduce an automated workflow to verify a variety of temporal properties ...
International audienceCollective adaptive systems may be broadly defined as ensembles of autonomous ...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
In this thesis we investigate how the known framework of automatic formal verification by model chec...
In this paper, we address the problem of model checking temporal properties of finite-state programs...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Compositional verification aims at managing the complexity of the verification process by exploiting...
This paper addresses the problem of verification of multiagent systems by means of symbolic model c...
Abstract This paper deals with the problem of verification ofgame-like structures by means of symbol...
Within many domains, among which biological, cognitive, and social areas, multiple interacting proce...
International audienceDuring the last decades, concurrency theory successfully developed salient con...
In this paper, we describe a new symbolic model checking procedure for CTL verification of infinite-...
We present automatic verification techniques for concurrent stochastic multi-player games (CSGs) wit...
Abstract We propose a method for the specification and the automated verifica-tion of temporal prope...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
International audienceWe introduce an automated workflow to verify a variety of temporal properties ...
International audienceCollective adaptive systems may be broadly defined as ensembles of autonomous ...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
In this thesis we investigate how the known framework of automatic formal verification by model chec...
In this paper, we address the problem of model checking temporal properties of finite-state programs...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Compositional verification aims at managing the complexity of the verification process by exploiting...
This paper addresses the problem of verification of multiagent systems by means of symbolic model c...
Abstract This paper deals with the problem of verification ofgame-like structures by means of symbol...
Within many domains, among which biological, cognitive, and social areas, multiple interacting proce...
International audienceDuring the last decades, concurrency theory successfully developed salient con...
In this paper, we describe a new symbolic model checking procedure for CTL verification of infinite-...
We present automatic verification techniques for concurrent stochastic multi-player games (CSGs) wit...
Abstract We propose a method for the specification and the automated verifica-tion of temporal prope...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...