The default works just fine (nowadays), so let's use that.

Sergey Bozhko authored 3 years ago and Björn Brandenburg committed 3 years ago

Add an implementation of arrival curves via fast
extrapolation of a finite arrival-curve prefix. 

Martin Constantino–Bodin authored 3 years ago and Björn Brandenburg committed 3 years ago

`esy` is an `npm`-like package manager and build tool designed for
reproducibility, by preventing the use of unlisted dependencies and
pinning the exact version of each of these (a bit like `opam`, but
with more guarantees).

A nice feature of `esy` is ease of installation:

1. Install `esy` through `npm`. (However, note that `esy` is not a
   JavaScript program; the `esy` project just uses `npm` as a code
   hoster.

2. Run `esy` in the Prosa repository. 

This will download and compile all dependencies and compile the
repository. (On the flip side, this also means that Coq will be
compiled, so the first time, compilation will be slow.)

See the README.md file for usage instructions. 

See also the discussion: #80

For more information about `esy`, see: https://esy.sh/

Closes #79

Sergey Bozhko authored 3 years ago and Björn Brandenburg committed 3 years ago

Note that many files have changed; however, this is due to the fact that some of the lemmas in nat.v have been renamed or removed.

Superseded by alectryon, no longer needed.

See: https://github.com/cpitclaudel/alectryon

LailaElbeheiry authored 4 years ago and Björn Brandenburg committed 4 years ago

With help from Marco Maida <mmaida@mpi-sws.org>, Sergey Bozhko <sbozhko@mpi-sws.org>, Björn Brandenburg <bbb@mpi-sws.org>.

LailaElbeheiry authored 4 years ago and Björn Brandenburg committed 4 years ago

This commit connects the two ways with which one can specify that a
schedule is an EDF schedule in PROSA: the `EDF_schedule` predicate
and the `respects_policy_at_preemption_point` with the EDF priority
policy predicate. We connect these two definitions by showing that
they're equivalent. We then restate the optimality proof of EDF
schedules using the proven equivalence.

Marco Maida authored 4 years ago and Björn Brandenburg committed 4 years ago

...and some supporting theory. This will be needed to handle arrival curves extrapolated from a finite prefix.

Sergey Bozhko authored 4 years ago and Björn Brandenburg committed 4 years ago

The names for job's and task's run-to-completion
threshold functions are so long that it often gets
in the way of writing theorems and proofs. As
a compromise between verbosity and convenience it
was decided to rename [task_run_to_completion_threshold]
to [task_rtct] and [job_run_to_completion_threshold]
to [job_rtct].

Marco Maida authored 4 years ago and Björn Brandenburg committed 4 years ago

max arrival curve + WCET ➔ max RBF
min arrival curve + BCET ➔ min RBF

The vernacular commands Opaque / Transparent change coqtop's prompt
counter without generating a prompt (for whatever reason). The proof
state recorder needs to be aware of this to avoid a out-of-sync
assertion false positive.

For debugging purposes, slow down the interaction with coqtop to maybe
trigger some potential races more reliably.

If coqtop reports a different number of interactions in its prompt
than we provided, we're out of sync.

... to comments and closing braces on lines before bulleted
sub-proofs.

For better debugging support, add

	--parse-only
and

	--parse-only --verbose
modes.

improve comments, fix names, move some stuff around

spell checker: add 'supremum' to dictionary