Formally Verified Suffix Array Construction Formally Verified Suffix Array Construction
Suffix arrays are a data structure with numerous real-world applications. They are extensively used in text retrieval and data compression applications, including query suggestion mechanisms in web search, and in bioinformatics tools for DNA sequencing and matching. This wide applicability means tha...
Saved in:
| Published in | Journal of automated reasoning Vol. 69; no. 3; p. 21 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Dordrecht
Springer Netherlands
01.09.2025
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0168-7433 1573-0670 1573-0670 |
| DOI | 10.1007/s10817-025-09735-8 |
Cover
| Abstract | Suffix arrays are a data structure with numerous real-world applications. They are extensively used in text retrieval and data compression applications, including query suggestion mechanisms in web search, and in bioinformatics tools for DNA sequencing and matching. This wide applicability means that algorithms for constructing suffix arrays are of great practical importance. The SA-IS algorithm is an efficient but conceptually complex suffix array construction technique, and implementing it requires a deep understanding of its underlying theory. As a critical step towards developing a provably correct and efficient implementation, we have developed the SA-IS algorithm in Isabelle/HOL and formally verified that it is equivalent to a mathematical functional specification of suffix arrays, a task that required verifying a wide range of underlying properties of strings and suffixes. We also used Isabelle’s code extraction facilities to extract an executable Haskell implementation of SA-IS, which albeit is inefficient due to using lists and natural numbers rather than arrays and machine words, demonstrates that our verified HOL implementation of SA-IS can be refined to an executable implementation in its current form. |
|---|---|
| AbstractList | Suffix arrays are a data structure with numerous real-world applications. They are extensively used in text retrieval and data compression applications, including query suggestion mechanisms in web search, and in bioinformatics tools for DNA sequencing and matching. This wide applicability means that algorithms for constructing suffix arrays are of great practical importance. The SA-IS algorithm is an efficient but conceptually complex suffix array construction technique, and implementing it requires a deep understanding of its underlying theory. As a critical step towards developing a provably correct and efficient implementation, we have developed the SA-IS algorithm in Isabelle/HOL and formally verified that it is equivalent to a mathematical functional specification of suffix arrays, a task that required verifying a wide range of underlying properties of strings and suffixes. We also used Isabelle’s code extraction facilities to extract an executable Haskell implementation of SA-IS, which albeit is inefficient due to using lists and natural numbers rather than arrays and machine words, demonstrates that our verified HOL implementation of SA-IS can be refined to an executable implementation in its current form. |
| ArticleNumber | 21 |
| Author | Cheung, Louis Moffat, Alistair Rizkallah, Christine |
| Author_xml | – sequence: 1 givenname: Louis surname: Cheung fullname: Cheung, Louis email: lfcheung@student.unimelb.edu.au organization: The University of Melbourne – sequence: 2 givenname: Alistair surname: Moffat fullname: Moffat, Alistair email: ammoffat@unimelb.edu.au organization: The University of Melbourne – sequence: 3 givenname: Christine surname: Rizkallah fullname: Rizkallah, Christine email: christine.rizkallah@unimelb.edu.au organization: The University of Melbourne |
| BookMark | eNqNj0tLAzEYRYNUsK3-AVcDLiX6JWnzWJZiVSi48LENM3nIlDapyQw6_96pU3Anru7m3sM9EzQKMTiELgncEABxmwlIIjDQOQYl2BzLEzQmc8EwcAEjNAbCJRYzxs7QJOcNADACaoyuVzHtyu22K95cqn3tbPHcel9_FYuUyq5YxpCb1JqmjuEcnfpym93FMafodXX3snzA66f7x-VijQ0jvMFUeC4sKcFxB4JL7yRwZgVR3FvpREWckZQbKys_U8QaWnFvmLIUKuE8ZVPEBm4b9mX32b_T-1TvytRpAvrgqwdf3fvqH18t-9XVsNqn-NG63OhNbFPoj2pGGVGSSnVg06FlUsw5Of8_9PFQ7svh3aVf9B-rb7sAdbU |
| Cites_doi | 10.1145/1082036.1082039 10.1038/nmeth.1923 10.1007/3-540-48167-2_6 10.1186/gb-2009-10-3-r25 10.1145/1227161.1278374 10.1007/s10817-025-09735-8 10.1561/2500000045 10.1007/978-3-030-59152-6_2 10.1109/ICSE.2015.85 10.1007/978-3-030-51054-1_18 10.1007/978-3-319-06200-6_4 10.1145/3703595.3705883 10.1007/s10009-014-0308-3 10.1007/s10009-014-0314-5 10.1145/3497775.3503686 10.1137/0206024 10.1017/CBO9780511546853 10.1007/s10009-015-0396-8 10.1145/359842.359859 10.1109/DCC.2009.42 10.1007/978-3-031-69042-6_3 10.1007/978-3-642-12251-4_9 10.1007/3-540-09724-4 10.1145/1242471.1242472 10.1007/3-540-48194-X_17 10.1109/SPIRE.1999.796581 10.1007/978-3-031-57246-3_15 10.1016/j.jda.2004.08.002 10.1016/S1570-8667(03)00065-0 10.1007/978-3-319-43144-4_20 10.1016/J.TCS.2007.07.017 10.1137/0222058 10.1007/978-3-642-32347-8_8 10.1093/bioinformatics/btp324 10.1109/TC.2010.188 10.1007/3-540-45061-0_73 10.1007/S10817-017-9437-1 10.1007/978-3-319-10542-0 10.1007/978-3-319-94205-6_35 10.1007/s10009-013-0293-y 10.1093/bioinformatics/btp336 10.1007/3-540-45949-9 10.1145/800152.804905 10.4230/LIPICS.ITP.2019.22 10.1017/S0956796803000315 10.1016/J.IC.2021.104818 10.1145/3549992 10.1109/SFCS.1997.646102 10.1145/2493175.2493180 10.3233/978-1-58603-976-9-267 10.1145/2951913.2951940 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2025 The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2025 – notice: The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D ADTOC UNPAY |
| DOI | 10.1007/s10817-025-09735-8 |
| DatabaseName | Springer Nature OA Free Journals CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1573-0670 |
| ExternalDocumentID | 10.1007/s10817-025-09735-8 10_1007_s10817_025_09735_8 |
| GrantInformation_xml | – fundername: University of Melbourne |
| GroupedDBID | -~C .86 .DC .VR 06D 0R~ 0VY 199 1N0 203 29J 2J2 2JN 2JY 2KG 2LR 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 78A 8TC 95- 95. 95~ 96X AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYZH ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADIMF ADKFA ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BGNMA BSONS C6C CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI ESBYG FEDTE FERAY FFXSO FIGPU FNLPD FRRFC FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N9A NB0 NPVJJ NQJWS NU0 O93 O9G O9I O9J OAM P19 P2P P9O PF0 PT4 PT5 QOK QOS R89 R9I RHV RNS ROL RPX RSV S16 S1Z S27 S3B SAP SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX VC2 W23 W48 WH7 WK8 YLTOR Z45 ZMTXR ~EX -Y2 1SB 2.D 28- 2P1 2VQ 5QI 6TJ 8FE 8FG AAOBN AARHV AAYTO AAYXX ABJCF ABQSL ABULA ACBXY ADHKG AEBTG AEFIE AEKMD AFEXP AFGCZ AFKRA AGGDS AGQPQ AJBLW ARAPS BBWZM BDATZ BENPR BGLVJ CAG CCPQU CITATION COF EJD FINBP FSGXE H13 HCIFZ K6V K7- KOW L6V M7S N2Q NDZJH O9- OVD P62 PHGZM PHGZT PQGLB PTHSS PUEGO R4E RNI RZC RZE RZK S26 S28 SCJ SCLPG T16 TEORI UZXMN VFIZW 7SC 8FD JQ2 L7M L~C L~D ADTOC UNPAY |
| ID | FETCH-LOGICAL-c316t-27f67d1a0e6e0768fe8063d7196fd8e7b1ec826cd8bf491dc2b6fc39d20b7ef23 |
| IEDL.DBID | C6C |
| ISSN | 0168-7433 1573-0670 |
| IngestDate | Wed Oct 01 16:31:21 EDT 2025 Thu Sep 25 02:52:48 EDT 2025 Wed Oct 01 05:12:20 EDT 2025 Wed Sep 24 02:09:40 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Suffix Array Construction Formal Verification SA-IS Algorithm Isabelle/HOL Data Structures |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c316t-27f67d1a0e6e0768fe8063d7196fd8e7b1ec826cd8bf491dc2b6fc39d20b7ef23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://doi.org/10.1007/s10817-025-09735-8 |
| PQID | 3231982892 |
| PQPubID | 2028908 |
| ParticipantIDs | unpaywall_primary_10_1007_s10817_025_09735_8 proquest_journals_3231982892 crossref_primary_10_1007_s10817_025_09735_8 springer_journals_10_1007_s10817_025_09735_8 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2025-09-01 |
| PublicationDateYYYYMMDD | 2025-09-01 |
| PublicationDate_xml | – month: 09 year: 2025 text: 2025-09-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Dordrecht |
| PublicationPlace_xml | – name: Dordrecht |
| PublicationTitle | Journal of automated reasoning |
| PublicationTitleAbbrev | J Autom Reasoning |
| PublicationYear | 2025 |
| Publisher | Springer Netherlands Springer Nature B.V |
| Publisher_xml | – name: Springer Netherlands – name: Springer Nature B.V |
| References | P Ferragina (9735_CR9) 2005; 52 D Bruns (9735_CR45) 2015; 17 9735_CR22 9735_CR20 9735_CR64 9735_CR65 G Nong (9735_CR6) 2011; 60 9735_CR62 9735_CR63 9735_CR60 9735_CR61 9735_CR28 S Jones (9735_CR23) 2003; 13 G Nong (9735_CR32) 2013; 31 9735_CR26 9735_CR27 R Li (9735_CR13) 2009; 25 9735_CR24 9735_CR25 B Langmead (9735_CR10) 2012; 9 D Nunes (9735_CR35) 2022; 27 U Manber (9735_CR1) 1993; 22 9735_CR34 9735_CR31 MI Abouelhoda (9735_CR2) 2004; 2 B Langmead (9735_CR11) 2009; 10 9735_CR37 9735_CR38 9735_CR36 MA Maniscalco (9735_CR42) 2007; 12 NJ Larsson (9735_CR39) 2007; 387 M Crochemore (9735_CR15) 2007 9735_CR44 RS Boyer (9735_CR55) 1977; 20 9735_CR43 9735_CR40 T Ringer (9735_CR29) 2019; 5 9735_CR41 9735_CR5 9735_CR3 9735_CR49 G Ernst (9735_CR46) 2015; 17 M Burrows (9735_CR7) 1994 9735_CR8 Z Li (9735_CR33) 2022; 285 P Lammich (9735_CR30) 2019; 62 P Ko (9735_CR4) 2005; 3 SJ Puglisi (9735_CR17) 2007; 39 9735_CR56 9735_CR53 9735_CR54 9735_CR51 9735_CR52 9735_CR50 9735_CR19 9735_CR18 9735_CR59 9735_CR16 H Li (9735_CR12) 2009; 25 9735_CR57 9735_CR14 9735_CR58 R Milner (9735_CR21) 1990 M Huisman (9735_CR48) 2015; 17 F Bobot (9735_CR47) 2015; 17 |
| References_xml | – ident: 9735_CR34 – ident: 9735_CR57 – volume: 52 start-page: 552 issue: 4 year: 2005 ident: 9735_CR9 publication-title: Indexing compressed text. Journal of ACM doi: 10.1145/1082036.1082039 – volume: 9 start-page: 357 issue: 4 year: 2012 ident: 9735_CR10 publication-title: Nat. Methods doi: 10.1038/nmeth.1923 – ident: 9735_CR58 doi: 10.1007/3-540-48167-2_6 – volume: 10 start-page: 25 issue: 3 year: 2009 ident: 9735_CR11 publication-title: Genome Biol. doi: 10.1186/gb-2009-10-3-r25 – volume: 12 start-page: 1 year: 2007 ident: 9735_CR42 publication-title: Journal of Experimental Algorithms doi: 10.1145/1227161.1278374 – ident: 9735_CR26 doi: 10.1007/s10817-025-09735-8 – volume: 5 start-page: 102 issue: 2–3 year: 2019 ident: 9735_CR29 publication-title: Foundations and Trends in Programming Languages doi: 10.1561/2500000045 – ident: 9735_CR43 doi: 10.1007/978-3-030-59152-6_2 – ident: 9735_CR28 doi: 10.1109/ICSE.2015.85 – ident: 9735_CR44 – ident: 9735_CR53 doi: 10.1007/978-3-030-51054-1_18 – ident: 9735_CR62 doi: 10.1007/978-3-319-06200-6_4 – ident: 9735_CR38 doi: 10.1145/3703595.3705883 – ident: 9735_CR37 doi: 10.1145/3703595.3705883 – volume: 17 start-page: 677 issue: 6 year: 2015 ident: 9735_CR46 publication-title: Int. J. Softw. Tools Technol. Transfer doi: 10.1007/s10009-014-0308-3 – volume: 17 start-page: 709 issue: 6 year: 2015 ident: 9735_CR47 publication-title: Int. J. Softw. Tools Technol. Transfer doi: 10.1007/s10009-014-0314-5 – ident: 9735_CR56 – ident: 9735_CR8 – ident: 9735_CR27 doi: 10.1145/3497775.3503686 – ident: 9735_CR54 doi: 10.1137/0206024 – volume-title: Algorithms on Strings year: 2007 ident: 9735_CR15 doi: 10.1017/CBO9780511546853 – volume: 17 start-page: 647 issue: 6 year: 2015 ident: 9735_CR48 publication-title: Int. J. Softw. Tools Technol. Transfer doi: 10.1007/s10009-015-0396-8 – volume: 20 start-page: 762 issue: 10 year: 1977 ident: 9735_CR55 publication-title: Commun. ACM doi: 10.1145/359842.359859 – volume-title: A block-sorting lossless data compression algorithm year: 1994 ident: 9735_CR7 – ident: 9735_CR5 doi: 10.1109/DCC.2009.42 – ident: 9735_CR49 doi: 10.1007/978-3-031-69042-6_3 – ident: 9735_CR25 doi: 10.1007/978-3-642-12251-4_9 – ident: 9735_CR24 – ident: 9735_CR20 doi: 10.1007/3-540-09724-4 – volume: 39 start-page: 4 issue: 2 year: 2007 ident: 9735_CR17 publication-title: ACM Computing Survey doi: 10.1145/1242471.1242472 – ident: 9735_CR36 doi: 10.1007/3-540-48194-X_17 – ident: 9735_CR18 doi: 10.1109/SPIRE.1999.796581 – ident: 9735_CR52 doi: 10.1007/978-3-031-57246-3_15 – volume: 3 start-page: 143 issue: 2–4 year: 2005 ident: 9735_CR4 publication-title: Journal of Discrete Algorithms doi: 10.1016/j.jda.2004.08.002 – ident: 9735_CR59 – ident: 9735_CR51 – volume: 2 start-page: 53 issue: 1 year: 2004 ident: 9735_CR2 publication-title: Journal of Discrete Algorithms doi: 10.1016/S1570-8667(03)00065-0 – ident: 9735_CR65 doi: 10.1007/978-3-319-43144-4_20 – volume: 387 start-page: 258 issue: 3 year: 2007 ident: 9735_CR39 publication-title: Theory of Computer Science doi: 10.1016/J.TCS.2007.07.017 – volume: 22 start-page: 935 issue: 5 year: 1993 ident: 9735_CR1 publication-title: SIAM J. Comput. doi: 10.1137/0222058 – ident: 9735_CR63 doi: 10.1007/978-3-642-32347-8_8 – volume: 25 start-page: 1754 issue: 14 year: 2009 ident: 9735_CR12 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btp324 – volume: 60 start-page: 1471 issue: 10 year: 2011 ident: 9735_CR6 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2010.188 – ident: 9735_CR3 doi: 10.1007/3-540-45061-0_73 – volume: 62 start-page: 481 issue: 4 year: 2019 ident: 9735_CR30 publication-title: Journal of Automatic Reasoning doi: 10.1007/S10817-017-9437-1 – ident: 9735_CR16 doi: 10.1007/978-3-319-10542-0 – ident: 9735_CR31 doi: 10.1007/978-3-319-94205-6_35 – volume: 17 start-page: 729 issue: 6 year: 2015 ident: 9735_CR45 publication-title: Int. J. Softw. Tools Technol. Transfer doi: 10.1007/s10009-013-0293-y – volume: 25 start-page: 1966 issue: 15 year: 2009 ident: 9735_CR13 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btp336 – ident: 9735_CR14 doi: 10.1007/3-540-45949-9 – ident: 9735_CR50 – ident: 9735_CR40 doi: 10.1145/800152.804905 – ident: 9735_CR19 – volume-title: Definition of Standard ML year: 1990 ident: 9735_CR21 – ident: 9735_CR61 doi: 10.4230/LIPICS.ITP.2019.22 – volume: 13 start-page: 6 issue: 1 year: 2003 ident: 9735_CR23 publication-title: J. Funct. Program. doi: 10.1017/S0956796803000315 – volume: 285 year: 2022 ident: 9735_CR33 publication-title: Inf. Comput. doi: 10.1016/J.IC.2021.104818 – volume: 27 start-page: 1 year: 2022 ident: 9735_CR35 publication-title: Journal of Experimental Algorithms doi: 10.1145/3549992 – ident: 9735_CR41 doi: 10.1109/SFCS.1997.646102 – volume: 31 start-page: 15 issue: 3 year: 2013 ident: 9735_CR32 publication-title: ACM Transactions on Information Systems doi: 10.1145/2493175.2493180 – ident: 9735_CR60 doi: 10.3233/978-1-58603-976-9-267 – ident: 9735_CR64 doi: 10.1145/2951913.2951940 – ident: 9735_CR22 |
| SSID | ssj0003109 |
| Score | 2.398567 |
| Snippet | Suffix arrays are a data structure with numerous real-world applications. They are extensively used in text retrieval and data compression applications,... |
| SourceID | unpaywall proquest crossref springer |
| SourceType | Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 21 |
| SubjectTerms | Algorithms Arrays Artificial Intelligence Bioinformatics Computer Science Construction Data compression Data structures Gene sequencing Mathematical Logic and Formal Languages Mathematical Logic and Foundations Number theory Symbolic and Algebraic Manipulation |
| Subtitle | Formally Verified Suffix Array Construction |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7M7aAenD9xOqUHb1u2Nknb9DjUIYJD0Mk8laRNQCx1aIfOv95kbbcpIorntAn53kvyPZL3PYATSTQLoFggYgccURo4iCuKEWUiEFwHZLEwyclXA-9iSC9H7qgCZ2UuzOy1e3klmec0GJWmNOuOY9VdSnxjenc1pViN3IyLWEc3r0DNczUjr0JtOLju3eey3kYuc1ZR3nF9U8jAt4vcme87-nw-LUjn_J50HVYn6ZhPX3mSLB1F_TrIchL5C5THziQTnej9i77jf2e5CRsFV7V6uXNtQUWm21Av60BYxbawA62-Ib5JMrXutD8rTWqtm4lSD2_612c-tUxR0FKmdheG_fPb0wtUFGFAEXG8DGFfeX7scFt60tzaKck0q4l9vXJVzKQvHBnpECWKmVDa0nGETfoQCWJsC18qTPagmj6lch8sabT3jN4ZoYpK4XFFAhYpFgWBIIT6DWiV0IfjXGsjXKgqGyxCjUU4wyJkDWiW1gmLdfcSEk1XAxNE4ga0S4AXzT_11p5b9ReDH_zt80NYw7kZke00oaoxl0eazGTiuPDVD-bz6BI priority: 102 providerName: Unpaywall |
| Title | Formally Verified Suffix Array Construction |
| URI | https://link.springer.com/article/10.1007/s10817-025-09735-8 https://www.proquest.com/docview/3231982892 https://link.springer.com/content/pdf/10.1007/s10817-025-09735-8.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 69 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1573-0670 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003109 issn: 1573-0670 databaseCode: AFBBN dateStart: 19970201 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1573-0670 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003109 issn: 1573-0670 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1573-0670 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003109 issn: 1573-0670 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB20PagHv8VqLTl4axeS3W2yOYbSWhSLoJH2FLLJLgghFm3R_ntnm6RVEdFLDgk7gbezO28Y5g3ApWLIAjiVhNl-TDj3HRJrTgkX0pcxJmSpNM3JtyN3GPLrcXdcyuSYXphv9XvT4ibwHjVDV42wTJeITahjkHKXhVm3t7p1jcJloeNt9DEZKxtkfrbxNQitmeWqGLoDW_N8Gi_e4iz7FG8G-7BbEkUrKHb2ADZUfgh71RAGqzyTR9AeGNaZZQvrEZ1JI6O07udaP73j0pd4YZmJnJVG7DGEg_5Db0jKCQgkYY47I9TTrpc6sa1cZUpmWgmkFKmHx0anQnnSUQnmB0kqpEaY04Sa3h3mp9SWntKUnUAtf87VKVjKCN8ZsTHGNVfSjTXzRaJF4vuSMe41oF1BEk0LoYtoLWlsAIwQwGgJYCQa0KxQi0qnf40YckXfZHC0AZ0KyfXn36x1Vmj_4edn_7N-Dtu02HtiO02oIebqApnETLagHlxNbvqtpSvhM6QBvgtHd8HkA9mUv54 |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH9ROKAH8TOiqDt4g5KtLVt3JAZE-bgIBk_LurWJcZlEIIp_vS3bAI0xcl72ur2v_l7a93sA14IoFEAxR8R0fUSpayFfUowo4y73VUEWct2c3Ovb7SG9H9VHaVPYJLvtnh1JLjL1WrMbUxlVj1_VFDN1xLYhT1WBgnOQb9w-dZrLDKzZLhNOb82VSUjaLPO7lO8b0gplLg9Gd6Ewi8f-_N2PorW9p1WEYfbVyZWTl9psymvB5w9Cx01_ax_2UjBqNBLvOYAtER9CMRv0YKRxfwSVlka2UTQ3HpXDSoVajYeZlM8f6tU3f27oqZ8ZD-0xDFvNwU0bpVMWUEAse4qwI20ntHxT2EIfy0nBFGwJHRWaMmTC4ZYIVA0ShIxLZcowwLo_iLghNrkjJCYnkItfY3EKhtDkeprQjFBJBbd9SVwWSBa4LieEOiWoZKr2xgmZhreiTdZ68JQevIUePFaCcmYNLw2siUcUHnV1lYhLUM0Uunr8l7Tq0or_WPxsM-lXUGgPel2ve9fvnMMOTsyJTKsMOaV_caGQy5Rfpo76BQ0P34E |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFL3oBD8e_BanU_vg2xbWJlmbPsp0zK8h6GRvIWkSEEoduqH79yZru00Q0deW3sLpvcm5pOdcgHNNLAugWCLixwJRGgdIGIoRZTKWwjZkSjpx8n0v7PbpzaA1WFDxT_92L48kc02Dc2nKRs2hMs0F4Ruzq6sbxersZlqILcMKtdfcDIN22J6txc73Mnf3dq6ZhBSymZ9jfN-a5nxzdkS6AWvjbCgmHyJNF3ahzjZsFvTRu8i_9w4s6WwXtsrRDF5RqXtQ7zgumqYT79mmmLE803scG_PyaR99ExPPzeksnWP3od-5emp3UTEXASUkCEcIRyaMVCB8HWp3kGY0s0RDRbaYjGI6koFObNeQKCaNBV8l2Cl6SKywLyNtMDmASvaa6UPwtLPDcxZkhBqqZSgMiVliWBLHkhAaVaFeQsKHuf0FnxsdOwC5BZBPAeSsCrUSNV6UwjsnlkHGrq_DVWiUSM5v_xatMUP7Dy8_-l_0M1h9uOzwu-ve7TGs4zwNkB_UoGLh1yeWaozk6TSbvgAAEcan |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7M7aAenD9xOqUHb1u2Nknb9DjUIYJD0Mk8laRNQCx1aIfOv95kbbcpIorntAn53kvyPZL3PYATSTQLoFggYgccURo4iCuKEWUiEFwHZLEwyclXA-9iSC9H7qgCZ2UuzOy1e3klmec0GJWmNOuOY9VdSnxjenc1pViN3IyLWEc3r0DNczUjr0JtOLju3eey3kYuc1ZR3nF9U8jAt4vcme87-nw-LUjn_J50HVYn6ZhPX3mSLB1F_TrIchL5C5THziQTnej9i77jf2e5CRsFV7V6uXNtQUWm21Av60BYxbawA62-Ib5JMrXutD8rTWqtm4lSD2_612c-tUxR0FKmdheG_fPb0wtUFGFAEXG8DGFfeX7scFt60tzaKck0q4l9vXJVzKQvHBnpECWKmVDa0nGETfoQCWJsC18qTPagmj6lch8sabT3jN4ZoYpK4XFFAhYpFgWBIIT6DWiV0IfjXGsjXKgqGyxCjUU4wyJkDWiW1gmLdfcSEk1XAxNE4ga0S4AXzT_11p5b9ReDH_zt80NYw7kZke00oaoxl0eazGTiuPDVD-bz6BI |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Formally+Verified+Suffix+Array+Construction&rft.jtitle=Journal+of+automated+reasoning&rft.au=Cheung%2C+Louis&rft.au=Moffat%2C+Alistair&rft.au=Rizkallah%2C+Christine&rft.date=2025-09-01&rft.pub=Springer+Netherlands&rft.issn=0168-7433&rft.eissn=1573-0670&rft.volume=69&rft.issue=3&rft_id=info:doi/10.1007%2Fs10817-025-09735-8&rft.externalDocID=10_1007_s10817_025_09735_8 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0168-7433&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0168-7433&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0168-7433&client=summon |