#
c4dc578b |
|
17-Sep-2018 |
Edward Pierzchalski <ed.pierzchalski@data61.csiro.au> |
Fix up proofs after word lemma moves
|
#
6b9d9d24 |
|
09-Jun-2018 |
Gerwin Klein <gerwin.klein@data61.csiro.au> |
Isabelle2018: new "op x" syntax; now is "(x)" (result of "isabelle update_op -m <dir>")
|
#
2d0baab4 |
|
13-Mar-2018 |
Corey Lewis <corey.lewis@data61.csiro.au> |
Proof update for crunch changes
|
#
0f38e200 |
|
25-Feb-2018 |
Thomas Sewell <Thomas.Sewell@data61.csiro.au> |
Many proof repairs.
|
#
4efe5392 |
|
29-Jan-2018 |
Miki Tanaka <miki.tanaka@nicta.com.au> |
arm ainvs: fix a typo
|
#
b37bc044 |
|
20-Nov-2017 |
Miki Tanaka <miki.tanaka@nicta.com.au> |
arm ainvs: wp rules for simple_ko setter/getter
|
#
3841b6e8 |
|
05-Dec-2017 |
Miki Tanaka <miki.tanaka@nicta.com.au> |
arm : add AEndpoint and ANTFN a_type simplification in addition to the a_type ATCB simplification, the following two are now in the simpset: "a_type (Endpoint x) = AEndpoint" "a_type (Notification v) = ANTFN"
|
#
3a22487c |
|
24-Nov-2017 |
Rafal Kolanski <rafal.kolanski@nicta.com.au> |
arm: revise scheduler / fastpath / scheduler bitmaps (SELFOUR-242) Colloquially known as "invert-fastpath". Update verification efforts on ARM for the following seL4 changes: - scheduling decisions done in possibleSwitchTo are moved to the scheduler - possibleSwitchTo only checks whether the candidate is valid for a fast switch, not its priority, accepting possible candidates immmediately as a switch-to scheduler action - the scheduler checks the candidate against the current thread and against the bitmaps before making a decision - attemptSwitchTo and switchIfRequiredTo are gone - scheduler is now more complicated, and numerous proofs related to it are rewritten from scratch - fast path now checks ready queues via the scheduler bitmaps - L2 scheduler bitmap order reversed for better cache locality Many iterations between the kernel and verification teams were needed to get this right.
|
#
4f68967b |
|
28-Aug-2017 |
Matthew Brecknell <Matthew.Brecknell@data61.csiro.au> |
Isabelle2017: update AInvs for RC0 * word_eqI is no longer rule_format. * Updated Isabelle/ML Thm.join_proofs to Thm.consolidate. * Updated suffix_refl to suffix_order.order.refl. * Removed some lines of proofs, thanks to improved simplifier.
|
#
6d8e9170 |
|
19-Jul-2017 |
Miki Tanaka <miki.tanaka@nicta.com.au> |
Remove valid_arch_objs now that we have valid_vspace_objs to express validiy of vspace objects, we do not need valid_arch_objs: we have valid_objs to state the validity of non-vspace arch objects.
|
#
796887d9 |
|
11-Jul-2017 |
Alejandro Gomez-Londono <alejandro.gomez@nicta.com.au> |
Removes all trailing whitespaces
|
#
fb9de60c |
|
25-May-2017 |
Alejandro Gomez-Londono <alejandro.gomez@data61.csiro.au> |
arm ainvs: Update for create_mapping_entries changes
|
#
a6304f8e |
|
17-May-2017 |
Joel Beeren <joel.beeren@nicta.com.au> |
arm ainvs: update arch stuff to match generic for top level ainvs files
|
#
47119bf4 |
|
13-Jan-2017 |
Gerwin Klein <gerwin.klein@nicta.com.au> |
wp_cleanup: update proofs for new wp behaviour The things that usually go wrong: - wp fall through: add +, e.g. apply (wp select_wp) -> apply (wp select_wp)+ - precondition: you can remove most hoare_pre, but wpc still needs it, and sometimes the wp instance relies on being able to fit a rule to the current non-schematic precondition. In that case, use "including no_pre" to switch off the automatic hoare_pre application. - very rarely there is a schematic postcondition that interferes with the new trivial cleanup rules, because the rest of the script assumes some specific state afterwards (shouldn't happen in a reasonable proof, but not all proofs are reasonable..). In that case, (wp_once ...)+ should emulate the old behaviour precisely.
|
#
511c6b2d |
|
03-Nov-2016 |
Matthew Brecknell <Matthew.Brecknell@data61.csiro.au> |
Isabelle2016-1: rename free variables to avoid capture
|
#
41d4aa4f |
|
25-Oct-2016 |
Matthew Brecknell <Matthew.Brecknell@data61.csiro.au> |
Isabelle2016-1: update references to renamed constants and facts
|
#
7c7c7fa0 |
|
24-Nov-2016 |
Joel Beeren <joel.beeren@nicta.com.au> |
AInvs: genericise Detype_AI.thy
|
#
d6597942 |
|
23-Nov-2016 |
Matthew Brecknell <Matthew.Brecknell@data61.csiro.au> |
update references to word32_plus_mono_right_split This is now called machine_word_plus_mono_right_split, since it now works at the current architecture's machine word size.
|
#
a2d707d1 |
|
14-Aug-2016 |
Miki Tanaka <miki.tanaka@nicta.com.au> |
SELFOUR-553: update rpidrurw in TCBConfigure for simpler Infoflow proofs.
|
#
f8f88c69 |
|
03-Aug-2016 |
Miki Tanaka <miki.tanaka@nicta.com.au> |
SELFOUR-553: Change Spec according to C code and fix ASpec and AInvs
|
#
2553371a |
|
06-Nov-2016 |
Joel Beeren <joel.beeren@nicta.com.au> |
SELFOUR-64: Remove general Recycle operation This removes the RecycleCap CNodeInvocation, whilst retaining recycle behaviour for Endpoints -- now renamed CNodeCancelBadgedSends.
|
#
d765a64b |
|
16-May-2016 |
Thomas Sewell <Thomas.Sewell@nicta.com.au> |
SELFOUR-444: Haskell implementation, begin refine. First attempt at a haskell implementation of preemptible retyping and the refinement proof to abstract.
|
#
63888fa9 |
|
16-May-2016 |
Thomas Sewell <Thomas.Sewell@nicta.com.au> |
SELFOUR-444: AInvs proven for preemptible retype.
|
#
8d4a8eb2 |
|
21-Sep-2016 |
Xin,Gao <xin.gao@nicta.com.au> |
SELFOUR-421: fix coding style
|
#
ed2f1e1c |
|
10-Jul-2016 |
Matthew Brecknell <Matthew.Brecknell@nicta.com.au> |
arch_split: split PDPTEntries_AI, rename as VSpaceEntries_AI [VER-580]
|