package goblint
Static analysis framework for C
Install
Dune Dependency
Authors
Maintainers
Sources
goblint-2.4.0.tbz
sha256=99b78e6def71534d195eef9084baa26d8334b36084e120aa6afb300c9bf8afa6
sha512=f3162bd95a03c00358a2991f6152fc6169205bfb4c55e2c483e98cc3935673df9656d025b6f1ea0fa5f1bd0aee037d4f483966b0d2907e3fa9bf11a93a3392af
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 asmain, {a, b, c}
- call string
main, a, a, b, b, b
is represented asmain, {a}, {b}
This approach is inspired by
module Spec : Analyses.MCPSpec
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>