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
Merge requests
!212
various cleanups and simplifications in util
Code
Review changes
Check out branch
Download
Patches
Plain diff
Merged
various cleanups and simplifications in util
MathComp-PR-cleanups-and-simplifications
into
master
Overview
19
Commits
21
Pipelines
7
Changes
36
All threads resolved!
Hide all comments
Merged
Björn Brandenburg
requested to merge
MathComp-PR-cleanups-and-simplifications
into
master
2 years ago
Overview
19
Commits
21
Pipelines
7
Changes
3
All threads resolved!
Hide all comments
Expand
Pierre's cleanups from
!190
, minus the TODO annotations.
CC:
@proux
Edited
2 years ago
by
Björn Brandenburg
0
0
Merge request reports
Compare
version 3
version 5
771bdee0
2 years ago
version 4
802efc7f
2 years ago
version 3
bc89e5cb
2 years ago
version 2
f642885b
2 years ago
version 1
2f13c730
2 years ago
master (base)
and
version 4
latest version
45391d62
21 commits,
2 years ago
version 5
771bdee0
21 commits,
2 years ago
version 4
802efc7f
28 commits,
2 years ago
version 3
bc89e5cb
27 commits,
2 years ago
version 2
f642885b
25 commits,
2 years ago
version 1
2f13c730
20 commits,
2 years ago
Show latest version
3 files
+
41
−
31
Inline
Compare changes
Side-by-side
Inline
Show whitespace changes
Show one file at a time
Files
3
Search (e.g. *.vue) (Ctrl+P)
analysis/facts/model/workload.v
+
1
−
1
Options
@@ -89,7 +89,7 @@ Section WorkloadFacts.
clear
H_jobs_uniq
H_j_in_jobs
H_t1_le_t2
.
rewrite
/
workload_of_jobs
big_seq_cond
.
rewrite
-
[
in
X
in
X
<=
_]
big_filter
-
[
in
X
in
_
<=
X
]
big_filter
.
apply
leq_sum_sub_uniq
;
first
by
apply
filter_uniq
,
arrivals_uniq
.
apply
:
leq_sum_sub_uniq
=>
//
;
first
by
apply
filter_uniq
,
arrivals_uniq
.
move
=>
j'
;
rewrite
mem_filter
=>
[
/
andP
[
/
andP
[
A
/
andP
[
C
D
]]
_]]
.
rewrite
mem_filter
;
apply
/
andP
;
split
;
first
by
done
.
apply
job_in_arrivals_between
;
eauto
.
Loading