updated file to deal with figures better, commit before last edits

mso/thesis-modal-master/paper.bib

@@ -2,7 +2,7 @@ @article{kneis
 author={Kneis,J. and Langer,A. and Rossmanith,P.},
 year={2011},
 title={Courcelle's theorem-A game-theoretic approach},
-journal={DISCRETE OPTIMIZATION},
+journal={Discrete Optimization},
 volume={8},
 number={4},
 pages={568-594},
@@ -50,7 +50,7 @@ @article{flyaut
 author={Courcelle,B. and Durand,I.},
 year={2012},
 title={Automata for the verification of monadic second-order graph properties},
-journal={JOURNAL OF APPLIED LOGIC},
+journal={Journal of Applied Logic},
 volume={10},
 number={4},
 pages={368-409},
@@ -80,9 +80,9 @@ @article{martin
 
 @article{graphminor,
 author={Lovasz,L.},
-year={2006;2005;},
+year={2005},
 title={Graph minor theory},
-journal={BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY},
+journal={Bulletin of the American Mathematical Society},
 volume={43},
 number={1},
 pages={75-86},
@@ -136,8 +136,8 @@ @inbook{databases
 author={Grohe,M. and Marino,J.},
 year={1999},
 title={Definability and descriptive complexity on databases of bounded tree-width},
-publisher={SPRINGER-VERLAG BERLIN},
-address={BERLIN},
+publisher={Springer Berlin Heidelberg},
+address={Berlin},
 volume={1540},
 pages={70-82},
 isbn={0302-9743},
@@ -159,12 +159,12 @@ @book{graphrewrite
 year={2012},
 title={Graph structure and monadic second-order logic: a language-theoretic approach},
 publisher={Cambridge University Press},
-address={Cambridge;New York;},
+address={Cambridge;},
 volume={138;138.;},
 isbn={9780521898331;0521898331;},
 }
 @Manual{monamanual2001,
-  author =       {Nils Klarlund and Anders M{\''{o}}ller},
+  author =       {Nils Klarlund and Anders Moller},
   title =        {{MONA Version 1.4 User Manual}},
   organization = {BRICS, Department of Computer Science, Aarhus University},
   month =        {January},
@@ -264,3 +264,70 @@ @phdthesis{agda
   school       = {Goteborg University},
   year         = 2007,
 }
+
+@Article{historyulf,
+author="Geuvers, H.",
+title="Proof assistants: History, ideas and future",
+journal="Sadhana",
+year="2009",
+volume="34",
+number="1",
+pages="3--25",
+}
+
+@inproceedings{jordan,
+  title={A Proof of the Jordan Curve Theorem via the Brouwer Fixed Point Theorem},
+  author={Artur Kornilowicz},
+  year={2008}
+}
+@Inbook{intel,
+author="Grundy, Jim",
+editor="Aagaard, Mark
+and Harrison, John",
+title="Verified Optimizations for the Intel IA-64 Architecture",
+bookTitle="Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14--18, 2000 Proceedings",
+year="2000",
+publisher="Springer Berlin Heidelberg",
+address="Berlin, Heidelberg",
+pages="215--232",
+}
+
+
+@Inbook{nasa,
+author="Mu{\~{n}}oz, C{\'e}sar
+and Carre{\~{n}}o, V{\'i}ctor
+and Dowek, Gilles",
+editor="Butler, Michael
+and Jones, Cliff B.
+and Romanovsky, Alexander
+and Troubitsyna, Elena",
+title="Formal Analysis of the Operational Concept for the Small Aircraft Transportation System",
+bookTitle="Rigorous Development of Complex Fault-Tolerant Systems",
+year="2006",
+publisher="Springer Berlin Heidelberg",
+address="Berlin, Heidelberg",
+pages="306--325",
+}
+
+@Inbook{color,
+author="Gonthier, Georges",
+editor="Kapur, Deepak",
+title="The Four Colour Theorem: Engineering of a Formal Proof",
+bookTitle="Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers",
+year="2008",
+publisher="Springer Berlin Heidelberg",
+address="Berlin, Heidelberg",
+pages="333--333",
+}
+
+@article{seymour,
+title = "Graph minors. II. Algorithmic aspects of tree-width",
+journal = "Journal of Algorithms",
+volume = "7",
+number = "3",
+pages = "309 - 322",
+year = "1986",
+note = "",
+author = "Neil Robertson and P. D. Seymour",
+
+}