Verification, Model Checking, and Abstract Interpretation

DOI10.1007/11609773zbMATH Open1176.68050OpenAlexW2496613029MaRDI QIDQ5898628FDOQ5898628

Authors: Antoine Miné 

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11609773

Recommendations

• Static Analysis of Numerical Algorithms
• Static analysis of finite precision computations
• Abstract fixpoint computations with numerical acceleration methods
• Automatic modular abstractions for template numerical constraints
• scientific article; zbMATH DE number 1738295

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (23)

• Refinement to certify abstract interpretations: illustrated on linearization for polyhedra
• Title not available (Why is that?)
• A zonotopic framework for functional abstractions
• A minimalistic look at widening operators
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• Stratified static analysis based on variable dependencies
• Discovering invariants via simple component analysis
• Static analysis of finite precision computations
• A generic framework to coarse-grain stochastic reaction networks by abstract interpretation
• Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
• A note on the inversion join for polyhedral analysis
• Static contract checking with abstract interpretation
• Inferring sufficient conditions with backward polyhedral under-approximations
• View-augmented abstractions
• Inferring functional properties of matrix manipulating programs by abstract interpretation
• The two variable per inequality abstract domain
• Polynomial Precise Interval Analysis Revisited
• Why does Astrée scale up?
• Context-sensitive meta-constraint systems for explainable program analysis
• Automatic modular abstractions for template numerical constraints
• Generalizing the template polyhedral domain
• Inferring Min and Max Invariants Using Max-Plus Polyhedra
• Rigorous error analysis of numerical algorithms via symbolic computations

Uses Software

• Octagon
• ASTREE

This page was built for publication: Verification, Model Checking, and Abstract Interpretation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898628)