Widening with Thresholds for Programs with Complex Control Graphs

DOI10.1007/978-3-642-24372-1_38zbMath1348.68040OpenAlexW143523914MaRDI QIDQ3172939

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

Mathematics Subject Classification ID

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

Related Items (3)

Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ Learning a Strategy for Choosing Widening Thresholds from a Large Codebase ⋮ Horn clause verification with convex polyhedral abstraction and tree automata-based refinement

Uses Software

• Aspic

This page was built for publication: Widening with Thresholds for Programs with Complex Control Graphs