Skip to content
Snippets Groups Projects
Select Git revision
  • classic-prosa
  • embed_arr_seq_uniq
  • fset
  • master default protected
  • prepare_MC_PR
  • tutorial
  • wip-hunspell
  • v0.5
  • v0.4
  • v0.3
  • v0.2
  • v0.1
12 results
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.024Nov23543214Oct1211765430Sep29272217161511830Jul27261918Mar118129Jan211Dec25Sep2322928Aug271065430Jul9830Jun19May113Apr131Mar271027Feb2619111023Jan2121Dec2019181210420Nov19181511531Oct29242316151124Sep231730Aug2321201324Jul19227Jun26251312526May191613127329Apr9512Oct19Sep417Jul5Jan14Dec710Jan25Nov26Oct191866Sep5Aug317Jul151413128Jun65May431Mar223Feb16141273120Jan1915141312109876529Dec181716151410987432130Nov242320181713104328Oct27222016151413note equivalence of two ways of constraining `workload_of_jobs`add two new utility lemmas about sums over set partitionsadd rewriting lemma on the workload of "all other jobs"clean up in util/unit_growth.vadd basic facts about the FIFO scheduling policyadd a stronger notion of priority policy complianceintroduce the job-level predicate `preempted_at`move general preemption lemmasremove task from context in early_hep_jobaddition to basic factsremove util/rewrite_facilities.vadd comment in util/seqsetCI: update to mathcomp 1.13opam: bump up supported Coq versionCI: use Coq 8.14add a `package.json` file to turn Prosa into an `esy` package. improve comments in bounded PI argumentsfix misleading typeproperly describe [IBF_other]rename [IBF] to [IBF_other]fix misleading lemma nameaddress deprecation warnings in classic Prosaaddress deprecation warnings (iota_add -> iotaD)move lemma [early_hep_job_is_scheduled] to separate fileadd lemmas to util/div_modadd lemmas to util/listdrop support of older versions of Coq and ssreflectCI: explicitly trigger recompilation in axiom checkCI: automatically check validation output for unexpected axiomsimprove tactic [convert_two_instants_into_instant_and_duration]relax assumption in aRTAautomatically use implications of `valid_schedule`FP: switch from basic readiness to sequential readinessEDF: switch RTA to `valid_schedule` hypothesisEDF ensures the `sequential_tasks` propertyadjust lemmas to work-bearing readinessremove ideal uniproc. assumption from some lemmas on `service_of_jobs`note basic `task_schedule` propertiesadd two helper lemmas on processor serviceadd notion `receives_service_at`