The Octagon Abstract Domain Library is a free library for manipulating special kinds of polyhedra called octagons that correspond to sets of constraints of the form ±x ±y ≤ c (so, in dimension two, these polyhedra have at most eight faces). This library is targeted at static analysis by abstract interpretation (look for a short introduction on abstract interpretation on my PhD. advisor page). The theoretical work behind this library was done during my DEA and PhD. Thesis The main publication is an article entitled The Octagon Abstract Domain. This library is a work in progress. It is used internally by the author, and is publicly available in the hope it can be useful to someone else, but without of any warranty. Moreover, this library is intended for academic use only. Commercial use of the library is not possible without the explicit authorization of the author.

References in zbMATH (referenced in 61 articles , 1 standard article )

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

1 2 3 4 next

  1. Bozga, Marius; Iosif, Radu; Konečný, Filip: Safety problems are NP-complete for flat integer programs with octagonal loops (2014)
  2. Jeannet, Bertrand; Schrammel, Peter; Sankaranarayanan, Sriram: Abstract acceleration of general linear loops (2014)
  3. Ko, Yoonseok; Heo, Kihong; Oh, Hakjoo: A sparse evaluation technique for detailed semantic analyses (2014)
  4. Miné, Antoine: Relational thread-modular static value analysis by abstract interpretation (2014)
  5. Urban, Caterina; Miné, Antoine: An abstract domain to infer ordinal-valued ranking functions (2014)
  6. Gange, Graeme; Søndergaard, Harald; Stuckey, Peter J.; Schachte, Peter: Solving difference constraints over modular arithmetic (2013)
  7. Pelleau, Marie; Miné, Antoine; Truchet, Charlotte; Benhamou, Frédéric: A constraint solver based on abstract domains (2013)
  8. Roux, Pierre; Garoche, Pierre-Loïc: Integrating policy iterations in abstract interpreters (2013)
  9. Amato, Gianluca; Scozzari, Francesca: Random: R-based analyzer for numerical domains (2012)
  10. Bygde, Stefan; Lisper, Björn; Holsti, Niklas: Fully bounded polyhedral analysis of integers with wrapping (2012)
  11. Chico de Guzmán, Pablo; Carro, Manuel; Hermenegildo, Manuel V.; Stuckey, Peter: A general implementation framework for tabled CLP (2012)
  12. Cousot, Patrick; Cousot, Radhia; Mauborgne, Laurent: Theories, solvers and static analysis by abstract interpretation (2012)
  13. Gawlitza, Thomas Martin; Monniaux, David: Invariant generation through strategy iteration in succinctly represented control flow graphs (2012)
  14. Ghorbal, Khalil; Ivančić, Franjo; Balakrishnan, Gogul; Maeda, Naoto; Gupta, Aarti: Donut domains: efficient non-convex domains for abstract interpretation (2012)
  15. Lu, Qi; Madsen, Michael; Milata, Martin; Ravn, Søren; Fahrenberg, Uli; Larsen, Kim G.: Reachability analysis for timed automata using max-plus algebra (2012)
  16. Fähndrich, Manuel; Logozzo, Francesco: Static contract checking with abstract interpretation (2011)
  17. Mastroeni, Isabella; Banerjee, Anindya: Modelling declassification policies using abstract domain completeness (2011)
  18. Miné, Antoine: Static analysis of run-time errors in embedded critical parallel C programs (2011)
  19. Sotin, Pascal; Jeannet, Bertrand; Védrine, Franck; Goubault, Eric: Policy iteration within logico-numerical abstract domains (2011)
  20. Bagnara, Roberto; Hill, Patricia M.; Zaffanella, Enea: Exact join detection for convex polyhedra and other numerical abstractions (2010)

1 2 3 4 next