A Scalable Segmented Decision Tree Abstract Domain

DOI10.1007/978-3-642-13754-9_5zbMath1288.68040OpenAlexW1518995377MaRDI QIDQ3587252

Laurent Mauborgne, Radhia Cousot, Patrick Cousot

Publication date: 7 September 2010

Published in: Time for Verification (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00543632/file/segmentation.pdf

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Finding suitable variability abstractions for lifted analysis ⋮ String abstract domains and their combination ⋮ Access-Based Localization for Octagons ⋮ Unnamed Item ⋮ A decision tree lifted domain for analyzing program families with numerical features ⋮ Range and Set Abstraction using SAT ⋮ Quadtrees as an Abstract Domain

Uses Software

• ASTREE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The octagon abstract domain
• Abstract interpretation using typed decision graphs
• A lattice-theoretical fixpoint theorem and its applications
• Graph-Based Algorithms for Boolean Function Manipulation
• Abstract interpretation and application to logic programs
• Static analysis of arithmetical congruences
• Systematic design of program transformation frameworks by abstract interpretation
• Abstract Interpretation Frameworks
• Verification: Theory and Practice
• Programming Languages and Systems
• A parametric segmentation functor for fully automatic and scalable array content analysis

This page was built for publication: A Scalable Segmented Decision Tree Abstract Domain