feat: a LOT of stuff (final report, examples, simulation of a single assert, move from node instances to node definitions, etc.)

doc/sources.bib

@@ -212,3 +212,91 @@
 	volume = {4},
 	year = {1953},
 }
+@article{cit:assertion_hist,
+	title = {A historical perspective on runtime assertion checking in software
+	         development},
+	volume = {31},
+	ISSN = {0163-5948},
+	DOI = {10.1145/1127878.1127900},
+	abstractNote = {This report presents initial results in the area of software
+	                testing and analysis produced as part of the Software
+	                Engineering Impact Project. The report describes the
+	                historical development of runtime assertion checking,
+	                including a description of the origins of and significant
+	                features associated with assertion checking mechanisms, and
+	                initial findings about current industrial use. A future
+	                report will provide a more comprehensive assessment of
+	                development practice, for which we invite readers of this
+	                report to contribute information.},
+	number = {3},
+	journal = {ACM SIGSOFT Software Engineering Notes},
+	author = {Clarke, Lori A. and Rosenblum, David S.},
+	year = {2006},
+	month = may,
+	pages = {25–37},
+	language = {en},
+}
+@article{cit:assertion_axiom,
+	title = {An axiomatic basis for computer programming},
+	volume = {12},
+	ISSN = {0001-0782},
+	DOI = {10.1145/363235.363259},
+	abstractNote = {In this paper an attempt is made to explore the logical
+	                foundations of computer programming by use of techniques
+	                which were first applied in the study of geometry and have
+	                later been extended to other branches of mathematics. This
+	                involves the elucidation of sets of axioms and rules of
+	                inference which can be used in proofs of the properties of
+	                computer programs. Examples are given of such axioms and
+	                rules, and a formal proof of a simple theorem is displayed.
+	                Finally, it is argued that important advantage, both
+	                theoretical and practical, may follow from a pursuance of
+	                these topics.},
+	number = {10},
+	journal = {Commun. ACM},
+	author = {Hoare, C. A. R.},
+	year = {1969},
+	month = oct,
+	pages = {576–580},
+}
+@article{cit:assertion_lustre,
+	title = {Programming and verifying real-time systems by means of the
+	         synchronous data-flow language LUSTRE},
+	volume = {18},
+	rights = {
+	          https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
+	          },
+	ISSN = {00985589},
+	DOI = {10.1109/32.159839},
+	number = {9},
+	journal = {IEEE Transactions on Software Engineering},
+	author = {Halbwachs, N. and Lagnier, F. and Ratel, C.},
+	year = {1992},
+	month = sep,
+	pages = {785–793},
+}
+@inbook{cit:hyb_auto,
+	address = {Berlin, Heidelberg},
+	title = {The Theory of Hybrid Automata},
+	ISBN = {978-3-642-59615-5},
+	url = {https://doi.org/10.1007/978-3-642-59615-5_13},
+	DOI = {10.1007/978-3-642-59615-5_13},
+	abstractNote = {A hybrid automaton is a formal model for a mixed
+	                discrete-continuous System. W e classify hybrid automata
+	                acoording to what questions about their behavior can be
+	                answered algorithmically. The Classification reveals
+	                structure on mixed discrete-continuous State Spaces that was
+	                previously studied on purely discrete state Spaces only. In
+	                particular, various classes of hybrid automata induce
+	                finitary trace equivalence (or similarity, or bisimilarity)
+	                relations on an uncountable State space, thus permitting the
+	                application of various model-checking techniques that were
+	                originally developed for finitestate Systems.},
+	booktitle = {Verification of Digital and Hybrid Systems},
+	publisher = {Springer},
+	author = {Henzinger, Thomas A.},
+	editor = {Inan, M. Kemal and Kurshan, Robert P.},
+	year = {2000},
+	pages = {265–292},
+	language = {en},
+}