#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2004

2012

- This year (0)
- Last 5 years (0)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Arnaud Gotlieb, Matthieu Petit
- Journal of Systems and Software
- 2010

Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies inâ€¦ (More)

- Arnaud Gotlieb, Matthieu Petit
- Random Testing
- 2006

Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low cost, we face theâ€¦ (More)

- Arnaud Gotlieb, Matthieu Petit
- 2008 32nd Annual IEEE International Computerâ€¦
- 2008

Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. The main challenge ofâ€¦ (More)

- Henning Christiansen, Christian Theil Have, Ole Torp Lassen, Matthieu Petit
- Biology, Computation and Linguistics
- 2011

- Matthieu Petit, Arnaud. Gotlieb
- Proceedings. 2004 First International Workshop onâ€¦
- 2004

The use of a model to describe and test the expected behavior of a program is a well-proved software testing technique. Statistical structural testing aims at building a model from which an inputâ€¦ (More)

- Matthieu Petit, Arnaud Gotlieb
- Seventh International Conference on Qualityâ€¦
- 2007

Automatic structural test data generation is a real challenge of software testing. Statistical structural testing has been proposed to address this problem. This testing method aims at building anâ€¦ (More)

- Matthieu Petit, Arnaud Gotlieb
- CP
- 2007

Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent constraintâ€¦ (More)

A Hidden Markov Model (HMM) is a common statistical model which is widely used for analysis of biological sequence data and other sequential phenomena. In the present paper we show how HMMs can beâ€¦ (More)

- Henning Christiansen, Christian Theil, Ole Torp Lassen, Matthieu Petit
- 2010

The Viterbi algorithm is a classical example of a dynamic programming algorithm, in which pruning reduces the search space drastically, so that an otherwise exponential time complexity is reduced toâ€¦ (More)

Probabilistic Concurrent Constraint Programming (PCCP) extends concurrent constraint languages with a probabilistic choice operator. This operator has proved to be useful in implementing randomizedâ€¦ (More)