Deciding Asynchronous Hyperproperties for Recursive Programs

Explore a groundbreaking video presentation from POPL 2024 that introduces a novel logic for asynchronous hyperproperties with enhanced expressiveness. Delve into the intricacies of model checking for both finite state and pushdown models, and discover how this approach pioneers hyperproperty verification for recursive programs. Learn about the new mechanism for identifying relevant trace positions and understand its implications for temporal logic, automata theory, and model checking. Gain insights from researchers at the University of Münster as they present their findings on deciding asynchronous hyperproperties, offering a significant advancement in the field of program verification and analysis.

[POPL'24] Deciding Asynchronous Hyperproperties for Recursive Programs