package frama-c

  1. Overview
  2. Docs
Platform dedicated to the analysis of source code written in C

Install 

dune-project
 Dependency

frama-c.com Readme Edit opam file Versions (25)

Authors

  1. M
    Michele Alberti
  2. T
    Thibaud Antignac
  3. G
    Gergö Barany
  4. P
    Patrick Baudin
  5. T
    Thibaut Benjamin
  6. A
    Allan Blanchard
  7. L
    Lionel Blatter
  8. F
    François Bobot
  9. R
    Richard Bonichon
  10. Q
    Quentin Bouillaguet
  11. D
    David Bühler
  12. Z
    Zakaria Chihani
  13. L
    Loïc Correnson
  14. J
    Julien Crétin
  15. P
    Pascal Cuoq
  16. Z
    Zaynah Dargaye
  17. B
    Basile Desloges
  18. J
    Jean-Christophe Filliâtre
  19. P
    Philippe Herrmann
  20. M
    Maxime Jacquemin
  21. F
    Florent Kirchner
  22. A
    Alexander Kogtenkov
  23. T
    Tristan Le Gall
  24. J
    Jean-Christophe Léchenet
  25. M
    Matthieu Lemerre
  26. D
    Dara Ly
  27. D
    David Maison
  28. C
    Claude Marché
  29. A
    André Maroneze
  30. T
    Thibault Martin
  31. F
    Fonenantsoa Maurica
  32. M
    Melody Méaulle
  33. B
    Benjamin Monate
  34. Y
    Yannick Moy
  35. P
    Pierre Nigron
  36. A
    Anne Pacalet
  37. V
    Valentin Perrelle
  38. G
    Guillaume Petiot
  39. D
    Dario Pinto
  40. V
    Virgile Prevosto
  41. A
    Armand Puccetti
  42. F
    Félix Ridoux
  43. V
    Virgile Robles
  44. J
    Jan Rochel
  45. M
    Muriel Roger
  46. J
    Julien Signoles
  47. N
    Nicolas Stouls
  48. K
    Kostyantyn Vorobyov
  49. B
    Boris Yakobowski

Maintainers

  1. F
    frama-ci-bot@frama-c.com

Sources

frama-c-28.0-Nickel.tar.gz
sha256=29612882330ecb6eddd0b4ca3afc0492b70d0feb3379a1b8e893194c6e173983

doc/frama-c-wp.core/Wp/LogicUsage/index.html

Module Wp.LogicUsageSource

Trims the original name

Sourcetype logic_lemma = {
  1. lem_name : string;
  2. lem_position : Frama_c_kernel.Filepath.position;
  3. lem_types : string list;
  4. lem_labels : Frama_c_kernel.Cil_types.logic_label list;
  5. lem_predicate : Frama_c_kernel.Cil_types.toplevel_predicate;
  6. lem_depends : logic_lemma list;
    (*

    in reverse order

    *)
  7. lem_attrs : Frama_c_kernel.Cil_types.attributes;
}
Sourcetype axiomatic = {
  1. ax_name : string;
  2. ax_position : Frama_c_kernel.Filepath.position;
  3. ax_property : Frama_c_kernel.Property.t;
  4. mutable ax_types : Frama_c_kernel.Cil_types.logic_type_info list;
  5. mutable ax_logics : Frama_c_kernel.Cil_types.logic_info list;
  6. mutable ax_lemmas : logic_lemma list;
  7. mutable ax_reads : Frama_c_kernel.Cil_datatype.Varinfo.Set.t;
}
Sourcetype logic_section =
  1. | Toplevel of int
  2. | Axiomatic of axiomatic
Sourceval compute : unit -> unit

To force computation

Sourceval iter_lemmas : (logic_lemma -> unit) -> unit
Sourceval fold_lemmas : (logic_lemma -> 'a -> 'a) -> 'a -> 'a
Sourceval logic_lemma : string -> logic_lemma
Sourceval axiomatic : string -> axiomatic
Sourceval section_of_lemma : string -> logic_section
Sourceval proof_context : unit -> logic_lemma list

Lemmas that are not in an axiomatic.

Given an inductive phi{...A...}. Whenever in case C{...B...} we have a call to phi{...B...}, then A belongs to (induction phi C).[B].

Sourceval dump : unit -> unit

Print on output