2006/12/18 by Roberto Bagnara, Bagnara, Roberto, Patricia M. Hill +3 · 3 citations
Computer Science · #D.2.4 #Embedded Systems Design Techniques #FOS: Computer and information sciences #Formal Methods in Verification #G.4 #Logic, programming, and type systems #Mathematical Software (cs.MS) #Programming Languages (cs.PL) #cs.MS #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0612085
38 pages, 2 figures, 3 listings, 3 tables
arxiv created 2006/12/18 · openalex publication_date 2006/12/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.