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
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
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
Lasse Blaauwbroek
PROSA - Formally Proven Schedulability Analysis
Graph
ebc9b23420fbb452db623baa5760ac405f43259e
Select Git revision
Branches
7
classic-prosa
embed_arr_seq_uniq
fset
master
default
protected
prepare_MC_PR
tutorial
wip-hunspell
Tags
5
v0.5
v0.4
v0.3
v0.2
v0.1
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
23
Aug
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
12
7
3
1
20
Jan
19
15
14
13
12
10
9
8
7
6
5
29
Dec
18
17
16
15
14
10
9
8
7
4
3
2
1
30
Nov
24
23
20
18
17
13
10
4
3
28
Oct
27
22
20
16
15
14
13
12
6
1
30
Sep
29
25
22
17
16
15
11
10
9
8
7
6
4
3
1
28
Aug
26
25
24
18
17
12
11
6
5
4
3
31
Jul
30
29
28
27
25
24
22
21
17
16
15
14
13
12
11
10
9
8
7
6
11
Jun
15
May
8
7
6
5
4
30
Apr
22
21
20
23
Mar
6
5
8
Aug
1
31
Jul
30
29
note equivalence of assumptions in case of basic readiness
prove ready jobs are incomplete
make definition of completed_jobs_dont_execute uniform
prove jobs must arrive to be ready
define [backlogged] in terms of job readiness
note that ideal processor model provides unit service
add [n + k <= m => n <= m] helper lemma
tighten response-time recurrence for EDF
Change name of a matched variable
add EDF optimality argument
add prefix_map transformation and two supporting lemmas
add utility function search_arg for searching across schedules
add theory of schedules with swaps
add two notions of "all deadlines met" independent of tasks
note two simple facts about job deadlines
introduce a utility lemma on points outside of intervals
add subn_abba helper lemma
add ltn_leq_trans utility lemma
start classification of processor models
define preemptive work-conserving and priority-based schedules
Remove superfluous variable
port definitions for arrival curves
enable proof-length checking during CI
add scripts/proofloc.py, a utility for checking proof length
port notions of job/task deadlines and schedulability to restructuring
simplify structure of behavior, move arrival_sequence and schedule to toplevel, move task and sequential to model
clean up the new schedule definitions
automatically build HTML docs as part of CI
split out 'make validate' into individual job
simplify CI setup by using official mathcomp Docker images
Change definition of completion
port existing proofs to ssreflect 1.9.0
Copied model/schedule/uni/basic/platform_tdma.v to restructuring/model/schedule/tdma.v
copied everything from model/policy_tdma.v
applied naming convention to behavior
move readme to restructuring root
fix indentation in completion.v
Add sporadic task model
add task_cost containing definitions related to the WCET model
move job_cost to job.v
Loading