Project Details

Automates et Logique pour la vérification symbolique de logiciels

Project Period: 1. 1. 2010 - 31. 12. 2011

Project Type: grant

Code: MEB021023

Agency: Barrande - Czech-French programme of integrated actions

Program: KONTAKT

Type
grant
Keywords

formal verification, infinite-state systems, symbolic representations, automata, logics

Abstract

Among techniques which can be used for verification of infinite-state systems, one can find approaches based on cut-offs, automated induction, or symbolic verification, which is probably the most frequent and which is also the subject of the proposed project. Symbolic verification is based on encoding infinite sets of states of the examined systems (possibly after some abstraction) in a finite way using some suitable formalism. Probably the most commonly used symbolic representations are those built on logics and automata.

The scientific goal of the proposed project is to significantly advance the state of the art in the area of symbolic logic-based and automata-based verification methods for infinite-state software, namely to increase the scalability of these approaches and to broaden the area of their applicability. To achieve this goal we plan to further improve the various individual logic-based as well as automata-based techniques, but also invest a significant amount of research into approaches combining advantages of both automata as well as logics. In the research, we will in particular concentrate on verification of programs with unbounded integers, (parametrised-size) arrays, and complex dynamic linked data structures.

Team members
Rogalewicz Adam, doc. Mgr., Ph.D. (UITS FIT VUT) , research leader
Iosif Radu (VERIMAG) , team leader
Bozga Marius (VERIMAG)
Habermehl Peter (UPAR7)
Konečný Filip, Ing. (UITS FIT VUT)
Šimáček Jiří, Ing., Ph.D. (UITS FIT VUT)
Vojnar Tomáš, prof. Ing., Ph.D. (UITS FIT VUT)
Publications

2012

  • BOUAJJANI Ahmed, HABERMEHL Peter, ROGALEWICZ Adam and VOJNAR Tomáš. Abstract Regular (Tree) Model Checking. International Journal on Software Tools for Technology Transfer, vol. 14, no. 2, 2012, pp. 167-191. ISSN 1433-2779. Detail

2011

  • HABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří and VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. Lecture Notes in Computer Science, vol. 2011, no. 6806, pp. 424-440. ISSN 0302-9743. Detail
  • HABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří and VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. FIT-TR-2011-01, Brno: Faculty of Information Technology BUT, 2011. Detail

2010

  • BOZGA Marius, IOSIF Radu and KONEČNÝ Filip. Fast Acceleration of Ultimately Periodic Relations. In: Computer Aided Verification. Lecture Notes in Computer Science, vol. 6174. Berlin: Springer Verlag, 2010, pp. 227-242. ISBN 978-3-642-14294-9. Detail
Products

2010

  • Forester: A Tool for Verification of Programs with Pointers, software, 2010
    Authors: Habermehl Peter, Holík Lukáš, Rogalewicz Adam, Šimáček Jiří, Vojnar Tomáš Detail
Back to top