bend-osdev-apparmor
Releases (1)
-
0.1.0.0 indexed
Definitions (1,104)
LAWS.bend
- law glob_seq_model
- law glob_run
- law glob_model
- law glob_ref_model
- law granted_never_denied
- law deny_wins
- law unmatched_denied
- law complain_decided_by_deny
- law complain_never_denies
- law file_deny_wins
- law file_unmatched_denied
- law include_idempotent_file
- law include_idempotent_capability
- law include_idempotent_network
- law include_idempotent_signal
- law include_idempotent_ptrace
- law include_idempotent_mount
- law include_idempotent_dbus
- law include_idempotent_change_profile
- law exec_needs_x
- law deny_wins_sat
- law deny_wins_example
- law allow_example
- law audit_example
- law unmatched_sat
- law file_unmatched_sat
- law unmatched_example
- law complain_sat
- law complain_example_unmatched
- law complain_example_deny_rule
- law complain_example_no_deny
- law kill_example
- law exec_needs_x_sat
- law exec_needs_x_sat2
- law glob_star_not_empty_segment
- law glob_star_file
- law glob_star_no_slash
- law glob_star2_not_dir_itself
- law glob_star2_deep
- law glob_star_inside_segment
- law glob_star_in_braces
- law glob_negated_class_slash
- law glob_slashes_collapse
- law glob_class_range
- law glob_nested_braces
- law glob_question
- law glob_one_alternative_rejected
- law glob_trailing_dash_rejected
- law glob_empty_class_rejected
- law policy_file_vectors
- law policy_exec_vectors
PROOF.bend
- def b.or_assoc
- def b.or_false_r
- def b.and_false_r
- def b.and_true_r
- def b.factor(p and n and f) or (p and q) is p and ((n and f) or q)
- def b.disc
- def b.ft
- def b.absurd
- def b.absurd_tf
- def fethe pieces d fit the tokens r after an empty first piece
- def fe_any
- def fa_app
- def fe_app
- def ef_charan empty first piece: no single-byte token fits it
- def ef_any
- def ef_class
- def ef_star...
- def ef_star2
- def gr_chara first piece that starts with h: a single-byte token takes h and leaves an empty piece
- def gr_any
- def gr_class
- def gr_star...
- def gr_star2...
- def fe_efcutting into one more piece and asking for an empty first piece is cutting into as many
- def fe_gr
- def fe_cuts
- def glob.thmthe matcher agrees with the list model: induction on the sequence, and on the path under a star
- def nfa.taut_nil
- def nfa.taut_adv
- def nfa.taut_star
- def nfa.taut_star2
- def nfa.stepone byte: the positions after it accept t exactly when, before it, the positions (with the carried ones) accept h then t
- def nfa.deadno position active: nothing accepted
- def nfa.runthe run: the positions accept the path (a: whether some position is active)
- def nfa.falses_dead
- def nfa.startonly the whole sequence active: what the backtracking matcher accepts
- def nfa.start_alive
- def nfa.thm
- def glob.alts
- def glob.alts_ref
- def bits.minus_meetswhat minus leaves never meets what it took away
- def bits.nany_meetsa request with no bit set meets nothing
- def bits.covers_meetsa request that minus(a, d) covers does not meet d
- def bits.or_assoc
- def b.or_idem
- def bits.or_idem
- def bits.or_nil_r
- def pm.covers_meets
- def pm.minus_meets