Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
PROSA - Formally Proven Schedulability Analysis
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
RT-PROOFS
PROSA - Formally Proven Schedulability Analysis
Graph
9271931f0ff5a1e4b1deca491556b475428e2053
Select Git revision
Branches
7
classic-prosa
protected
embed_arr_seq_uniq
fset
master
default
protected
prepare_MC_PR
tutorial
wip-hunspell
Tags
5
v0.5
protected
v0.4
protected
v0.3
protected
v0.2
protected
v0.1
protected
12 results
You can move around the graph by using the arrow keys.
Begin with the selected commit
Created with Raphaël 2.2.0
10
Nov
9
8
28
Sep
20
7
1
29
Aug
25
18
10
8
4
1
28
Jul
25
21
19
14
11
6
1
30
Jun
27
May
26
16
12
9
6
5
19
Apr
14
13
7
25
Mar
24
18
17
16
11
4
3
25
Feb
18
17
16
15
14
13
11
9
31
Jan
13
15
Dec
7
29
Nov
25
24
23
5
4
3
2
14
Oct
12
11
7
6
5
4
30
Sep
29
27
22
17
16
15
11
8
30
Jul
27
26
19
18
Mar
11
8
1
29
Jan
2
11
Dec
25
Sep
23
22
9
28
Aug
27
10
6
5
4
30
Jul
9
8
30
Jun
19
May
11
3
Apr
1
31
Mar
27
10
27
Feb
26
19
11
10
23
Jan
21
21
Dec
20
19
18
12
10
4
20
Nov
19
18
15
11
5
31
Oct
29
24
23
16
15
11
24
Sep
23
17
30
Aug
23
21
20
13
24
Jul
19
2
27
Jun
26
25
13
12
5
26
May
19
16
13
12
7
3
29
Apr
9
5
12
Oct
19
Sep
4
17
Jul
5
Jan
14
Dec
7
10
Jan
25
Nov
26
Oct
19
18
6
6
Sep
5
Aug
3
17
Jul
15
14
13
12
8
Jun
6
5
May
4
31
Mar
2
23
Feb
16
14
add .mailmap
use custom alectryon driver to comply with DSGVO (Germany privacy law)
Adapt to https://github.com/coq/coq/pull/16004
Update POET's support code to match the newer aRTA blocking bound
v0.5
v0.5
CI: bump preferred Coq version
generalize one proof related to FP
add remaining POET support files
document some recently discussed guidelines
use `valid_arrival_sequence` predicate more consistently
revise the FIFO RTA documentation
simplify FIFO cumulative priority inversion bound
don't duplicate [odflt] from [ssrfun]
fix spelling and markup issues uncovered by `hunspell`
wip-hunspell
wip-hunspell
CI: update custom dictionary
CI: detect & remove multiline verbatim blocks
CI: switch spellchecking to `hunspell`
add GEL RTA
add task-related refinements and helper lemmas
streamline proof of EDF `total_workload_shorten_range` lemma
add `workload_of_jobs` filtering lemmas
add `arrivals_between` filtering lemmas
generalize some parts of the EDF aRTA instantiation
generalize priority inversion definition
add lemma about [service_of_jobs_at]
add auxiliary lemmas about ideal schedule
add computed fixpoints for FP-FP RTA
add utilities for finding fixpoints of functions
add lemmas on misc. properties of total RBF variants
add a lemma on the monotonicity of sums of monotonic functions
fix comments for hypothesis
clean up proofs
remove sequential tasks assumption from EDF RTA
make assumption weaker
generalize lemma for bound on busy window
add more lemmas to [basic_rt_facts]
add lemmas about [workload_of_jobs]
simplify GEL definition
exclude the blocking bound from the EDF search space
adjust FP NPS PI-blocking bound proof to narrowed definition
narrow priority-inversion bound to jobs with non-zero cost
Loading