Static analysis tools for capturing bugs and vulnerabilities in software programs are widely
employed in practice, as they have the unique advantages of high coverage and …

Program logics for bug-finding (such as the recently introduced Incorrectness Logic) have
framed correctness and incorrectness as dual concepts requiring different logical …

Machine learning and its promising branch deep learning have proven to be effective in a
wide range of application domains. Recently, several efforts have shown success in …

Abstract interpretation is a well-known and extensively used method to extract over-
approximate program invariants by a sound program analysis algorithm. Soundness means …

Hoare logics are proof systems that allow one to formally establish properties of computer
programs. Traditional Hoare logics prove properties of individual program executions (such …

Model checking has been used traditionally for finding violations of temporal properties.
Recently, testing or fuzzing approaches have also been applied to software systems to find …

Program termination is a classic non-safety property whose falsification cannot in general be
witnessed by a finite trace. This makes testing for non-termination challenging, and also a …

Hyperproperties relate multiple executions of a program and are useful to express common
correctness properties (such as determinism) and security properties (such as non …

Over-approximating (OX) program logics, such as separation logic (SL), are used for
verifying properties of heap-manipulating programs: all terminating behaviour is …

We study transformational program logics for correctness and incorrectness that we extend
to explicitly handle both termination and nontermination. We show that the logics are …