52 citations · 79 across the 16 of their papers we have counts for
16 papers
CCR: Towards a Common, Quality-Gated CACAO Integrations Registry for European Cybersecurity Automation
Mateusz Zych, Vasileios Mavroeidis, Gudmund Grov
Standardised, machine-readable cybersecurity playbooks provide a basis for portable, shareable, and reusable incident-response logic. OASIS CACAO provides a vendor-neutral represen…
Towards Agentic Investigation of Security Alerts
Even Eilertsen, Vasileios Mavroeidis, Gudmund Grov
Security analysts are overwhelmed by the volume of alerts and the low context provided by many detection systems. Early-stage investigations typically require manual correlation ac…
Detecting and Eliminating Neural Network Backdoors Through Active Paths with Application to Intrusion Detection
Eirik Høyheim, Magnus Wiik Eckhoff, Gudmund Grov +2
Machine learning backdoors have the property that the machine learning model should work as expected on normal inputs, but when the input contains a specific , it…
A Graph-Based Approach to Alert Contextualisation in Security Operations Centres
Magnus Wiik Eckhoff, Peter Marius Flydal, Siem Peters +4
Interpreting the massive volume of security alerts is a significant challenge in Security Operations Centres (SOCs). Effective contextualisation is important, enabling quick distin…
LLM-Powered Intent-Based Categorization of Phishing Emails
Even Eilertsen, Vasileios Mavroeidis, Gudmund Grov
Phishing attacks remain a significant threat to modern cybersecurity, as they successfully deceive both humans and the defense mechanisms intended to protect them. Traditional dete…
Exploring reinforcement learning for incident response in autonomous military vehicles
Henrik Madsen, Gudmund Grov, Federico Mancini +2
Unmanned vehicles able to conduct advanced operations without human intervention are being developed at a fast pace for many purposes. Not surprisingly, they are also expected to s…
On the use of neurosymbolic AI for defending against cyber attacks
Gudmund Grov, Jonas Halvorsen, Magnus Wiik Eckhoff +3
It is generally accepted that all cyber attacks cannot be prevented, creating a need for the ability to detect and respond to cyber attacks. Both connectionist and symbolic AI are…
DAReing to reduce the annotation overheads of verified programs
Gudmund Grov, Duncan Cameron, Leon McGregor
Modern program verifiers use the same uniform program text to both specify and implement programs. The program text is also used to provide the necessary guidance to ensure that th…
Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC
Yuhui Lin, Gudmund Grov, Rob Arthan
The use of a functional language to implement proof strategies as proof tactics in interactive theorem provers, often provides short, concise and elegant implementations. Whilst be…
Semi-Automated Design Space Exploration for Formal Modelling
Gudmund Grov, Andrew Ireland, Maria Teresa Llano +3
Refinement based formal methods allow the modelling of systems through incremental steps via abstraction. Discovering the right levels of abstraction, formulating correct and meani…
Automating change of representation for proofs in discrete mathematics
Daniel Raggi, Alan Bundy, Gudmund Grov +1
Representation determines how we can reason about a specific problem. Sometimes one representation helps us find a proof more easily than others. Most current automated reasoning t…
Tinker, tailor, solver, proof
Gudmund Grov, Aleks Kissinger, Yuhui Lin
We introduce Tinker, a tool for designing and evaluating proof strategies based on proof-strategy graphs, a formalism previously introduced by the authors. We represent proof strat…
Some Ideas for Program Verifier Tactics
Gudmund Grov
A program verifier is a tool that can be used to verify that a "contract" for a program holds - i.e. given a precondition the program guarantees that a given postcondition holds -…
Towards Automated Proof Strategy Generalisation
Gudmund Grov, Ewen Maclean
The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved. Here, we d…
A Graphical Language for Proof Strategies
Gudmund Grov, Aleks Kissinger, Yuhui Lin
Complex automated proof strategies are often difficult to extract, visualise, modify, and debug. Traditional tactic languages, often based on stack-based goal propagation, make it…
Machine Learning in Proof General: Interfacing Interfaces
Ekaterina Komendantskaya, Jónathan Heras, Gudmund Grov
We present ML4PG - a machine learning extension for Proof General. It allows users to gather proof statistics related to shapes of goals, sequences of applied tactics, and proof tr…