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

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

Programs increasingly rely on randomization in applications such as cryptography and
machine learning. Analyzing randomized programs has been a fruitful research direction …

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

Arrays are a fundamental abstraction to represent collections of data. It is often possible to
exploit structural properties of the data stored in an array (eg, repetition or sparsity) to …

Starting with Hoare Logic over 50 years ago, numerous sound and relatively complete
program logics have been devised to reason about the diverse programs encountered in the …

Temporal logics for hyperproperties have recently emerged as an expressive specification
technique for relational properties of reactive systems. While the model checking problem for …

The seminal work of Floyd [1967a] and Hoare [1969] on program logics in the 1960s has
paved the way towards modern program analysis. The resulting Hoare Logic—still …

While there is a long tradition of reasoning about termination (and nontermination) in the
context of program analysis, specialized logics are typically needed to give different …

Separation logic's compositionality and local reasoning properties have led to significant
advances in scalable static analysis. But program analysis has new challenges—many …