International audienceWe are concerned in this paper with the verification of reactive systems with event memorization. The reactive systems are specified with an asynchronous reactive language Electre the main feature of which is the capability of memorizing occurrences of events in order to process them later. This memory capability is quite interesting for specifying reactive systems but leads to a verification model with a dramatically large number of states (due to the stored occurrences of events). In this paper, we show that partial-order methods can be applied successfuly for verification purposes on our model of reactive programs with event memorization. The main points of our work are two-fold: (1) we show that the independance re...
Partial-order reduction (POR) is a well-established technique to combat the problem of state-space e...
Abstract. Partial order (PO) reduction methods are widely employed to combat state explosion during ...
AbstractWe present a new approach to the symbolic model checking of timed automata based on a partia...
International audienceThis article is concerned with the veri cation of closed-loop asynchronous rea...
For the development of safety-critical reactive systems, proving correctness is unavoidable. Here we...
AbstractWe present in this paper an operational semantics for the ELECTRE reactive language (Roux et...
The verification of concurrent systems through an exhaustive traversal of the state space suffers fr...
AbstractSoftware systems assembled from a large number of autonomous components become an interestin...
Reactive programs are ubiquitous in modern applications, and so verification is highly desirable. We...
Reactive programs combine traditional sequential programming constructs with primitives to allow com...
This thesis expands the usage of partial order reduction methods in reducing the state space of larg...
International audienceIn this note we revisit the so-called reactive programming style, which evolve...
Partial-order reduction is a well-known technique to cope with the state-space-explosion problem in ...
The verification of concurrent programs remains an open challenge, as thread interaction has to be a...
We present a new dynamic partial-order reduction method for stateless model checking of concurrent p...
Partial-order reduction (POR) is a well-established technique to combat the problem of state-space e...
Abstract. Partial order (PO) reduction methods are widely employed to combat state explosion during ...
AbstractWe present a new approach to the symbolic model checking of timed automata based on a partia...
International audienceThis article is concerned with the veri cation of closed-loop asynchronous rea...
For the development of safety-critical reactive systems, proving correctness is unavoidable. Here we...
AbstractWe present in this paper an operational semantics for the ELECTRE reactive language (Roux et...
The verification of concurrent systems through an exhaustive traversal of the state space suffers fr...
AbstractSoftware systems assembled from a large number of autonomous components become an interestin...
Reactive programs are ubiquitous in modern applications, and so verification is highly desirable. We...
Reactive programs combine traditional sequential programming constructs with primitives to allow com...
This thesis expands the usage of partial order reduction methods in reducing the state space of larg...
International audienceIn this note we revisit the so-called reactive programming style, which evolve...
Partial-order reduction is a well-known technique to cope with the state-space-explosion problem in ...
The verification of concurrent programs remains an open challenge, as thread interaction has to be a...
We present a new dynamic partial-order reduction method for stateless model checking of concurrent p...
Partial-order reduction (POR) is a well-established technique to combat the problem of state-space e...
Abstract. Partial order (PO) reduction methods are widely employed to combat state explosion during ...
AbstractWe present a new approach to the symbolic model checking of timed automata based on a partia...