Skip to content
Snippets Groups Projects
Forked from RT-PROOFS / PROSA - Formally Proven Schedulability Analysis
Source project has a limited visibility.
  • Björn Brandenburg's avatar
    839126b3
    improve the EDF optimality proof by reasoning about prefixes · 839126b3
    Björn Brandenburg authored
    Don't always "drill to the bottom" and unfold to sums; instead
    explicitly make use of the fact that the EDF proof reasons about
    finite identical prefixes, which allows staying at a semantically
    higher level in the proof.
    
    While at it, switch the file to using the preferred `now` tactical
    when closing out proofs (rather than `by`) to avoid emacs indentation
    issues.
    839126b3
    History
    improve the EDF optimality proof by reasoning about prefixes
    Björn Brandenburg authored
    Don't always "drill to the bottom" and unfold to sums; instead
    explicitly make use of the fact that the EDF proof reasons about
    finite identical prefixes, which allows staying at a semantically
    higher level in the proof.
    
    While at it, switch the file to using the preferred `now` tactical
    when closing out proofs (rather than `by`) to avoid emacs indentation
    issues.