This is BibTeX, Version 0.99d (TeX Live 2024/Arch Linux) Capacity: max_strings=200000, hash_size=200000, hash_prime=170003 The top-level auxiliary file: main.aux The style file: IEEEtran.bst Reallocated singl_function (elt_size=8) to 100 items from 50. Reallocated singl_function (elt_size=8) to 100 items from 50. Reallocated singl_function (elt_size=8) to 100 items from 50. Reallocated wiz_functions (elt_size=8) to 6000 items from 3000. Reallocated singl_function (elt_size=8) to 100 items from 50. Database file #1: main.bib Repeated entry---line 97 of file main.bib : @article{Kobeissi_Nicolas_Tiwari : , title={Verifpal: Cryptographic Protocol Analysis for the Real World}, abstractNote={Verifpal is a new automated modeling framework and verifier for cryptographic protocols, optimized with heuristics for common-case protocol specifications, that aims to work better for real-world practitioners, students and engineers without sacrificing comprehensive formal verification features. In order to achieve this, Verifpal introduces a new, intuitive language for modeling protocols that is easier to write and understand than the languages employed by existing tools. Its formal verification paradigm is also designed explicitly to provide protocol modeling that avoids user error. Verifpal is able to model protocols under an active attacker with unbounded sessions and fresh values, and supports queries for advanced security properties such as forward secrecy or key compromise impersonation. Furthermore, Verifpal’s semantics have been formalized within the Coq theorem prover, and Verifpal models can be automatically translated into Coq as well as into ProVerif models for further verification. Verifpal has already been used to verify security properties for Signal, Scuttlebutt, TLS 1.3 as well as the first formal model for the DP-3T pandemic-tracing protocol, which we present in this work. Through Verifpal, we show that advanced verification with formalized semantics and sound logic can exist without any expense towards the convenience of real-world practitioners.}, author={Kobeissi, Nadim and Nicolas, Georgio and Tiwari, Mukesh}, language={en} } I'm skipping whatever remains of this entry Repeated entry---line 115 of file main.bib : @article{Clarke_Wang : , title={25 Years of Model Checking}, abstractNote={Model Checking is an automatic verification technique for large state transition systems. It was originally developed for reasoning about finite-state concurrent systems. The technique has been used successfully to debug complex computer hardware, communication protocols, and software. It is beginning to be used for analyzing cyberphysical, biological, and financial systems as well. The major challenge for the technique is a phenomenon called the State Explosion Problem. This issue is impossible to avoid in the worst case; but, by using sophisticated data structures and clever search algorithms, it is now possible to verify state transition systems with an astronomical number of states. In this paper, we will briefly review the development of Model Checking over the past 32 years, with an emphasis on model checking stochastic hybrid systems.}, author={Clarke, Edmund M and Wang, Qinsi}, language={en} } I'm skipping whatever remains of this entry Warning--I didn't find a database entry for "Blanchet_Smyth_Cheval_Sylvestre" -- IEEEtran.bst version 1.14 (2015/08/26) by Michael Shell. -- http://www.michaelshell.org/tex/ieeetran/bibtex/ -- See the "IEEEtran_bst_HOWTO.pdf" manual for usage information. Warning--empty journal in Clarke_Wang Warning--empty year in Clarke_Wang Warning--empty journal in Kobeissi_Nicolas_Tiwari Warning--empty year in Kobeissi_Nicolas_Tiwari Warning--empty journal in Blanchet_Jacomme Warning--empty year in Blanchet_Jacomme Warning--empty journal in Basin_Linker_Sasse Warning--empty year in Basin_Linker_Sasse Warning--empty journal in Hippel2022_anonym Warning--empty journal in Wilcox_Woos_Panchekha_Tatlock_Wang_Ernst_Anderson Warning--empty year in Wilcox_Woos_Panchekha_Tatlock_Wang_Ernst_Anderson Warning--empty journal in Ongaro Warning--empty year in Ongaro Warning--empty journal in Proverif Warning--empty year in Proverif Warning--empty journal in Pereira Warning--empty year in Pereira Warning--empty journal in Ginesin Done. You've used 32 entries, 4087 wiz_defined-function locations, 1049 strings with 14007 characters, and the built_in function-call counts, 19759 in all, are: = -- 1710 > -- 401 < -- 37 + -- 190 - -- 95 * -- 1049 := -- 3038 add.period$ -- 71 call.type$ -- 32 change.case$ -- 32 chr.to.int$ -- 0 cite$ -- 50 duplicate$ -- 1683 empty$ -- 1664 format.name$ -- 116 if$ -- 4620 int.to.chr$ -- 0 int.to.str$ -- 32 missing$ -- 301 newline$ -- 149 num.names$ -- 32 pop$ -- 755 preamble$ -- 1 purify$ -- 0 quote$ -- 2 skip$ -- 1598 stack$ -- 0 substring$ -- 339 swap$ -- 1240 text.length$ -- 37 text.prefix$ -- 0 top$ -- 5 type$ -- 32 warning$ -- 18 while$ -- 51 width$ -- 34 write$ -- 345 (There were 2 error messages)