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

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 …

We present a novel weakest pre calculus for reasoning about quantitative hyperproperties
over nondeterministic and probabilistic programs. Whereas existing calculi allow reasoning …

Imprecision is inherent in any decidable (sound) approximation of undecidable program
properties. In abstract interpretation this corresponds to the release of false alarms, eg, when …

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 …

Variants of Kleene algebra have been used to provide foundations of reasoning about
programs, for instance by representing Hoare Logic (HL) in algebra. That work has generally …

Abstract interpretation is a sound-by-construction method for program verification: any
erroneous program will raise some alarm. However, the verification of correct programs may …

We present a novel strongest-postcondition-style calculus for quantitative reasoning about
non-deterministic programs with loops. Whereas existing quantitative weakest pre allows …