Octagons Revisited - Elegant Proofs and Simplified Algorithms

Explore a conference talk that delves into simplified algorithms and elegant proofs for the Octagon domain in program analysis. Learn about the concept of 2-projective domains and how it enables more efficient cubic time algorithms for computing Octagon abstract relation closures over rationals and integers. Discover improved techniques for incremental normalization and best abstract transformers for affine assignments in the Octagon domain. Gain insights into the balance between precision and efficiency in weakly relational domains, and understand how these advancements contribute to the field of program analysis.

[SAS23] Octagons Revisited - Elegant Proofs and Simplified Algorithms