Static analysis of arithmetical congruences

DOI10.1080/00207168908803778zbMATH Open0679.68022OpenAlexW1997456729WikidataQ55970406 ScholiaQ55970406MaRDI QIDQ4729316FDOQ4729316

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)

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

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)