A galois connection calculus for abstract interpretation

DOI10.1145/2535838.2537850zbMath1284.68173OpenAlexW2015368796MaRDI QIDQ5408396

Patrick Cousot, Radhia Cousot

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2535838.2537850

zbMATH Keywords

verificationGalois connectionstatic analysisabstract interpretation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (3)

Property preserving abstractions for the verification of concurrent systems ⋮ Constructive Galois Connections ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.

Uses Software

• ASTREE
• FunArray

This page was built for publication: A galois connection calculus for abstract interpretation