Constraint modelling and solving of some verification problems

Abstract : Constraint programming offers efficient languages andtools for solving combinatorial and computationally hard problems such as the ones proposed in program verification. In this thesis, we tackle two families of program verification problems using constraint programming.In both contexts, we first propose a formal evaluation of our contributions before realizing some experiments.The first contribution is about a synchronous reactive language, represented by a block-diagram algebra. Such programs operate on infinite streams and model real-time processes. We propose a constraint model together with a new global constraint. Our new filtering algorithm is inspired from Abstract Interpretation. It computes over-approximations of the infinite stream values computed by the block-diagrams. We evaluated our verification process on the FAUST language (a language for processing real-time audio streams) and we tested it on examples from the FAUST standard library. The second contribution considers probabilistic processes represented by Parametric Interval Markov Chains, a specification formalism that extends Markov Chains. We propose constraint models for checking qualitative and quantitative reachability properties. Our models for the qualitative case improve the state of the art models, while for the quantitative case our models are the first ones. We implemented and evaluated our verification constraint models as mixed integer linear programs and satisfiability modulo theory programs. Experiments have been realized on a PRISM based benchmark.
Document type :
Theses
Liste complète des métadonnées

Cited literature [113 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01743851
Contributor : Abes Star <>
Submitted on : Monday, March 26, 2018 - 5:13:47 PM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM
Document(s) archivé(s) le : Thursday, September 13, 2018 - 9:23:00 AM

File

2017IMTA0031_BartAnicet.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01743851, version 1

Citation

Anicet Bart. Constraint modelling and solving of some verification problems. Programming Languages [cs.PL]. Ecole nationale supérieure Mines-Télécom Atlantique, 2017. English. ⟨NNT : 2017IMTA0031⟩. ⟨tel-01743851⟩

Share

Metrics

Record views

237

Files downloads

220