package goblint

Build not yet checked
  1. Overview
  2. Docs
Static analysis framework for C

Install

dune-project
 Dependency

Authors

Maintainers

Sources

goblint-2.9.0.tbz
sha256=882f25e68cc14d42879ab4775fb2cf99aaac7e3cc70d58fa632b7edef304a731
sha512=dc90f0a685709688bbc13c80d0e2b01bf87cf2bbdc7f0c22632227ae32bee9377f3f1cb50f00cf564d6f1313c27fba5d811c53bb17a24972ab5aa570bf62278b

doc/goblint.lib/Goblint_lib/LoopfreeCallstring/index.html

Module Goblint_lib.LoopfreeCallstring

Loopfree Callstring analysis loopfree_callstring that reduces the call string length of the classical Call String approach for recursions The idea is to improve the Call String analysis by representing all detected call cycle of the call string in a set In case no call cycles appears, the call string is identical to the call string of the Call String approach For example:

  • call string main, a, b, c, a is represented as main, {a, b, c}
  • call string main, a, a, b, b, b is represented as main, {a}, {b}

This approach is inspired by

  • see https://arxiv.org/abs/2301.06439

    Schwarz, M., Saan, S., Seidl, H., Erhard, J., Vojdani, V. Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. Appendix F.