Splitting the Control Flow with Boolean Flags
From MaRDI portal
Recommendations
Cites work
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Analyzing string buffers in C
- Computing Two-Dimensional Integer Hulls
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1744961 (Why is no real title available?)
- Not necessarily closed convex polyhedra and the double description method
- Programming Languages and Systems
- Programming Languages and Systems
- Static Analysis
- Systematic design of program transformation frameworks by abstract interpretation
- Taming the Wrapping of Integer Arithmetic
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- The octagon abstract domain
- Theory and practice of constraint handling rules
- Two variables per linear inequality as an abstract domain
- Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
Cited in
(4)
This page was built for publication: Splitting the Control Flow with Boolean Flags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522080)