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
f9ef87453212f021b8ae352b2eaa45e89f52615f
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
1
Apr
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
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
CI: check that POET certificates keep working
move misplaced code out of `prosa.analysis.facts.busy_window`
factor out ideal uniproc from carry-in lemmas
generalize `low_service_implies_existence_of_idle_time`
introduce a generic notion of `is_idle`
rename `is_idle` -> `ideal_is_idle`
cleanup: remove some stale references to ideal uniprocessor
remove ideal uniprocessor assumption from TDMA
fix outdated comments
add workload-by-task partitioning lemma
weaken assumption of `sum_over_partitions_eq`
generalize FP ⊂ GEL proof to any self-suspension model
introduce the class of sequential readiness models
generalize a number of core definitions and facts
relate ideal uniprocessor to `scheduled_job_at`
introduce a generic notion of scheduled job(s)
Makefile: add 'make proof-length'
remove unused context declaration
fix CoqdocJS handling of apostrophes embedded in identifiers
prove that GEL conditionally generalizes FP
add lemma on sequential_tasks
note that GEL trivially generalizes both EDF and FIFO
fix `make vacuum` if no `_CoqProject` is present
Revert "Restore compatibility with Coq 8.13"
Bump lower bound for Coq to >= 8.16
Bump lower bound on MathComp to >= 1.16.0
Put mangle-names in a separate CI target
Use mathcomp's int instead of stdlib's Z
Add missing lemma not_hep_hp_task
Prove a splitting fact about interference
Use _dec definitions directly
Moving interference definitions out of iw_instantiation
Definition of ELF
Definitions of hp_task and its properties
introduce predicates on task- and job-level priority policies
update dot files
fix spell-checking issues in *.md files
also spell-check *.md files
Warning about autogenerated names
Warning about implicit arguments
Loading