FramewORk for Embedded System verification

(Competition Contribution)
  • Pablo Gonzalez-de-AledoEmail author
  • Pablo Sanchez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9035)


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.


  1. 1.
    Yen, J.Y.: An algorithm for finding shortest routes from all source nodes to a given destination in general networks. The Quarterly of Applied Mathematics 27, 526–530Google Scholar
  2. 2.
    Lattner, C., Adve, V.: LLVM: A compilation framework for lifelong program analysis & transformation. In: International Symposium on Code Generation and Optimization 2004, pp. 75–86 (2004)Google Scholar
  3. 3.
    de Moura, L., Bjørner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics SSC4 4, 100–107 (1968)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.University of CantabriaSantanderSpain

Personalised recommendations