Decision problems in program analysis

Abstract: We consider decision problems for affine programs: a simple model from the field of program analysis. In this talk we focus on deciding the existence of algebraic and semi-algebraic invariants that separate reachable from non-reachable program states, and on deciding termination. We will survey some recently obtained decision procedures for these problems, and highlight some longstanding open questions.

logic in computer sciencelogic

Audience: researchers in the topic

Online logic seminar

Series comments: Description: Seminar on all areas of logic