diff --git a/publications/publications.bib b/publications/publications.bib
index f5ad590f7fcb954a376d6b1fc9e689effe1f2c0a..bc64dbd0d6d029dc8a1ea35fe8a0f1adc4d8bac6 100644
--- a/publications/publications.bib
+++ b/publications/publications.bib
@@ -554,7 +554,7 @@ Building on separation logic with concurrent abstract predicates (CAP), we intro
   Year                     = {2017},
   Month                    = {April},
 
-  Abstract                 = {Despite recent advances in reasoning about concurrent data structure libraries, the largest implementations in \texttt{java.util.concurrent} have yet to be verified. The key issue lies in the development of modular specifications, which provide clear logical boundaries between clients and implementations. A solution is to use recent advances in fine-grained concurrency reasoning, in particular the introduction of abstract atomicity to concurrent separation logic reasoning. We present two specifications of concurrent maps, both providing the clear boundaries we seek. We show that these specifications are equivalent, in that they can be built from each other. We show how we can verify client programs, such as a concurrent set and a producer-consumer client. We also give a substantial first proof that the main operations of \texttt{ConcurrentSkipListMap} in \texttt{java.util.concurrent} satisfy the map specification. This work demonstrates that we now have the technology to verify the largest implementations in \texttt{java.util.concurrent}.},
+  Abstract                 = {Despite recent advances in reasoning about concurrent data structure libraries, the largest implementations in java.util.concurrent have yet to be verified. The key issue lies in the development of modular specifications, which provide clear logical boundaries between clients and implementations. A solution is to use recent advances in fine-grained concurrency reasoning, in particular the introduction of abstract atomicity to concurrent separation logic reasoning. We present two specifications of concurrent maps, both providing the clear boundaries we seek. We show that these specifications are equivalent, in that they can be built from each other. We show how we can verify client programs, such as a concurrent set and a producer-consumer client. We also give a substantial first proof that the main operations of ConcurrentSkipListMap in java.util.concurrent satisfy the map specification. This work demonstrates that we now have the technology to verify the largest implementations in java.util.concurrent.},
 
   Project                  = { concurrency, tada }
 }