International audienceDesigning and developing distributed and concurrent applications has always been a tedious and error-prone task. In this context, formal techniques and tools are of great help in order to specify such concurrent systems and detect bugs in the corresponding models. In this paper, we propose a new framework for debugging value-passing process algebra through coverage analysis. We illustrate our approach with LNT, which is a recent specification language designed for formally modelling concurrent systems. We define several coverage notions before showing how to instrument the specification without affecting original behaviors. Our approach helps one to improve the quality of a dataset of examples used for validation purpo...
PhD ThesisWhile specification formalisms for reactive concurrent systems are now reasonably well-un...
The proponent extends Process Algebra (PA) in terms of its components and how it is constructed. Thi...
AbstractRecent research has been conducted on representing Process Algebra programs by safe Petri ne...
International audienceDesigning and developing distributed and concurrent applications has always be...
International audienceFormal methods can verify the correctness of a concurrentsystem by analyzing i...
International audienceModel checking is an established technique for automatically verifying that a ...
Concurrent software executes multiple threads or processes to achieve high performance. However, con...
International audienceFormal process languages inheriting the concurrency and communication features...
Model checking is an automatic formal verification technique for establishing correctness of systems...
Concurrent software executes multiple threads or processes to achieve high performance. However, con...
The pervasiveness of computer systems in virtually every aspect of daily life entails a growing depe...
We propose a description language, Data Path Expressions (DPEs), for modeling the behavior of parall...
International audienceFormal process languages inheriting the concurrency and communication features...
International audienceDesigning and developing distributed software has always been a tedious and er...
Concurrent software systems are more difficult to design and analyze than sequential systems. Consid...
PhD ThesisWhile specification formalisms for reactive concurrent systems are now reasonably well-un...
The proponent extends Process Algebra (PA) in terms of its components and how it is constructed. Thi...
AbstractRecent research has been conducted on representing Process Algebra programs by safe Petri ne...
International audienceDesigning and developing distributed and concurrent applications has always be...
International audienceFormal methods can verify the correctness of a concurrentsystem by analyzing i...
International audienceModel checking is an established technique for automatically verifying that a ...
Concurrent software executes multiple threads or processes to achieve high performance. However, con...
International audienceFormal process languages inheriting the concurrency and communication features...
Model checking is an automatic formal verification technique for establishing correctness of systems...
Concurrent software executes multiple threads or processes to achieve high performance. However, con...
The pervasiveness of computer systems in virtually every aspect of daily life entails a growing depe...
We propose a description language, Data Path Expressions (DPEs), for modeling the behavior of parall...
International audienceFormal process languages inheriting the concurrency and communication features...
International audienceDesigning and developing distributed software has always been a tedious and er...
Concurrent software systems are more difficult to design and analyze than sequential systems. Consid...
PhD ThesisWhile specification formalisms for reactive concurrent systems are now reasonably well-un...
The proponent extends Process Algebra (PA) in terms of its components and how it is constructed. Thi...
AbstractRecent research has been conducted on representing Process Algebra programs by safe Petri ne...