Software: security requirements and secure programming
In his PhD thesis, John Wilander studied how security requirements are captured
before public procurement contracts, and treated aspects of code development,
including static analysis, and run-time intrusion prevention.
Ben Livshits from Microsoft Research, a well-known profile within the area of secure software, acted as opponent at the PhD defence. The seminar was attended by a large audience from industry including several LiU alumni.
Exploiting Structure in CSP-related Problems
By relating complexity issues in constraint satisfaction problems to properties
of graphs and their structure Tommy Färnqvist has in a recent PhD shown that a
large class of applications e.g. in database search or AI do not have efficient
solutions, thus not polynomially solvable. He has thereafter found a metric to
relate problems that are approximation friendly.
Page responsible: Webmaster