Specification and verification of quantitative properties : expressions, logics, and automata

Abstract : Automatic verification has nowadays become a central domain of investigation in computer science. Over 25 years, a rich theory has been developed leading to numerous tools, both in academics and industry, allowing the verification of Boolean properties - those that can be either true or false. Current needs evolve to a finer analysis, a more quantitative one. Extension of verification techniques to quantitative domains has begun 15 years ago with probabilistic systems. However, many other quantitative properties are of interest, such as the lifespan of an equipment, energy consumption of an application, the reliability of a program, or the number of results matching a database query. Expressing these properties requires new specification languages, as well as algorithms checking these properties over a given structure. This thesis aims at investigating several formalisms, equipped with weights, able to specify such properties: denotational ones - like regular expressions, first-order logic with transitive closure, or temporal logics - or more operational ones, like navigating automata, possibly extended with pebbles. A first objective of this thesis is to study expressiveness results comparing these formalisms. In particular, we give efficient translations from denotational formalisms to the operational one. These objects, and the associated results, are presented in a unified framework of graph structures. This permits to handle finite words and trees, nested words, pictures or Mazurkiewicz traces, as special cases. Therefore, possible applications are the verification of quantitative properties of traces of programs (possibly recursive, or concurrent), querying of XML documents (modeling databases for example), or natural language processing. Second, we tackle some of the algorithmic questions that naturally arise in this context, like evaluation, satisfiability and model checking. In particular, we study some decidability and complexity results of these problems depending on the underlying semiring and the structures under consideration (words, trees...). Finally, we consider some interesting restrictions of the previous formalisms. Some permit to extend the class of semirings on which we may specify quantitative properties. Another is dedicated to the special case of probabilistic specifications: in particular, we study syntactic fragments of our generic specification formalisms generating only probabilistic behaviors.
Document type :
Theses
Complete list of metadatas

Cited literature [112 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00957763
Contributor : Abes Star <>
Submitted on : Tuesday, March 11, 2014 - 9:09:45 AM
Last modification on : Thursday, January 11, 2018 - 6:20:13 AM
Long-term archiving on : Wednesday, June 11, 2014 - 10:55:47 AM

File

Monmege2013.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00957763, version 1

Collections

Citation

Benjamin Monmege. Specification and verification of quantitative properties : expressions, logics, and automata. Other [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2013. English. ⟨NNT : 2013DENS0039⟩. ⟨tel-00957763⟩

Share

Metrics

Record views

432

Files downloads

448