session SuffixArray = HOL +
options [timeout = 600]
sessions "HOL-Combinatorics" "HOL-Library"
directories
util
order
spec
simple
extra "sais/code" "sais/abs-def" "sais/prop" "sais/abs-proof" "sais/def" "sais/proof"
theories
(* Basic helper theories building on Main (in util folder) *)
Nat_Util
Fun_Util
Set_Util
List_Util
Sorting_Util
Repeat
Continuous_Interval
List_Slice
(* Specialised helper theories building on HOL-Combinatorics (in order folder) *)
List_Lexorder_Util
List_Lexorder_NS
Valid_List
Valid_List_Util
Suffix
Suffix_Util
List_Permutation_Util
(* Extra Theories *)
Prefix
Prefix_Util
(* An axiomatic characterisation fully specifying suffix array construction as well as
properties of this axiomatic characterisation (in spec folder) *)
Suffix_Array
Suffix_Array_Properties
(* A simple suffix array construction algorithm and its formal verification against the
specification (in simple folder). This is used to validate the specification and to compare the verification effort to
that of verifying SAIS *)
Simple_SACA
Simple_SACA_Verification
(* Given the specification is an axiomatic characterisation fully specifying suffix
array construction, we obtain a corollary stating that generalised SAIS is functionally
equivalent to the simple construction algorithm. *)
SACA_Equiv
document_files "root.bib" "root.tex"
Messung V0.5 in Prozent
¤ Dauer der Verarbeitung: 0.9 Sekunden
(vorverarbeitet am 2026-06-10)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.