Static analysis of arithmetical congruences

DOI10.1080/00207168908803778zbMath0679.68022OpenAlexW1997456729WikidataQ55970406 ScholiaQ55970406MaRDI QIDQ4729316

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

optimizationinvariantsoperational semanticsabstract interpretationsemantic analysismechanical verificationautomatic programmingautomatic vectorization

Mathematics Subject Classification ID

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

Related Items

Why does Astrée scale up? ⋮ The octagon abstract domain ⋮ An algorithm for analyzing communicating processes ⋮ Inferring Congruence Equations Using SAT ⋮ Discovering invariants via simple component analysis ⋮ Abstract interpretation of microcontroller code: intervals meet congruences ⋮ Linear Absolute Value Relation Analysis ⋮ Fully Bounded Polyhedral Analysis of Integers with Wrapping ⋮ A Scalable Segmented Decision Tree Abstract Domain ⋮ An Improved Tight Closure Algorithm for Integer Octagonal Constraints ⋮ Transfer Function Synthesis without Quantifier Elimination ⋮ A decision tree lifted domain for analyzing program families with numerical features ⋮ Completeness of string analysis for dynamic languages ⋮ Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships ⋮ Abstract cofibered domains: Application to the alias analysis of untyped programs

Cites Work

• Constructive versions of Tarski's fixed point theorems
• Automatic translation of FORTRAN programs to vector form
• Unnamed Item
• Unnamed Item