Update 2018-07-16-seminar.md

_posts/2018-07-16-seminar.md

@@ -14,7 +14,7 @@ to the environment as a result of interference by the intruder?
 This project's goal is to develop a new algorithm to verify secrecy of cryptographic 
 protocols with unbounded sessions and nonces.
 The novelty of the approach, based on a new decidability result 
-by [D'Osualdo et al.(CSF17)](http://vtss.doc.ic.ac.uk/publications/DOsualdo2017Deciding.html), 
+by [D'Osualdo et al. (CSF17)](http://vtss.doc.ic.ac.uk/publications/DOsualdo2017Deciding.html), 
 is in how the unboundedness caused by the use of unlimited nonces can be tamed 
 algorithmically. We will present a new verification algorithm for secrecy based 
 on symbolic representations of inductive invariants of protocols. 
\ No newline at end of file