Metadata
Technology & Computer Science Graduate Create Hard
Metadata
  • Subject

    Technology & Computer Science

  • Education level

    Graduate

  • Cognitive goals

    Create

  • Difficulty estimate

    Hard

  • Tags

    [formal-verification, compiler-backend, weak-memory, concurrency, mechanized-proofs, memory-models]

  • Number of questions

    5

  • Created on

  • Generation source

  • License

    CC0 Public domain

  • Prompt

    [Assess graduate-level ability to design and formally verify a compiler backend that preserves concurrency semantics on weak-memory architectures; test knowledge of weak-memory models (TSO/ARM/POWER), operational vs. axiomatic semantics, correct lowering of atomic primitives, fence insertion and placement, interactions with register allocation and instruction selection, construction of refinement/simulation proofs, mechanized proof techniques (Coq/Isabelle), litmus-test validation, proof decomposition strategies, and end-to-end verification workflows and toolchain integration.]
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.