Widening with Thresholds for Programs with Complex Control Graphs
From MaRDI portal
Publication:3172939
DOI10.1007/978-3-642-24372-1_38zbMATH Open1348.68040OpenAlexW143523914MaRDI QIDQ3172939FDOQ3172939
Bertrand Jeannet, Alain Girault, Lies Lakhdar-Chaouch
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_38
Recommendations
- Control structures in programs and computational complexity
- A uniform approach to control flow graphs of programs
- scientific article
- scientific article; zbMATH DE number 219232
- Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs
- A theory for control-flow graph exploration
- Bounds for Width Two Branching Programs
- A unifying theory of control dependence and its application to arbitrary program structures
- Proof-guided underapproximation-widening for multi-process systems
- Widening for Control-Flow
Cited In (6)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Widening for Control-Flow
- Learning a Strategy for Choosing Widening Thresholds from a Large Codebase
- Dissecting widening: separating termination from information
- Guided Static Analysis
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
Uses Software
This page was built for publication: Widening with Thresholds for Programs with Complex Control Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172939)
