This paper shows that it is possible to build a theoretically maximal and sound causal model for concurrent computations from a given execution trace. For an observed execution, the proposed model comprises all consistent executions which can be derived from it using only knowledge about the execution machine. The existence of such a model is of great theoretical value. First, by comprising all feasible executions, it can be used to prove soundness of other causal models: indeed, several models underlying existing techniques are shown to be embedded into the maximal model, so all these models are sound. Second, since it is maximal, the proposed model allows for natural and causal-model-independent de???nitions of trace-based properties; t...
Abstract. Predictive analysis aims at detecting concurrency errors during run-time by monitoring a c...
International audienceIn distributed systems where strong consistency is costly when not impossible,...
We propose a logic for true concurrency whose formulae predicate about events in computations and th...
This paper shows that it is possible to build a maximal and sound causal model for concurrent comp...
Extracting causal models from observed executions has proved to be an effective approach to analyze ...
We propose the first systematic concurrent program testing approach that is able to cover the entire...
ACM Classification: F.3.2 Semantics of Programming Languages D.2.4 Software/Program Verification D.2...
Abstract. We present a new model checking procedure for concurrent systems against safety properties...
Model checking is usually based on a comprehensive traversal of the state space. Causality-based mod...
Model checking is usually based on a comprehensive traversal of the state space. Causality-based mod...
Concurrent systems identify systems, either software, hardware or even biological systems, that are ...
International audienceThis paper presents a generalization of causal consistency suited to the famil...
A runtime analysis technique is presented, which can predict errors in multi-threaded systems by exa...
Abstract We present maximal causality reduction (MCR), a new technique for stateless model checking....
Causal consistency is one of the most adopted consistency criteria for distributed implementations o...
Abstract. Predictive analysis aims at detecting concurrency errors during run-time by monitoring a c...
International audienceIn distributed systems where strong consistency is costly when not impossible,...
We propose a logic for true concurrency whose formulae predicate about events in computations and th...
This paper shows that it is possible to build a maximal and sound causal model for concurrent comp...
Extracting causal models from observed executions has proved to be an effective approach to analyze ...
We propose the first systematic concurrent program testing approach that is able to cover the entire...
ACM Classification: F.3.2 Semantics of Programming Languages D.2.4 Software/Program Verification D.2...
Abstract. We present a new model checking procedure for concurrent systems against safety properties...
Model checking is usually based on a comprehensive traversal of the state space. Causality-based mod...
Model checking is usually based on a comprehensive traversal of the state space. Causality-based mod...
Concurrent systems identify systems, either software, hardware or even biological systems, that are ...
International audienceThis paper presents a generalization of causal consistency suited to the famil...
A runtime analysis technique is presented, which can predict errors in multi-threaded systems by exa...
Abstract We present maximal causality reduction (MCR), a new technique for stateless model checking....
Causal consistency is one of the most adopted consistency criteria for distributed implementations o...
Abstract. Predictive analysis aims at detecting concurrency errors during run-time by monitoring a c...
International audienceIn distributed systems where strong consistency is costly when not impossible,...
We propose a logic for true concurrency whose formulae predicate about events in computations and th...