Why does Astrée scale up?
From MaRDI portal
Publication:845249
DOI10.1007/S10703-009-0089-6zbMATH Open1185.68241OpenAlexW2165086189MaRDI QIDQ845249FDOQ845249
Authors: Patrick Cousot, Radhia Cousot, Laurent Mauborgne, Antoine Miné, Xavier Rival, Jerome Feret 
Publication date: 5 February 2010
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-009-0089-6
Recommendations
VerificationFormal methodsScalabilitySafetyAbstract InterpretationEmbedded critical softwareStatic analysis tool\texttt{Astrée}
Cites Work
- Title not available (Why is that?)
- Programming Languages and Systems
- The octagon abstract domain
- Graph-Based Algorithms for Boolean Function Manipulation
- Constructive versions of Tarski's fixed point theorems
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- Abstract interpretation and application to logic programs
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Fixpoint-Guided Abstraction Refinements
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Making abstract interpretations complete
- Static analysis of arithmetical congruences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming Languages and Systems
- Programming Languages and Systems
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A class of polynomially solvable range constraints for interval analysis without widenings
- Title not available (Why is that?)
- Automatically Refining Abstract Interpretations
- Optimal domains for disjunctive abstract interpretation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming Languages and Systems
- Programming Languages and Systems
- Static Analysis
Cited In (21)
- Abstract interpretation of microcontroller code: intervals meet congruences
- Programming Languages and Systems
- TreeKs: A Functor to Make Numerical Abstract Domains Scalable
- A sparse evaluation technique for detailed semantic analyses
- A tree-based approach to data flow proofs
- Enforcing termination of interprocedural analysis
- Precise interprocedural analysis in the presence of pointers to the stack
- A scalable segmented decision tree abstract domain
- Sparsity preserving algorithms for octagons
- Range and set abstraction using SAT
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT
- ASTREE
- Quadtrees as an abstract domain
- Programming Languages and Systems
- Learning a Strategy for Choosing Widening Thresholds from a Large Codebase
- Clustered relational thread-modular abstract interpretation with local traces
- Abstract semantic dependency
- On the Monniaux problem in abstract interpretation
- Incremental and Modular Context-sensitive Analysis
- Static Analysis
- Three improvements to the top-down solver
Uses Software
This page was built for publication: Why does Astrée scale up?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845249)
