publications.bib fix

publications/publications.bib

@@ -656,7 +656,7 @@ @inproceedings{tacas2024theta
     editor       = {Bernd Finkbeiner and Laura Kov{\'{a}}cs},
     abstract     = {Theta is a model checking framework, with a strong emphasis on efectively handling concurrency in software using abstraction refnement algorithms. In SV-COMP 2024, we use 1) an abstraction-aware partial order reduction; 2) a dynamic statement reduction technique; and 3) enhanced support for call stacks to handle recursive programs. We integrate these techniques in an improved architecture with inherent support for portfolio-based verifcation using dynamic algorithm selection, with a diverse selection of supported SMT solvers as well. In this paper we detail the advances of Theta regarding concurrent and recursive software support.},
     url_pdf      = {tacas2024theta.pdf},
-	type         = {Conference}
+	type         = {Conference},
 }
 
 @inproceedings{tacas2024emergentheta,
@@ -672,7 +672,7 @@ @inproceedings{tacas2024emergentheta
     editor       = {Bernd Finkbeiner and Laura Kov{\'{a}}cs},
     abstract     = {Theta is a model checking framework conventionally based on abstraction refnement techniques. While abstraction is useful for a large number of verifcation problems, the over-reliance on the technique led to Theta being unable to meaningfully adapt. Identifying this problem in previous years of SV-COMP has led us to create EmergenTheta, a sandbox for the new approaches we want Theta to support. By diferentiating between mature and emerging techniques, we can experiment more freely without hurting the reliability of the overall framework. In this paper we detail the development route to EmergenTheta, and its frst debut on SV-COMP'24 in the ReachSafety category.},
     url_pdf      = {tacas2024emergentheta.pdf},
-	type         = {Conference}
+	type         = {Conference},
 }
 
 @misc{telbiszcsMsc2024,