Anicet Bart
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Anicet Bart has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Charlotte Truchet
Univ Nantes, UMR 6004, LS2N, Nantes, France
2 shared publications- Benoît Delahaye
Nantes Université, Centrale Nantes, CNRS, LS2N UMR CNRS 6004
1 shared publication - Charlotte Truchet
Sorbonne Université, STMS UMR 9912
1 shared publication - Didier Lime
École Centrale de Nantes
1 shared publication Eric Monfroy
Université de Nantes
1 shared publication- Eric Monfroy
LERIA, Université d’Angers
1 shared publication
Latest Publications
- 1 November 2018
- Published by Elsevier in Theoretical Computer Science
- Vol. 747, 48-74
Reachability in parametric Interval Markov Chains using constraints
- 1 November 2018
- Published by Elsevier in Theoretical Computer Science
- Vol. 747, 48-74
Reachability in parametric Interval Markov Chains using constraints
- 31 May 2017
- Published by Springer Nature in Constraints
- Vol. 22 (3) , 463-490
A global constraint for over-approximation of real-time streams
- 31 May 2017
- Published by Springer Nature in Constraints
- Vol. 22 (3) , 463-490
A global constraint for over-approximation of real-time streams
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10823409,p. 844-851
Verifying a Real-Time Language with Constraints
Formal verification of real time programs, where variables can be assigned different values at every single time, is difficult due to the analyses of loops with time lags. In this paper, we consider a problem arising from verification of real-time languages: checking of the range of stream variables. We propose a constraint model for this problem, and an algorithm, combining constraint propagation and an ad hoc solving method, for solving it. We apply our method to the FAUST language, a language for processing audio streams. Experiments show that our approach provides very good results in short times.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10823409,p. 844-851
Verifying a Real-Time Language with Constraints
Formal verification of real time programs, where variables can be assigned different values at every single time, is difficult due to the analyses of loops with time lags. In this paper, we consider a problem arising from verification of real-time languages: checking of the range of stream variables. We propose a constraint model for this problem, and an algorithm, combining constraint propagation and an ad hoc solving method, for solving it. We apply our method to the FAUST language, a language for processing audio streams. Experiments show that our approach provides very good results in short times.