Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"graph marking"”.

  1. A component-based approach to proving the correctness of the Schorr-Waite algorithm

    … Specifically, we specify the behavior of a graph-marking algorithm known as the Schorr-Waite algorithm, implement it using a component that captures the behavior and performance benefits of pointers, and prove that the implementation is correct with respect to the specification. We use the …

    vt Repository record for A component-based approach to proving the correctness of the Schorr-Waite algorithm (opens in a new tab)

  2. Coinductive program verification

    … algorithms as complicated as Schorr-Waite graph marking, and the flexibility by instantiating it for language definitions covering several paradigms, and in several styles of semantics. We also demonstrate a comfortable level of proof automation for several languages and domains, using a …

    uiuc Repository record for Coinductive program verification (opens in a new tab)

  3. Local Reasoning for Stateful Programs

    … with the verification of the Schorr-Waite graph marking algorithm."

    uiuc Repository record for Local Reasoning for Stateful Programs (opens in a new tab)