more

main.blg

@@ -8,6 +8,14 @@ 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 49 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
+Repeated entry---line 61 of file main.bib
+ : @inproceedings{Pacheco2022
+ :                           , address={San Francisco, CA, USA}, title={Automated Attack Synthesis by Extracting Finite State Machines from Protocol Specification Documents}, ISBN={978-1-66541-316-9}, url={https://ieeexplore.ieee.org/document/9833673/}, DOI={10.1109/SP46214.2022.9833673}, abstractNote={Automated attack discovery techniques, such as attacker synthesis or model-based fuzzing, provide powerful ways to ensure network protocols operate correctly and securely. Such techniques, in general, require a formal representation of the protocol, often in the form of a finite state machine (FSM). Unfortunately, many protocols are only described in English prose, and implementing even a simple network protocol as an FSM is time-consuming and prone to subtle logical errors. Automatically extracting protocol FSMs from documentation can significantly contribute to increased use of these techniques and result in more robust and secure protocol implementations.}, booktitle={2022 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Pacheco, Maria Leonor and Hippel, Max Von and Weintraub, Ben and Goldwasser, Dan and Nita-Rotaru, Cristina}, year={2022}, month=may, pages={51–68}, language={en} }
+I'm skipping whatever remains of this entry
 -- 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.
@@ -22,48 +30,51 @@ 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
-Warning--empty booktitle in Vardi_Wolper_1986
+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
 
 Done.
-You've used 12 entries,
+You've used 17 entries,
             4087 wiz_defined-function locations,
-            897 strings with 9252 characters,
-and the built_in function-call counts, 6235 in all, are:
-= -- 497
-> -- 129
-< -- 11
-+ -- 60
-- -- 30
-* -- 350
-:= -- 993
-add.period$ -- 26
-call.type$ -- 12
-change.case$ -- 12
+            935 strings with 10819 characters,
+and the built_in function-call counts, 9675 in all, are:
+= -- 780
+> -- 228
+< -- 14
++ -- 108
+- -- 54
+* -- 546
+:= -- 1511
+add.period$ -- 38
+call.type$ -- 17
+change.case$ -- 19
 chr.to.int$ -- 0
-cite$ -- 24
-duplicate$ -- 541
-empty$ -- 538
-format.name$ -- 39
-if$ -- 1408
+cite$ -- 32
+duplicate$ -- 827
+empty$ -- 811
+format.name$ -- 66
+if$ -- 2203
 int.to.chr$ -- 0
-int.to.str$ -- 12
-missing$ -- 96
-newline$ -- 65
-num.names$ -- 12
-pop$ -- 257
+int.to.str$ -- 17
+missing$ -- 158
+newline$ -- 88
+num.names$ -- 17
+pop$ -- 417
 preamble$ -- 1
 purify$ -- 0
 quote$ -- 2
-skip$ -- 476
+skip$ -- 729
 stack$ -- 0
-substring$ -- 81
-swap$ -- 367
-text.length$ -- 11
+substring$ -- 135
+swap$ -- 582
+text.length$ -- 14
 text.prefix$ -- 0
 top$ -- 5
-type$ -- 12
-warning$ -- 12
-while$ -- 16
-width$ -- 14
-write$ -- 126
-(There were 12 warnings)
+type$ -- 17
+warning$ -- 15
+while$ -- 24
+width$ -- 19
+write$ -- 181
+(There were 2 error messages)