The fragile security of today's IT infrastructure is the result of a perpetual arms race between attackers and defenders. Just as the defenders continuously improve their ability to tackle attacks, the attackers keep devising new malicious practices, refining classic attacks on programming errors as well as exploiting a broadening attack surface including routers, firmware, and the Internet of Things. Formal methods offer a way out of this arms race. Based on mathematically precise system and attacker models, we can systematically eliminate entire classes of attack strategies. With recent advances in logic and automated reasoning, the application can even be largely automated. Too often, however, formal methods are based on abstract system models and thus leave gaps that are not considered in these models. This research area aims for a phase transition in the scope and practical applicability of formal methods, striving for computer-aided analysis and construction of secure systems with the strongest possible formal guarantees. This includes the development of methods for achieving rigorous security guarantees for systems and software, runtime methods for monitoring and enforcement, design-time methods for static analysis and program repair, and a comprehensive methodology for building secure large-scale systems from small secure building blocks.
USENIX-Security
USENIX SecurityUSENIX Security
ACSAC
Proceedings of the 38th Annual Computer Security Applications ConferenceAnnual Computer Security Applications Conference (ACSAC 2022)
CCS
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security29th ACM Conference on Computer and Communications Security (CCS)
UNSPECIFIED
Proceedings of the 4th Workshop on CPS & IoT Security and Privacy (CPSIoTSec '22)4th Workshop on CPS & IoT Security and Privacy (CPSIoTSec '22)
