Recent years have seen great advances towards verifying large-scale systems code.
However, these verifications are usually based on hand-written assembly or machine-code …

Matching logic is a logic for specifying and reasoning about structure by means of patterns
and pattern matching. This paper makes two contributions. First, it proposes a sound and …

Speculative execution attacks, such as Spectre, reuse code from the victim's binary to
access and leak secret information during speculative execution. Every variant of the attack …

Validating the correctness of binary lifters is pivotal to gain trust in binary analysis, especially
when used in scenarios where correctness is important. Existing approaches focus on …

We pursue the vision of an ideal language framework, where programming language
designers only need to define the formal syntax and semantics of their languages, and all …

Complex safety-critical systems require multiple models for a comprehensive description,
resulting in error-prone development and laborious verification. Bidirectional transformation …

Recent attacks have demonstrated that modern microarchitectures are fraught with
microarchitectural side channels. Constant-time (CT) programming is a software …

We propose a novel definition of binders using matching logic, where the binding behavior
of object-level binders is directly inherited from the built-in exists binder of matching logic …

This paper concerns the scalability challenges of symbolic abstraction: given a formula ϕ in
a logic L and an abstract domain A, find a most precise element in the abstract domain that …

Previous work on rewriting and reachability logic establishes a vision for a language-
agnostic program verifier, which takes three inputs: a program, its formal specification, and …