Skip to content

Trusted assumptions and challenges #755

Open

Description

@nickgian

I've tried to tackle some of the proposed challenges with a deductive verifier (Verus), following the VeriFast approach. While feasible, the problem is that in practice it's impossible to meet the requirements of challenges that impose a rather small TCB compared to what tools like Verus has. For example challenge 21 allows us to assume correctness of the slice module, but doesn't mention the rest of standard library, which is trusted for tools that implement compositional verification like Verus and Verifast; we would need facts about Strings, integer comparisons, iterations, strings.

I would like some guidance/thoughts from the challenge creators:

  1. Accept the extra assumptions around other std-lib components for tools that perform compositional verification (e.g., if you are verifying Pattern you can assume String).
  2. Re-think whether we need different challenges for these tools, such as verifying the simpler stdlib modules.

Activity

  1. added
    QuestionUse for any clarification or general question about the contest
    on Nov 12, 2026
  2. changed the title [-]Tool TCB's and challenges[/-] [+]Trusted assumptions and challenges[/+] on Nov 12, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    QuestionUse for any clarification or general question about the contest

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions