From ba8bdeb4d44355d8dec9978faa0a20efc9e6079f Mon Sep 17 00:00:00 2001
From: Pedro da Rocha Pinto <pmd09@doc.ic.ac.uk>
Date: Thu, 11 Feb 2016 13:50:27 +0000
Subject: [PATCH] Corrected bibtex.
---
publications/publications.bib | 1 -
1 file changed, 1 deletion(-)
diff --git a/publications/publications.bib b/publications/publications.bib
index 489b4da..4df8906 100644
--- a/publications/publications.bib
+++ b/publications/publications.bib
@@ -609,7 +609,6 @@ Building on separation logic with concurrent abstract predicates (CAP), we intro
Booktitle = {Proceedings of the 25\textsuperscript{th} European Symposium on Programming ({ESOP})},
Year = {2016},
Month = {April},
- Pages = {207--231},
Abstract = {We present Total-TaDA, a program logic for verifying the total correctness of concurrent programs: that such programs both terminate and produce the correct result. With Total-TaDA, we can specify constraints on a thread's concurrent environment that are necessary to guarantee termination. This allows us to verify total correctness for non-blocking algorithms, e.g. a counter and a stack. Our specifications can express lock- and wait-freedom. More generally, they can express that one operation cannot impede the progress of another, a new non-blocking property we call non-impedance. Moreover, our approach is modular. We can verify the operations of a module independently, and build up modules on top of each other.},
--
GitLab