A minimalistic look at widening operators

DOI10.1007/s10990-009-9046-8zbMath1183.68200OpenAlexW2059573554MaRDI QIDQ848744

David Monniaux

Publication date: 5 March 2010

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-009-9046-8

zbMATH Keywords

terminationwideningabstractionabstract interpretationhigher orderCoqwell-founded treeinductive definition

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items

Mathematical programming: Turing completeness and applications to software analysis ⋮ Stratified Static Analysis Based on Variable Dependencies

Uses Software

• Coq
• ASTREE

Cites Work

• Unnamed Item
• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• Optimal Abstraction on Real-Valued Programs
• Automatic modular abstractions for linear constraints
• Abstract Interpretation Frameworks
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Computer Aided Verification
• Precise Fixpoint Computation Through Strategy Iteration
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: A minimalistic look at widening operators