The partial update problem for parallel abstract state machines has manifested itself in the cases of counters, sets and maps. We propose a solution of the problem that lends itself to an efficient implementation and covers the three cases mentioned above. There are other cases of the problem that require a more general framework
AbstractThe sweep-line method exploits intrinsic progress in concurrent systems to alleviate the sta...
International audienceModel checking has long been used as a means of verification of formal specifi...
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel functi...
The partial update problem for parallel abstract state machines has manifested itself in the cases o...
AbstractA datastructure instance, e.g. a set or file or record, may be modified independently by dif...
This paper proposes Update Plans as a specification formalism for abstract machines for parallel arc...
International audienceIn this article, we are interested in the exploration part of model checking w...
The verification of concurrent systems through an exhaustive traversal of the state space suffers fr...
We consider the state mapping problem for dynamic soft-ware updates and propose a number of approach...
Partial-order reduction is one of the main techniques used to tackle the combinatorial state explosi...
The trend towards multi-core computing has made concurrent software an important target of computer-...
AbstractWhen analysing a concurrent program in order to verify its correctness one faces a severe co...
We give several theorems that can be used to substantially reduce the state space that must be consi...
Abstract. Partial-Order Reduction is one of the main techniques used to tackle the combinatorial sta...
An atomic snapshot object is an object that can be concurrently accessed by asynchronous processes p...
AbstractThe sweep-line method exploits intrinsic progress in concurrent systems to alleviate the sta...
International audienceModel checking has long been used as a means of verification of formal specifi...
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel functi...
The partial update problem for parallel abstract state machines has manifested itself in the cases o...
AbstractA datastructure instance, e.g. a set or file or record, may be modified independently by dif...
This paper proposes Update Plans as a specification formalism for abstract machines for parallel arc...
International audienceIn this article, we are interested in the exploration part of model checking w...
The verification of concurrent systems through an exhaustive traversal of the state space suffers fr...
We consider the state mapping problem for dynamic soft-ware updates and propose a number of approach...
Partial-order reduction is one of the main techniques used to tackle the combinatorial state explosi...
The trend towards multi-core computing has made concurrent software an important target of computer-...
AbstractWhen analysing a concurrent program in order to verify its correctness one faces a severe co...
We give several theorems that can be used to substantially reduce the state space that must be consi...
Abstract. Partial-Order Reduction is one of the main techniques used to tackle the combinatorial sta...
An atomic snapshot object is an object that can be concurrently accessed by asynchronous processes p...
AbstractThe sweep-line method exploits intrinsic progress in concurrent systems to alleviate the sta...
International audienceModel checking has long been used as a means of verification of formal specifi...
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel functi...
DOI
Add to ORKG