Description
Leader of the group Computer Security: Marten van Dijk.
The Computer Security group contributes to making our society a safe place with digital and physical infrastructures that can be trusted to have the best interest of citizens and industry in mind. Our work constructively contributes new mechanisms and solutions to security problems.
We are committed to bringing rigorous cryptographic style thinking to security engineering. We study, analyze, and design secure computing environments from various perspectives such as secure processor architectures and cyber physical system security but also secure machine learning functionalities. We provide a holistic approach and use various techniques for reasoning about security, safety, and resilience ranging from formal methods to cryptographic proofs.
Vacancies
No vacancies currently.
News
Better parallel programming with help of ABS language
Current programming languages cannot use the full potential power of manycore chips. Keyvan Azadbakht studied the formal programming language ABS and extended the programming model and analysis techniques. He defended his PhD thesis on 11 December.
Grant for CWI to improve Next Generation Internet
NLnet Foundation awarded CWI with a grant to develop a replacement for a decades-old application programming technique for communication on the internet. This might result in an alternative to deep packet inspection for network operators that better protects privacy for users.
Symposium celebrating life and achievements of Farhad Arbab
On Friday 25 May 2018 CWI organizes a farewell symposium on the occasion of the retirement of Farhad Arbab, ‘It's All About Coordination’. Farhad Arbab has been a researcher at CWI for 28 years and a professor at Leiden University since 2004. He is most known for his work on coordination languages in software engineering, particularly Reo, and in concurrency and software composition.
CWI unveils real nature of Eilenberg-type correspondences
After almost forty years, a well-known theorem in algebra about 'Eilenberg-type correspondences' is finally fully understood. Julian Salamanca, PhD student at CWI in Amsterdam, made a unified theory that explained their real nature. He defends his thesis 'Coequations and Eilenberg-type correspondences' on 24 April 2018 at Radboud University in Nijmegen.
Members
Associated Members
Publications
-
Dokter, K.P.C, Gadducci, F, Lion, B, & Santini, F. (2021). Soft constraint automata with memory. Journal of Logical and Algebraic Methods in Programming, 118. doi:10.1016/j.jlamp.2020.100615
-
de Boer, F.S, Bonsangue, M.M, Johnsen, E.B, Pun, V.K.I, Tapia Tarifa, S.L, & Tveito, L. (2020). SymPaths: Symbolic Execution Meets Partial Order Reduction. In W Ahrendt, B Beckert, R Bubel, R Hähnle, & M Ulbrich (Eds.), Deductive Software Verification: Future Perspectives (pp. 313–338). doi:10.1007/978-3-030-64354-6_13
-
Hiep, H.A, Bian, J, de Boer, F.S, & de Gouw, C.P.T. (2020). A Tutorial on Verifying LinkedList Using KeY. In Deductive Software Verification: Future Perspectives. doi:10.1007/978-3-030-64354-6_9
-
Wisiol, N, Mühl, C, Pirnay, N, Nguyen, P.H, Margraf, M, Seifert, J.-P, … Rührmair, U. (2020). Splitting the Interpose PUF: A Novel Modeling Attack Strategy. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2020(3). doi:10.13154/tches.v2020.i3.97-120
-
Hiep, H.A, Maathuis, O, Bian, J, de Boer, F.S, van Eekelen, M, & de Gouw, C.P.T. (2020). Verifying OpenJDK's LinkedList using KeY. In TACAS 2020: Tools and Algorithms for the Construction and Analysis of Systems (pp. 217–234). doi:10.1007/978-3-030-45237-7_13
-
Serbanescu, V.N, & de Boer, F.S. (2020). On the nature of cooperative scheduling in active objects. In Proceedigns of the 35th Annual ACM Symposium on Applied Computing (pp. 1322–1329). doi:10.1145/3341105.3373896
-
Canetti, R, van Dijk, M.E, Maleki, H, Rührmair, U, & Schaumont, P. (2020). Using Universal Composition to Design and Analyze Secure Complex Hardware Systems. In Proceedings of 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE). doi:10.23919/DATE48585.2020.9116295
-
Azadbakht, K. (2019, December 11). Asynchronous programming in the abstract behavioural specification language.
-
de Boer, F.S, & Hiep, H.A. (2019). Axiomatic characterization of trace reachability for concurrent objects. In Proceedings of the 15th International Conference on integrated Formal Methods (pp. 157–174). doi:10.1007/978-3-030-34968-4_9
-
Esterhuyse, C.A, & Hiep, H.A. (2019). Reowolf: Synchronous multi-party communication over the Internet?. In Proceedings of the 16th International Conference on Formal Aspects of Component Software. doi:10.1007/978-3-030-40914-2_12
Software
Extensible Coordination Tools: plug-ins for the Eclipse platform
ECT: The Extensible Coordination Tools consist of a set of plug-ins for the Eclipse platform to facilitate development of concurrency protocols and distributed applications based on the coordination language Reo.
SAGA: A run-time verifier for Java programs
SAGA is a run-time verifier for single-threaded as well as multi-threaded Java programs.
Current projects with external funding
-
Evolutionary changes in Distributed Analysis (ECiDA)
-
Reowolf 2.0: decentralized, synchronous, multi-party Internet communication (Reowolf 2.0)
Related partners
-
Anchormen
-
Vitens