Apron

Apron: a library of numerical abstract domains for static analysis. This article describes Apron, a freely available library dedicated to the static analysis of the numerical variables of programs by abstract interpretation. Its goal is threefold: provide analysis implementers with ready-to-use numerical abstractions under a unified API, encourage the research in numerical abstract domains by providing a platform for integration and comparison, and provide teaching and demonstration tools to disseminate knowledge on abstract interpretation.


References in zbMATH (referenced in 67 articles )

Showing results 1 to 20 of 67.
Sorted by year (citations)

1 2 3 4 next

  1. Becchi, Anna; Zaffanella, Enea: PPLite: zero-overhead encoding of NNC polyhedra (2020)
  2. Chawdhary, Aziem; Robbins, Ed; King, Andy: Incrementally closing octagons (2019)
  3. Dimovski, Aleksandar S.; Brabrand, Claus; Wąsowski, Andrzej: Finding suitable variability abstractions for lifted analysis (2019)
  4. Howe, Jacob M.; King, Andy; Simon, Axel: Incremental closure for systems of two variables per inequality (2019)
  5. Ouadjaout, Abdelraouf; Miné, Antoine: Quantitative static analysis of communication protocols using abstract Markov chains (2019)
  6. Zolotykh, Nikolai Yu.; Bastrakov, Sergei I.: Two variations of graph test in double description method (2019)
  7. Boutonnet, Rémy; Halbwachs, Nicolas: Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (2018)
  8. Heo, Kihong; Oh, Hakjoo; Yang, Hongseok: Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses (2018)
  9. Blazy, Sandrine; Bühler, David; Yakobowski, Boris: Structuring abstract interpreters through state and value abstractions (2017)
  10. Botbol, Vincent; Chailloux, Emmanuel; Le Gall, Tristan: Static analysis of communicating processes using symbolic transducers (2017)
  11. Dan, Andrei; Meshman, Yuri; Vechev, Martin; Yahav, Eran: Effective abstractions for verification under relaxed memory models (2017)
  12. Jiang, Jiahong; Chen, Liqian; Wu, Xueguang; Wang, Ji: Block-wise abstract interpretation by combining abstract domains with SMT (2017)
  13. Liu, Jiangchao; Rival, Xavier: An array content static analysis based on non-contiguous partitions (2017)
  14. Magron, Victor; Constantinides, George; Donaldson, Alastair: Certified roundoff error bounds using semidefinite programming (2017)
  15. Maréchal, Alexandre; Monniaux, David; Périn, Michaël: Scalable minimizing-operators on polyhedra via parametric linear programming (2017)
  16. Maréchal, Alexandre; Périn, Michaël: Efficient elimination of redundancies in polyhedra by raytracing (2017)
  17. Monat, Raphaël; Miné, Antoine: Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions (2017)
  18. Singh, Gagandeep; Püschel, Markus; Vechev, Martin: Fast polyhedra abstract domain (2017)
  19. Urban, Caterina; Miné, Antoine: Inference of ranking functions for proving temporal properties by abstract interpretation (2017)
  20. Frohn, F.; Naaf, M.; Hensel, J.; Brockschmidt, M.; Giesl, J.: Lower runtime bounds for integer programs (2016)

1 2 3 4 next