Static analysis of linear congruence equalities among variables of a program
From MaRDI portal
Cited in
(11)- Class invariants as abstract interpretation of trace semantics
- Abstract interpretation of mobile systems
- Completeness of string analysis for dynamic languages
- Widening and narrowing operators for abstract interpretation
- Abstract interpretation of microcontroller code: intervals meet congruences
- Donut domains: efficient non-convex domains for abstract interpretation
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Abstract cofibered domains: application to the alias analysis of untyped programs
- Fully Bounded Polyhedral Analysis of Integers with Wrapping
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
This page was built for publication: Static analysis of linear congruence equalities among variables of a program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736342)