TACAS26

Author: kondylidou

_bibliography/papers.bib

@@ -76,7 +76,11 @@ @incollection{tacas2025
 
 @unpublished{draft_tacas2026,
   author    = {Lydia Kondylidou and Andrew Reynolds and Jasmin Blanchette and Cesare Tinelli},
-  title     = {Enumerating Choice Terms in Model-Based Quantifier Instantiation (Work in progress)},
+  title     = {Enumerating Choice Terms in Model-Based Quantifier Instantiation},
+  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems},
+  series    = {Lecture Notes in Computer Science},
+  publisher = {Springer},
+  year      = {2026},
   abstract  = {Satisfiability modulo theories (SMT) solvers are widely used
 for determining the satisfiability of logical formulas with respect to back-
 ground theories. SMT solvers are traditionally based on first-order logic, but