Widening with Thresholds for Programs with Complex Control Graphs

DOI10.1007/978-3-642-24372-1_38MaRDI QIDQ3172939zbMATH OpenOpenAlexFDO

Authors Lies Lakhdar-Chaouch, Bertrand Jeannet, Alain Girault

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Control structures in programs and computational complexity
• A uniform approach to control flow graphs of programs
• scientific article; zbMATH DE number 4085715
• 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

(9)

• Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
• Widening Polyhedra with Landmarks
• Widening for Control-Flow
• Convex invariant refinement by control node splitting: a heuristic approach
• Learning a Strategy for Choosing Widening Thresholds from a Large Codebase
• Dissecting widening: separating termination from information
• Automatically Refining Abstract Interpretations
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
• Guided Static Analysis

Describes a project that uses

Uses Software

• Aspic

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)