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
bb76b8bdcac5cc26a65fbc5be1ca8f40a9798f7b
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
15
Apr
12
15
Feb
14
13
9
7
6
25
Jan
24
23
22
19
18
17
16
15
14
12
10
8
6
4
3
12
Dec
24
Nov
23
22
10
9
6
2
13
Oct
12
22
Sep
12
Jul
7
5
30
Jun
29
27
23
21
16
13
12
9
28
Apr
25
20
19
14
11
10
6
5
4
1
30
Mar
29
27
24
23
17
16
15
13
10
4
2
1
28
Feb
27
22
21
20
14
28
Jan
20
11
Nov
10
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
prove that ideal sched is unit-supply proc model
use `Instance` syntax to define RTC threshold instances
make `eq_sum_seq` rewritable
remove superfluous util.list lemma
remove work-conservation dependency from the priority inversion file
CI: complain and fail if there are warnings
update to Coq 8.19 and MathComp 2.2.0
generalize task-cost inequality lemma
add some lemmas about RBFs
add some guidelines on "!" in context declarations
add some lemmas about workload
prove restricted supply FP-FP RTA
prove that task intra-supply IBF is a valid bound
remove unnecessary dependency on Task in aRTA
small refactor of arrivals lemmas
prove that busy intervals are bounded for RS-FP
add the notion of monotone SBF
add a new lemma about SBF
add lemma about switch of IBF in search space
Prove that job's max lower-priority non-preemptive segment is bounded
Prove that abstract search space is a subset of RS-FP search space
Refactor assumptions in a lemma about RBF
De-duplicate [blocking_bound]
prove lemmas about restricted-supply processor
add [arrives_in] to SBF def
Add I/IW instantiation for restricted supply
prove existence of abstract busy interval
add notion of speculative execution
generalize proof and improve structure
restructure I/IW instantiation files
add proofs about jitter propagation
add definition of propagated arrival curves
define task-level release jitter parameter
generalize a few "bigcat" lemmas
prove supply related properties of ideal uni-proc
introduce more notions of service
introduce more notions of workload
improve proof script
remove trailing spaces
prove that service inversion is bounded
Loading