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.


2018MINA: A Tool for Verification of Programs with an Unbounded Number of Threads, software, 2018
Authors: Holík Lukáš, Turoňová Lenka, Vojnar Tomáš
 Ranger: A Tool for Bounds Analysis of Heap-Manipulating Programs, software, 2018
Authors: Fiedor Tomáš, Holík Lukáš, Rogalewicz Adam, Sinn Moritz, Vojnar Tomáš, Zuleger Florian
 Sloth: An SMT Solver for String Constraints, software, 2018
Authors: Holík Lukáš, Janků Petr, Lin Anthony W., Rummer Philipp, Vojnar Tomáš


2018FIEDOR Jan, MUŽIKOVSKÁ Monika, SMRČKA Aleš, VAŠÍČEK Ondřej and VOJNAR Tomáš. Advances in the ANaConDA Framework for Dynamic Analysis and Testing of Concurrent C/C++ Programs. In: Proceedings of 27th ACM SIGSOFT International Symposium on Software Testing and Analysis. New York: Association for Computing Machinery, 2018, pp. 356-359. ISBN 978-1-4503-5699-2.
 FIEDOR Tomáš, HOLÍK Lukáš, ROGALEWICZ Adam, SINN Moritz, VOJNAR Tomáš and ZULEGER Florian. From Shapes to Amortized Complexity. In: Proceedings of VMCAI'18. Heidelberg: Springer Verlag, 2018, pp. 205-225. ISBN 978-3-319-73720-1. ISSN 0302-9743.
 HEIZMANN Matthias, CHEN Yu-Fang, LENGÁL Ondřej, LI Yong, TSAI Ming-Hsien, TURRINI Andrea and ZHANG Lijun. Advanced Automata-based Algorithms for Program Termination Checking. In: Proceedings of PLDI'18. Philadelphia: Association for Computing Machinery, 2018, pp. 135-150. ISBN 978-1-4503-5698-5.
 KŘENA Bohuslav, PLUHÁČKOVÁ Hana, UR Shmuel and VOJNAR Tomáš. Prediction of Coverage of Expensive Concurrency Metrics Using Cheaper Metrics. In: Computer Aided Systems Theory - EUROCAST 2017. Las Palmas: Springer International Publishing, 2018, pp. 99-108. ISBN 978-3-319-74726-2.
2017AVROS Renata, DUDKA Vendula, KŘENA Bohuslav, LETKO Zdeněk, PLUHÁČKOVÁ Hana, UR Shmuel, VOJNAR Tomáš and VOLKOVICH Zeev. Boosted Decision Trees for Behaviour Mining of Concurrent Programs. Concurrency and Computation: Practice and Experience. New York: WILEY, 2017, vol. 29, no. 21, pp. 4268-4289. ISSN 1532-0634.
 DIAS Ricardo J., FERREIRA Carla, FIEDOR Jan, LOURENCO Joao, SMRČKA Aleš, SOUSA Diogo J. 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.
 ENEA 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. ISBN 978-3-319-57287-1.
 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. 421-438. 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. Reykjavik: IEEE Computer Society, 2017, pp. 1-12. ISBN 978-1-5090-3018-7.
 CHEN Yu-Fang, LENGÁL Ondřej, TAN Tony and WU Zhilin. Register Automata with Linear Arithmetic. arXiv:1704.03972, 2017.
 KOZÁK David, KŘENA Bohuslav, PLUHÁČKOVÁ Hana and VOJNAR Tomáš. Search-Based Testing Concurrent Java Programs Using the RoadRunner Analysis Framework [poster]. The proceedings of the 12th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Telč, 2017.

Your IPv4 address:
Switch to IPv6 connection

DNSSEC [dnssec]