@inproceedings{a3329e91d073415194151f89895b01e4,
title = "FramewORk for embedded system verification: (competition contribution)",
abstract = "Forest is a bounded model checker that implements symbolic execution on top of the LLVM intermediate language and is able to detect errors in programs developed in C. Forest transforms a program into a set of SMT formulas describing each feasible path and decides these formulas with an SMT solver. This enables it to prove the satisfiability of reachability conditions such as the ones presented in SV-COMP. Forest implements different ways of representing SMT formulas: linear arithmetic, polynomials and generic bit-accurate and not bit-accurate representations.",
author = "Pablo Gonzalez-De-Aledo and Pablo Sanchez",
year = "2015",
doi = "10.1007/978-3-662-46681-0_36",
language = "English",
volume = "9035",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "429--431",
editor = "Christel Baier and Cesare Tinelli",
booktitle = "Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, Proceedings",
address = "United States",
note = "21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015 ; Conference date: 11-04-2015 Through 18-04-2015",
}