Static analysis of arithmetical congruences

DOI10.1080/00207168908803778MaRDI QIDQ4729316zbMATHOpenAlexWikidataFDO

Authors Philippe Granger

Publication date 1989

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168908803778

zbMATH Keywords

optimizationinvariantsabstract interpretationoperational semanticsmechanical verificationautomatic programmingsemantic analysisautomatic vectorization

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 2087567
• Automatic Abstraction for Congruences
• Static Analysis
• Inferring Congruence Equations Using SAT
• Static analysis by abstract interpretation: a mathematical programming approach

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3315310 (Why is no real title available?)
• Automatic translation of FORTRAN programs to vector form
• Constructive versions of Tarski's fixed point theorems

Cited in

(17)

• A scalable segmented decision tree abstract domain
• A decision tree lifted domain for analyzing program families with numerical features
• Discovering invariants via simple component analysis
• Fully Bounded Polyhedral Analysis of Integers with Wrapping
• An Improved Tight Closure Algorithm for Integer Octagonal Constraints
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• Verifying numerical programs via iterative abstract testing
• Why does Astrée scale up?
• An algorithm for analyzing communicating processes
• Abstract cofibered domains: application to the alias analysis of untyped programs
• Linear absolute value relation analysis
• Transfer function synthesis without quantifier elimination
• Inferring Congruence Equations Using SAT
• Completeness of string analysis for dynamic languages
• Programming Languages and Systems
• Abstract interpretation of microcontroller code: intervals meet congruences
• The octagon abstract domain

This page was built for publication: Static analysis of arithmetical congruences

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