Publication | Closed Access
Fast polyhedra abstract domain
84
Citations
14
References
2016
Year
Unknown Venue
EngineeringComputational ComplexityComputer-aided DesignSoftware AnalysisFormal VerificationComputational TopologyPolyhedra DomainNumerical Abstract DomainsStatic CheckingComputational GeometryGeometric ModelingRuntime VerificationAbstract InterpretationComputer EngineeringComputer ScienceOptimizing CompilerStatic Program AnalysisGeometric AlgorithmDomain TheoryProgram AnalysisNatural SciencesFormal MethodsParallel ProgrammingBuffer Overflow
Numerical abstract domains are an important ingredient of modern static analyzers used for verifying critical program properties (e.g., absence of buffer overflow or memory safety). Among the many numerical domains introduced over the years, Polyhedra is the most expressive one, but also the most expensive: it has worst-case exponential space and time complexity. As a consequence, static analysis with the Polyhedra domain is thought to be impractical when applied to large scale, real world programs.
| Year | Citations | |
|---|---|---|
Page 1
Page 1