ROBUST - veRificatiOn and Bug hUnting for advanced SofTware

Czech title:ROBUST - Verifikace a hledání chyb v pokročilém softwaru
Reseach leader:Vojnar Tomáš
Team leaders:Kofroň Jan (MFF UK)
Team members:Holík Lukáš, Křena Bohuslav, Malásková Věra, Peringer Petr, Rogalewicz Adam, Smrčka Aleš
Agency:Czech Science Foundation
Keywords:formal verification; static analysis; symbolic verification; automated abstraction; dynamic analysis and testing; noise injection; model-based testing; automata; logics; pointer programs; concurrent programs; container programs;
Automated software verification and bug hunting are a hot topic in both industry and academia. Indeed, they can save a lot of money and, in case of safety-critical software, even human lives. This project aims at new automated methods of static formal verification (based on approaches like symbolic verification or automated abstraction) as well as extrapolating dynamic analysis and advanced testing of programs that use several classes of advanced programming constructions. In particular, the project concentrates on pointer programs, concurrent programs (including cloud programs), and container programs. While these areas are to some degree independent, there is also a lot of overlap among them: On one hand, one needs to consider various combinations of the mentioned constructions (e.g., concurrent pointer programs). On the other hand, one needs to solve similar problems for all of them. An important example of the latter considered in the project is dealing with open programs, i.e., program fragments that the programmers need to verify despite their environment is unknown.


2017ENEA Constantin, LENGÁL Ondřej, SIGHIREANU Mihaela and VOJNAR Tomáš. SPEN: A Solver for Separation Logic. In: Proceedings of NFM'17. Heidelberg: Springer Verlag, 2017, pp. 302-309. ISSN 0302-9743.
 FIEDOR Jan, LOURENCO Joao, SMRČKA Aleš and VOJNAR Tomáš. Verifying Concurrent Programs Using Contracts. In: 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST). Tokyo: Institute of Electrical and Electronics Engineers, 2017, pp. 196-206. ISBN 978-1-5090-6032-0.
 HONG Chih-Duo, CHEN Yu-Fang, LENGÁL Ondřej, MU Shin-Cheng, SINHA Nishant and WANG Bow-Yaw. An Executable Sequential Specification for Spark Aggregation. In: Proceedings of NETYS'17. Heidelberg: Springer Verlag, 2017, pp. 1-15. ISSN 0302-9743.
 HRUŠKA Martin, HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří and VOJNAR Tomáš. Forester: From Heap Shapes to Automata Predicates. In: Proceedings of TACAS'17. Heidelberg: Springer Verlag, 2017, pp. 365-369. ISBN 978-3-662-54580-5.
 CHEN Yu-Fang, LENGÁL Ondřej, TAN Tony and WU Zhilin. Register Automata with Linear Arithmetic. In: Proceedings of LICS'17. XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX, 2017, pp. 1-12.
 CHEN Yu-Fang, LENGÁL Ondřej, TAN Tony and WU Zhilin. Register Automata with Linear Arithmetic. arXiv:1704.03972, 2017.

Your IPv4 address:
Switch to IPv6 connection

DNSSEC [dnssec]