The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

By Roberto Bagnara, Patricia M. Hill, Enea Zaffanella. Science of Computer Programming, 2006

525 citations recorded by the source corpus.

Since its inception as a student project in 2001, initially just for the handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved and extended by joining scrupulous research on the theoretical foundations of (possibly non-convex) numerical abstractions to a total adherence to the best available practices in software development. Even though it is still not fully mature and functionally complete, the Parma Polyhedra Library already offers a combination of functionality, reliability, usability and performance that is not matched by similar, freely available libraries. In this paper, we present the main features of the current version of the library, emphasizing those that distinguish it from other similar libraries and those that are important for applications in the field of analysis and verification of hardware and software systems.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/e5088d4d4866147babd3d7709f0fad9c60a552e9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Martin T. Vechev
2. Gagandeep Singh
3. Markus Püschel
4. Antoine Miné
5. Timon Gehr

In Hardware and Architecture

1. Martin T. Vechev
2. Gagandeep Singh
3. Markus Püschel
4. Timon Gehr

Citations in the corpus

• Fast polyhedra abstract domain (2017, background): “A standard implementation of the Polyhedra domain contains more than 40 operators [2, 13].”
• Apron: A Library of Numerical Abstract Domains for Static Analysis (2009, background): “The most closely related project is the Parma Polyhedra Library [5], which shares several features with Apron in its very last version (0.10).”
• Software model checking (2009, unknown): “The polyhedral domain has been successfully used to check for array bounds checks [Cousot and Halbwachs 1978], and efficient implementations are available ( e.g., [Bagnara et al. 2008]).”
• The Deep Learning Compiler: A Comprehensive Survey (2020, background): “There are many toolchains that are borrowed by polyhedral-based compilers, such as isl [45], Omega [46], PIP [47], Polylib [48], and PPL [49].”