diff --git a/publications/publications.bib b/publications/publications.bib
index fdc92384961c466e9ed99280f6e0cd8c8207a998..1199cb1581019fb59d096f767be283430960de47 100644
--- a/publications/publications.bib
+++ b/publications/publications.bib
@@ -509,38 +509,38 @@ Building on separation logic with concurrent abstract predicates (CAP), we intro
   Project                  = { concurrency, tada }
 }
 
-@inproceedings{DBLP:conf/aplas/RaadHVG16,
-  author    = {Azalea Raad and
+@inproceedings{Raad2016Verifying,
+  Title     = {Verifying Concurrent Graph Algorithms},
+  Author    = {Azalea Raad and
                Aquinas Hobor and
                Jules Villard and
                Philippa Gardner},
-  title     = {Verifying Concurrent Graph Algorithms},
-  booktitle = {Programming Languages and Systems - 14th Asian Symposium, {APLAS}
+
+  Booktitle = {Programming Languages and Systems - 14th Asian Symposium, {APLAS}
                2016, Hanoi, Vietnam, November 21-23, 2016, Proceedings},
-  pages     = {314--334},
-  year      = {2016},
-  crossref  = {DBLP:conf/aplas/2016},
+  Year      = {2016},
+  Pages     = {314--334},
   url       = {http://dx.doi.org/10.1007/978-3-319-47958-3_17},
   doi       = {10.1007/978-3-319-47958-3_17},
-  timestamp = {Mon, 10 Oct 2016 15:12:54 +0200},
-  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/aplas/RaadHVG16},
-  bibsource = {dblp computer science bibliography, http://dblp.org}
+  Project   = { concurrency },
+  
+  Abstract  = {We show how to verify four challenging concurrent finegrained graph-manipulating algorithms, including graph copy, a speculatively parallel Dijkstra, graph marking and spanning tree. We develop a reasoning method for such algorithms that dynamically tracks the contributions and responsibilities of each thread operating on a graph, even in cases of arbitrary recursive thread creation. We demonstrate how to use a logic without abstraction (CoLoSL) to carry out abstract reasoning in the style of iCAP, by building the abstraction into the proof structure rather than incorporating it into the semantic model of the logic.} 
 }
 
-@inproceedings{DBLP:conf/aplas/RaadSG16,
-  author    = {Azalea Raad and
+@inproceedings{Raad2016DOM,
+ Title     = {{DOM:} Specification and Client Reasoning},
+ Author    = {Azalea Raad and
                Jos{\'{e}} Fragoso Santos and
                Philippa Gardner},
-  title     = {{DOM:} Specification and Client Reasoning},
-  booktitle = {Programming Languages and Systems - 14th Asian Symposium, {APLAS}
+ 
+  Booktitle = {Programming Languages and Systems - 14th Asian Symposium, {APLAS}
                2016, Hanoi, Vietnam, November 21-23, 2016, Proceedings},
-  pages     = {401--422},
-  year      = {2016},
-  crossref  = {DBLP:conf/aplas/2016},
+  Year      = {2016},
+  Pages     = {401--422},
   url       = {http://dx.doi.org/10.1007/978-3-319-47958-3_21},
   doi       = {10.1007/978-3-319-47958-3_21},
-  timestamp = {Mon, 10 Oct 2016 15:12:54 +0200},
-  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/aplas/RaadSG16},
-  bibsource = {dblp computer science bibliography, http://dblp.org}
+  Project   = { concurrency },
+  
+  Abstract  = {We present an axiomatic specication of a key fragment of DOM using structural separation logic. This specication allows us to develop modular reasoning about client programs that call the DOM.}
 }