Calculational Design of Correctness and Incorrectness Transformational Program Logics by Abstract Interpretation

Explore a 26-minute conference talk from POPL 2024 that delves into the calculational design of transformational program logics for correctness and incorrectness. Learn how these logics are extended to handle both termination and nontermination explicitly. Discover how the speaker, Patrick Cousot from New York University, presents these logics as abstract interpretations of the right image transformer for a relational semantics covering finite and infinite executions. Understand how this approach facilitates comparisons between logics through their respective abstractions of semantics. Gain insights into a calculational method for constructively designing sound and complete formal proof systems by abstraction of semantics. See an example of how Hoare logic is extended to cover all possible behaviors of nondeterministic programs and learn about a new precondition (in)correctness logic. Access additional resources, including the full article and supplementary web page, to deepen your understanding of this complex topic in program logic and abstract interpretation.