Skip to content
Snippets Groups Projects
  1. Feb 16, 2016
    • Robbert Krebbers's avatar
      Use Disjoint type class to get nice notation for ndisjoint. · 3034d8ef
      Robbert Krebbers authored
      Also, put stuff in a section.
      3034d8ef
    • Robbert Krebbers's avatar
      Use bundled type classes for ghost ownership. · b07dd0b5
      Robbert Krebbers authored
      * These type classes bundle an identifier into the global CMRA with a proof
        that the identifier points to the correct CMRA. Bundling allows us to get
        rid of many arguments everywhere.
      
      * I have setup the type classes so that we no longer have to keep track of the
        global CMRA identifiers. These are implicit and resolved automatically.
      
      * For heap I am also bundling the name of the heap RA instance. There always
        should be at most one heap instance so this does not introduce ambiguities.
      
      * We now have a "maps to" notation!
      b07dd0b5
    • Ralf Jung's avatar
    • Ralf Jung's avatar
      strengthen auth and heap rules to only require the assertion under a later · e9c6a8ea
      Ralf Jung authored
      Whenever clients get this stuff out of invariants, this is much more convenient for them, compared to applying timelessness themselves.
      On the other hand, this makes the test proofs slightly more annoying, since they have to manually strip away that later. I am not sure if it is worth having separate lemmas (well, tactics, soon) for that.
      Eventually, we should have a tactic which, given "... * P * ... |- ... * \later^n P * ...", automatically gets rid of the P.
      e9c6a8ea
    • Robbert Krebbers's avatar
      Many STS tweaks: · 9997d0ef
      Robbert Krebbers authored
      * Clearly separate the file algebra/sts in three parts:
        1.) The definition of an STS, step relations, and closure stuff
        2.) The construction as a disjoint RA (this module should never be used)
        3.) The construction as a CMRA with many derived properties
      * Turn stsT into a canonical structure so that we can make more of its arguments
        implicit.
      * Rename the underlying step relation of STSs to prim_step (similar naming as
        for languages, but here in a module to avoid ambiguity)
      * Refactor program_logic/sts by moving general properties of the STS CMRA to
        algebra/sts.v
      * Make naming and use of modules in program_logic/sts more consistent with
        program_logic/auth and program_logic/saved_prop
      * Prove setoid properties of all definitions in program_logic/sts
      9997d0ef
    • Ralf Jung's avatar
    • Robbert Krebbers's avatar
      Rename sts -> stsT. · edfd4f51
      Robbert Krebbers authored
      edfd4f51
  2. Feb 15, 2016
  3. Feb 14, 2016
  4. Feb 13, 2016
Loading