Skip to content
Snippets Groups Projects
  1. Apr 19, 2022
  2. Mar 03, 2022
  3. Feb 17, 2022
  4. Feb 16, 2022
    • Sergey Bozhko's avatar
      Rename arguments of [apply _ with (NAME0 := _)] · e078c510
      Sergey Bozhko authored and Björn Brandenburg's avatar Björn Brandenburg committed
      From changelog of Coq version 8.15:
      Changed: [apply with] does not rename arguments unless using
      compatibility flag Apply With Renaming (#13837, fixes #13759, by Gaëtan
      Gilbert).
      
      So, this commit replaces all occurrences of [apply L with (NAME0 := V)]
      to [apply L with (NAME := V)]
      e078c510
  5. Oct 07, 2021
  6. Sep 08, 2021
    • Sergey Bozhko's avatar
      clean up `nat.v` · b3f7a4bc
      Sergey Bozhko authored and Björn Brandenburg's avatar Björn Brandenburg committed
      Note that many files have changed; however, this is due to the fact that some of the lemmas in nat.v have been renamed or removed.
      b3f7a4bc
  7. May 11, 2020
  8. Dec 19, 2019
  9. Nov 15, 2019
  10. Jan 10, 2017
  11. Nov 25, 2016
    • Felipe Cerqueira's avatar
      Restructure directory + Add jitter-aware RTA · a5f12a43
      Felipe Cerqueira authored
      - Added definitions and implementation of jitter-aware RTA for
        uniprocessor scheduling.
      - The Prosa directory was restructured to better accomodate the different
        types of arrival sequences and schedules.
      a5f12a43
  12. Sep 06, 2016
    • Felipe Cerqueira's avatar
      Major commit: Uniprocessor RTA · ac6f0d4e
      Felipe Cerqueira authored
      This commit contains several updates related to uniprocessor scheduling.
      
      - Basic definitions of uniprocessor scheduling (see model/uni)
      - Definitions of worload and service for generic sets of jobs (see service.v and workload.v in model/uni)
      - Definitions and lemmas about busy intervals (see model/uni/basic/busy_interval.v)
      - Definition of an arrival bound for sporadic tasks (see model/arrival_bounds.v)
      - Definitions and correctness proofs of the RTA for FP scheduling
        (also works with non-unique priorities and arbitrary deadlines, but gives pessimistic bounds)
      - Implementation of the FP RTA to check for contradictory assumptions
      
      In addition, we have also defined partitioned scheduling and proven how it relates
      with uniprocessor (see model/partitioned).
      ac6f0d4e
  13. Aug 05, 2016
  14. May 05, 2016
  15. May 04, 2016
  16. Mar 31, 2016
  17. Mar 01, 2016
  18. Feb 16, 2016
  19. Feb 01, 2016
    • Felipe Cerqueira's avatar
      Major Changes in RTA and Directory Structure · 32126a75
      Felipe Cerqueira authored
      - Removed unnecessary assumption in RTA about task precedence/no intra-task parallelism.
      - Scheduler models and analyses are organized in separate modules/folders.
      - Added RTA for FP and EDF for schedulers with release jitter.
      - The scheduling invariants were split into more fine-grained assumptions:
        (a) scheduler is work-conserving
        (b) scheduler enforces FP/JLDP priority X
      - New helper lemmas about counting, and sorted/uniq lists
      - Inclusion of tactics feed and feed_n (see documentation).
      - Added a Makefile generator
      32126a75
  20. Jan 20, 2016
  21. Jan 13, 2016
  22. Jan 08, 2016
  23. Jan 07, 2016
  24. Jan 06, 2016
  25. Jan 05, 2016
  26. Dec 29, 2015
Loading