publications.bib

@@ -149,21 +149,15 @@ We present JSCert, a formalisation of the current ECMA standard in the Coq proof
   project   = {concurrency},
 }
 
-@InProceedings{DBLP:conf/cade/SantosGMN17,
-  author    = {Jos{\'{e}} Fragoso Santos and Philippa Gardner and Petar Maksimovic and Daiva Naudziuniene},
-  title     = {Towards Logic-Based Verification of JavaScript Programs},
-  booktitle = {Automated Deduction - {CADE} 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings},
+@InProceedings{FragosoSantos2017Towards,
+  author    = {Jos{\'{e}} {Fragoso Santos} and Philippa Gardner and Petar Maksimovi\'{c} and Daiva Naud\v{z}i\={u}nien\.{e}},
+  title     = {{Towards Logic-based Verification of JavaScript Programs}},
+  booktitle = {Proceedings of 26\textsuperscript{th} Conference on Automated Deduction {(CADE 26)}},
   year      = {2017},
-  editor    = {Leonardo de Moura},
-  volume    = {10395},
-  series    = {Lecture Notes in Computer Science},
-  pages     = {8--25},
-  publisher = {Springer},
-  bibsource = {dblp computer science bibliography, http://dblp.org},
-  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/cade/SantosGMN17},
-  doi       = {10.1007/978-3-319-63046-5_2},
-  timestamp = {Wed, 12 Jul 2017 10:06:41 +0200},
-  url       = {https://doi.org/10.1007/978-3-319-63046-5_2},
+  month     = aug,
+  abstract  = {In this position paper, we argue for what we believe is a correct pathway to achieving scalable symbolic verification of JavaScript based on separation logic. We highlight the difficulties imposed by the language, the current state-of-the-art in the literature, and the  sequence of steps that needs to be taken. We briefly describe \javert, our semi-automatic toolchain for JavaScript verification.},
+  file      = {FragosoSantos2017Towards.pdf:FragosoSantos2017Towards.pdf:PDF},
+  project   = {web},
 }
 
 @InProceedings{DBLP:conf/aplas/RaadSG16,