In recent years they have been numerous works that aim to automate relational verification. Meanwhile, although Constrained Horn Clauses (CHCs CHCs) empower a wide range of …
Establishing quantitative bounds on the execution cost of programs is essential in many areas of computer science such as complexity analysis, compiler optimizations, security and …
M Eilers, P Müller, S Hitz - ACM Transactions on Programming …, 2019 - dl.acm.org
Many interesting program properties like determinism or information flow security are hyperproperties, that is, they relate multiple executions of the same program …
T Dardinier, P Müller - Proceedings of the ACM on Programming …, 2024 - dl.acm.org
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 ReLoC: a logic for proving refinements of programs in a language with higher- order state, fine-grained concurrency, polymorphism and recursive types. The core of our …
Hypersafety properties of arity n are program properties that relate n traces of a program (or, more generally, traces of n programs). Classic examples include determinism, idempotence …
K Maillard, C Hriţcu, E Rivas… - Proceedings of the ACM on …, 2019 - dl.acm.org
We propose the first framework for defining relational program logics for arbitrary monadic effects. The framework is embedded within a relational dependent type theory and is highly …