School of Computing Science

[FATA Seminar] Graph Transformation for, through, and Generated by AI

Group: Formal Analysis, Theory and Algorithms (FATA)
Speaker: Reiko Heckel, University of Leicester
Date: 10 March, 2026
Time: 15:00 - 16:00
Location: Room 422, SAWB

This talk provides a personal view of current interactions between AI and graph transformation: 

From Controlled Studies to Messy Reality: Lessons on Usable Security Research

Group: Human Computer Interaction (GIST)
Speaker: Melvin Abraham, Abertay University
Date: 11 March, 2026
Time: 14:00 - 15:00
Location: Boyd Orr Building, Lecture Theatre 1 (Room 203)

Guest talk: From Controlled Studies to Messy Reality: Lessons on Usable Security Research

Speaker: Melvin Abraham (Research Fellow at Abertay University)

Bio: I am a mixed methods researcher in the field of Human-Computer Interaction (HCI) specifically looking at how to support people in becoming more secure and private while using technology. My philosophy when it comes to research is ‘If the design isn’t usable, it won’t be used’. I always start with understanding who the users are, what are their needs, and what problems they are facing. My experience is with finding the usability, security, and privacy issued faced by certain demographics as well as in new emerging technologies before the problems are found ‘in-the-wild’. Along with my current role I conduct consultancy usable security research for governments agencies and private companies such as Police Scotland, Social Security Scotland, and the NHS.

Abstract: This talk follows my journey from running controlled research in usable security and privacy to tackling the far messier realities of real‑world research. I’ll share what I have learnt about conducting effective studies, managing participants and helping participants to say what they actually mean. Then we’ll shift beyond academia to explore how research changes when the goal isn’t novelty but solving current problems. We will explore why mixed‑methods skills matter, how constraints reshape questions, and how to turn insights into actionable fixes.

When: 2026-03-11 14:00

Location: Boyd Orr Building, Lecture Theatre 1 (Room 203)

SSBSE 2026 Challenge Track Workshop

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 12 March, 2026
Time: 09:00 - 17:00
Location: Merchiston Campus, Edinburgh Napier University, 10 Colinton Road, Edinburgh, EH10 5DT

About This workshop series is a hands-on, team-forming sprint. You will meet potential collaborators, shape a concrete research idea and leave with a realistic plan and division of labour toward a Challenge-Track submission for SSBSE 2026. The SSBSE 2026 Challenge Track explores how Search-Based Software Engineering (SBSE) can optimize agentic AI systems (LLM-powered agents with tools, memory, planning, and autonomy) for real software engineering tasks. You can read more about the challenge and its three themes at: https://conf.researchr.org/track/ssbse-2026/ssbse-2026-ssbse-challenge. Who can participate? The workshops are free and open to all. We particularly encourage academics and their PGR students to attend, alongside industry practitioners and anyone interested in SBSE techniques for agentic AI systems, especially undergraduate students interested in conducting research at the intersection of AI and Software Engineering. No prior experience with specific agent frameworks or search based method is required. The workshop aims to find complementary expertise to provide solutions. We will provide short technical briefings and a Discord channel for the workshop to provide timely technical and scientific support for the participants. Funding to support travel for staff and students at Scottish universities is available. See event page for full details and registration.

TBC

Group: Networked Systems Research Laboratory (NETLAB)
Speaker: Stefanos Evripidou
Date: 12 March, 2026
Time: 12:00 - 13:00
Location: Sir Alwyn Williams Building, 423 Seminar Room

HRI 2026

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 16 March, 2026
Time: 00:00 - 00:00
Location: TBA

The ACM/IEEE International Conference on Human-Robot Interaction (HRI) is the premier venue for innovations on human-robot interaction. Sponsored by the ACM special interest groups on computer-human interaction (SIGCHI) and artificial intelligence (SIGAI) as well as the IEEE robotics and automation society (RAS), HRI brings together researchers spanning robotics, human-computer interaction, human factors, artificial intelligence, engineering, and social and behavioral sciences. The theme of the 21st edition of HRI is HRI Empowering Society. Our field has the potential to bring about positive change in many areas of our societies such as healthcare, transport, remote working, agriculture and industry. However, this change cannot happen if we do not engage properly with the end users who will potentially utilize robots in their jobs and daily lives. For this reason, HRI 2026 will focus on: 1) how we can ethically integrate robots in everyday processes without creating disruptions or inequalities, carefully thinking at the future of work and services; 2) how we can make them accessible to the general public (in terms of design, technical literacy and cost) with the final aim to make robots more willingly adopted as technological helpers. More information is available on the HRI 2026 website

Black Holes and Prisoners: Understanding AS112 Deployment Characteristics

Group: Systems Seminars
Speaker: Elizabeth Boswell, University of Glasgow
Date: 17 March, 2026
Time: 14:00 - 15:00
Location: Room 422, Sir Alwyn Williams Building and Zoom

Abstract: AS112 is a distributed, volunteer-run, anycast DNS service that acts as a sink for leaked DNS queries for local resources, preventing them from overloading core DNS infrastructure. AS112 helps protect important parts of the Internet infrastructure, but there has been no comprehensive study of who runs the AS112 servers, where they are located, and whether they effectively capture leaked queries. Using RIPE Atlas and 33646 open recursive resolvers, we detect 469 AS112 sites, run by 97 operators, and compare the response time and query distances of AS112 to root server queries. AS112 performs well, with 23.21% lower median response times and 36.11% lower median distances than the root. However, AS112 is largely dependent on few large operators (one operator serves 41.71% of probes in our study), limiting its resilience.

[FATA Seminar] The Distortion of Stable Matching

Group: Formal Analysis, Theory and Algorithms (FATA)
Speaker: Aris Filos-Ratsikas, University of Edinburgh
Date: 17 March, 2026
Time: 15:00 - 16:00
Location: Room 422, SAWB

We initiate the study of distortion in stable matching. Concretely, we aim to design algorithms that have limited access to the agents' cardinal preferences and compute stable matchings of high quality with respect to some aggregate objective, e.g., the social welfare. Our first result is a strong impossibility: the classic Deferred Acceptance (DA) algorithm of Gale and Shapley [1962], as well as any deterministic algorithm that relies solely on ordinal information about the agents' preferences, has unbounded distortion. To circumvent this impossibility, we consider algorithms that either (a) use randomization or (b) perform a small number of value queries to the agents' cardinal preferences. In the former case, we prove that a simple randomized version of the DA algorithm achieves a distortion of 2, and that this is optimal among all randomized stable matching algorithms. For the latter case, we prove that the same bound of 2 can be achieved with only 1 query per agent, and improving upon this bound requires Ω(logn) queries per agent. We further show that this query bound is asymptotically optimal for any constant approximation: for any ε>0, there exists an algorithm which uses O(logn/ε2) queries, and achieves a distortion of 1+ε. Moreover, under natural structural restrictions on the instances of the problem, we provide improved upper bounds on the number of queries required for a (1+ε)-approximation. We complement our main findings above with theoretical and empirical results on the average-case performance of stable matching algorithms, when the preferences of the agents are drawn i.i.d. from a given distribution.

SICSA Seminar - Can Evolution Develop Public Transport Networks?

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 25 March, 2026
Time: 16:00 - 17:00
Location: https://sicsa.ac.uk/event/sicsa-seminar-from-large-to-small-building-affordable-language-models-with-limited-resources/

Register to attend Join us on Wednesday, 25 March for an AI & Data Science Seminar. Dr Neil Urquhart of Edinburgh Napier University presents Can Evolution Develop Public Transport Networks? Public transport networks by their very nature evolve over time to meet the needs of travellers, fit the constraints of operators and meet the aspirations of politicians. This talk examines the use of novelty search to explore changes to the bus network in the centre of Edinburgh. The existing solution has been evolving since 1871 matching the changing nature of the city and transportation technologies. We harness geospatial data to evaluate the existing solution and then use novelty search to find modified solutions and examine their relationship to the existing solution. We are particularly interested in balancing the novelty of proposed changes with the distance from the current trusted solution. This talk will demonstrate the potential for novelty search to assist with the design and modification of public transport routes and set and agenda for future research which will aim to cover larger areas and encompass multiple transport modes. Dr Neil Urquhart is Associate Professor of Computer Science at Edinburgh Napier University, his research interests include real-world applications of Artificial Intelligence particularly in the transport sector.

[FATA Seminar] Meta-rotations in SPA-S

Group: Formal Analysis, Theory and Algorithms (FATA)
Speaker: Peace Ayegba, FATA
Date: 31 March, 2026
Time: 15:00 - 16:00
Location: Room 422, SAWB

TBA

Pre-CHI Day 2026

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 01 April, 2026
Time: 10:00 - 15:00
Location: Stirling Court Hotel, University of Stirling, Airthrey Rd, Stirling, FK9 4LA

The ACM CHI conference is the premier publication venue in the field of HCI, and Scotland-based researchers are contributing extensively to the programme for the 2026 conference which will be held in Barcelona, Spain in mid-April. The Pre-CHI Day is a chance for the Scottish HCI community to see some of the world-leading research going on across Scotland, and allow those not travelling to Spain to talk to authors first-hand and hear about their work. Over the day, we will have presentations from ACM CHI 2026 full paper authors, with the potential for also having a poster or interactivity session as well (depending on numbers). The event will be hybrid, and virtual attendance and virtual presentation will both be supported. We expect a mixed audience, including researchers of the Scottish HCI community as well as interested students, designers, industry, practitioners etc., as well as newcomers to the field of HCI. Register by 31 March to attend in-person or onlin Submit a paper or poster by 22 March to be included in the programme.

Research Introduction by Dr. Georgios Chatzivasilis

Group: Networked Systems Research Laboratory (NETLAB)
Speaker: Georgios Chatzivasilis
Date: 02 April, 2026
Time: 10:00 - 11:00
Location: Sir Alwyn Williams Building, 422 Seminar Room

Please join us for this week’s Netlab Reading Group session. We are excited to introduce Dr. Georgios Chatzivasilis, who joined the team as a Research Associate in mid-February. 

Georgos will be giving an overview of his research background and primary focus areas. This is a fantastic opportunity to welcome him to the lab and explore potential avenues for future collaboration within our group.

[FATA Seminar] TBA

Group: Formal Analysis, Theory and Algorithms (FATA)
Speaker: Edwin Brady, University of St Andrews
Date: 07 April, 2026
Time: 15:00 - 16:00
Location: Room 422, SAWB

TBA

TBC

Group: Networked Systems Research Laboratory (NETLAB)
Speaker: Muhammad Arif
Date: 09 April, 2026
Time: 11:00 - 12:00
Location: Lilybank Gardens, F121 Conference Room

SICSA Writing Retreat 2026

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 27 April, 2026
Time: 15:00 - 14:00
Location: Scottish Centre for Ecology and the Natural Environment (SCENE), G63 0JS

The 2026 SICSA Writing Retreat will bring together researchers from across Scotland for a two-day intensive writing event. The programme will consist of networking and skill sharing activities, in addition to individual and group writing blocks. Postdoctoral researchers from any SICSA institution are invited to apply to attend the writing retreat by completing the online form by 1 February 2026. Spaces are very limited and the SICSA Directorate will be judging applications based on clear and achievable writing plans, quality outputs and benefits to both individual researchers and wider groups. Proposals that involve and benefit multiple SICSA institutions are particularly encouraged. Apply Date Start: 15:00 Monday 27 April 2026 Finish: 14:00 Wednesday 29 April 2026 Location Scottish Centre for Ecology and the Natural Environment (SCENE)

SICSA Writing Retreat 2026

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 27 April, 2026
Time: 15:00 - 14:00
Location: Scottish Centre for Ecology and the Natural Environment (SCENE), G63 0JS

The 2026 SICSA Writing Retreat will bring together researchers from across Scotland for a two-day intensive writing event. The programme will consist of networking and skill sharing activities, in addition to individual and group writing blocks. Postdoctoral researchers from any SICSA institution are invited to apply to attend the writing retreat by completing the online form by 1 February 2026. Spaces are very limited and the SICSA Directorate will be judging applications based on clear and achievable writing plans, quality outputs and benefits to both individual researchers and wider groups. Proposals that involve and benefit multiple SICSA institutions are particularly encouraged. Apply Date Start: 15:00 Monday 27 April 2026 Finish: 14:00 Wednesday 29 April 2026 Location Scottish Centre for Ecology and the Natural Environment (SCENE)

tbc

Group: Systems Seminars
Speaker: Shounak Chakraborty, Durham University
Date: 28 April, 2026
Time: 14:00 - 15:00
Location: Room 422, Sir Alwyn Williams Building and Zoom

tbc

[FATA] MSci Talks

Group: Formal Analysis, Theory and Algorithms (FATA)
Speaker: Cara Lowe and Duncan Mather
Date: 28 April, 2026
Time: 15:00 - 16:00
Location: Room 422, SAWB

[FATA] MSci Talks

Group: Formal Analysis, Theory and Algorithms (FATA)
Speaker: Andrei Boghean and Josh Duffy
Date: 05 May, 2026
Time: 15:00 - 16:00
Location: Room 422, SAWB

Theory Day 2026

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 07 May, 2026
Time: 01:00 - 01:00
Location: University of Strathclyde, United Kingdom

Join us on 7 May 2026 for Theory Day, bringing together researchers from across Scotland working on Theory and adjacent topics. Staff and students are encouraged to register and submit a proposal to be included in the programme.

Pallas: A Data-Plane-Only Approach to Accurate Persistent Flow Detection on Programmable Switches in High-Speed Networks

Group: Networked Systems Research Laboratory (NETLAB)
Speaker: Weihe Li, University of Edinburgh
Date: 07 May, 2026
Time: 11:00 - 12:00
Location: Sir Alwyn Williams Building, 423 Seminar Room

Abstract:

In high-speed data center networks, persistent flows are repeatedly observed over extended periods, potentially signaling threats such as stealthy DDoS or botnet attacks. Monitoring every flow in production-grade hardware switches that feature limited memory, however, is challenging under typical high flow rates and data volumes. To tackle this, approximate data structures, like sketches, are often employed. Yet many existing methods rely on per-time-window flag resets, which require frequent control-plane interventions that make them unsuitable for high-speed traffic. This paper introduces Pallas, a fully data-plane-implementable sketch for detecting persistent flows in high-speed networks with high accuracy, obviating the need for time-window-based resets. We further propose Opt-Pallas, an enhanced variant of Pallas that improves detection accuracy by incorporating flow arrival patterns. We present a rigorous error bound analysis for both Pallas and Opt-Pallas, along with extensive performance evaluations using a P4-based prototype on an Intel Tofino switch. Pallas scales persistent flow detection to line-rate capacity, while state-of-the-art solutions fail to operate beyond a few Mbps. Our results show that Pallas and Opt-Pallas can accurately detect persistent flows in traffic volumes over 60× higher than those handled by the best existing approach. Additionally, even under low-speed traffic, Pallas and Opt-Pallas achieve 4.21% and 7.85% higher lookup accuracy while consuming only 8.5% and 9.7% of switch resources, respectively. Extensive trace-driven results on a CPU platform further validate the high detection accuracy of Opt-Pallas compared to existing methods.

Bio:

Weihe Li is a postdoctoral researcher at the University of Edinburgh. He received his Ph.D. in Informatics from the University of Edinburgh in 2025. His research focuses on the design of approximate data structures for fast and accurate flow detection in high-speed networks, with an emphasis on practical deployment on programmable switches. His first-author work has appeared in top-tier venues, including ACM SIGMOD 2025, ACM WWW 2024 and 2025 (Best Student Paper Award, 2024), IEEE ICNP 2025, IEEE/ACM Transactions on Networking (ToN), and IEEE Transactions on Computers (TC). He has also conducted research in related networking areas, including video streaming and load balancing in data center networks.

"Abuse Risks are Often Inherent to Product Features": Exploring AI Vendors' Bug Bounty and Responsible Disclosure Policies

Group: Networked Systems Research Laboratory (NETLAB)
Speaker: Yangheran Piao, University of Edinburgh
Date: 21 May, 2026
Time: 11:00 - 12:00
Location: Sir Alwyn Williams Building, 423 Seminar Room

Abstract:

As vendors adopt AI technologies, security researchers are working to uncover and fix related vulnerabilities, which is important given AI systems handle sensitive data and critical functions. This process relies on vendors receiving and rewarding AI vulnerability reports. To assess current practices, we analyzed the vulnerability disclosure policies of 264 AI vendors. We employed a mixed-methods approach, combining snapshot and longitudinal qualitative analysis, as well as comparing alignment with 320 AI incidents and 260 academic articles. Our analysis reveals that 36% of AI vendors have no established policy, and only 18% mention AI risks. Data access, authorization, and model extraction vulnerabilities are most consistently declared in-scope. Jailbreaking and hallucination are most commonly declared out-of-scope. We identify three profiles that reflect vendors' different positions toward AI vulnerabilities: proactive clarification (n = 46), silent (n = 115), and restrictive (n = 103). Our alignment results suggest that vendors may address AI vulnerability disclosure later than academic research and real-world incidents.

Bio:

Yangheran (Lawrence) Piao is a third-year PhD student at the School of Informatics, University of Edinburgh. His research explores usable security, security economics, and cybercrime, with a specific focus on the vulnerability disclosure ecosystem, bug bounties, and AI vulnerability reporting. Yangheran’s work has been published and presented at premier security venues, including USENIX Security, IEEE S&P (Oakland), and WEIS.

Scottish Argumentation Day 2026

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 29 May, 2026
Time: 01:00 - 01:00
Location: University of Dundee

Scotland has a particularly high concentration of research groups working in the AI subfield of computational argumentation. Scottish Argumentation Day has previously been attended by researchers based both in Scotland and further afield, and has enabled the Scottish argumentation community to present their work in an informal setting, share feedback, and strengthen professional links. SAD began with Aberdeen 2011, and most recently took place in Edinburgh 2024. In continuing this series, our aim is threefold: (i) enable Scottish argumentation researchers, and especially PhD students, to mutually present their work; (ii) affirm Scottish argumentation research as a recognisable presence; (iii) provide a concrete opportunity for Scottish researchers to network. At SAD 2026 we aim to improve visibility for Scotland-based researchers, especially PhD students and early-career researchers, to encourage knowledge- and skill-exchange at all levels, and to foster cross-institution relations and collaborations. Participation is free but registration is required. ————————————————– We invite abstracts of up to 250 words to be presented as a short talk or poster. Participants at all levels are encouraged to present work, so that everyone can come away with a view of the current Scottish argumentation landscape. We invite abstracts at a range of levels, including: Overview of a specific research project or a lab’s area of work Recent work Work in progress, recent findings or initial results PhD projects and project plans PhD students are especially encouraged to present their projects and project plans to benefit from wider feedback in a supportive atmosphere. Abstract submission form: https://forms.gle/qCVGqi1sahCKATJv6 ————————————————– The day will be scaffolded by three keynote talks by John Lawrence of the University of Dundee, Elena Musi of the University of Liverpool and Henning Wachsmuth of Leibniz University Hannover. ————————————————–

TBC

Group: Networked Systems Research Laboratory (NETLAB)
Speaker: Jinming Yang
Date: 04 June, 2026
Time: 11:00 - 12:00
Location: Sir Alwyn Williams Building, 423 Seminar Room

EASE 2026: International Conference on Evaluation and Assessment in Software Engineering

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 09 June, 2026
Time: 01:00 - 01:00
Location: James McCune Smith Learning Hub, University Avenue, Glasgow, G12 8QW

EASE is an internationally leading venue for academics and practitioners to present and discuss their research on evidence-based software engineering, and its implications for software practice. EASE is ranked as A conference in CORE. The 30th edition of EASE will take place in Glasgow, Scotland. EASE 2026 welcomes high-quality submissions, describing original and unpublished research for the following tracks: full research papers, short papers & emerging results, industry, posters & vision, journal-first, and a doctoral symposium. There will also be co-located events, including workshops and tutorials, and a track planned for journal-first presentations. See conference website for submission tracks and deadlines. EASE 2026

S3CIX 2026 - Symposium and Summer School on Computational Interaction

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 16 June, 2026
Time: 01:00 - 01:00
Location: Sir Alwyn Williams Building, University of Glasgow, 18 Lilybank Gardens, Glasgow, G12 8QN, United Kingdom

Registration for the 10th Symposium and Summer School on Computational Interaction will open 1 February and close 14 March 2026. View programme, event details and registration process at S³CIX 2026. This year S³CIX is expanding from a Summer School format to also include a 4 day long academic Symposium. We anticipate about 30 students and 40 academics and invited speakers to attend. There will also be two workshops. Computational interaction often involves elements from machine learning, signal processing, information theory, optimisation, inference, control theory and formal modelling. Computational interaction would typically involve at least one of: an explicit mathematical model of user-system behaviour; a way of updating that model with observed data from users; an algorithmic element that, using this model, can directly synthesise or adapt the design; a way of automating and instrumenting the modelling and design process; the ability to simulate or synthesise elements of the expected user-system behaviour.”

TBC

Group: Networked Systems Research Laboratory (NETLAB)
Speaker: TBC
Date: 18 June, 2026
Time: 11:00 - 12:00
Location: Lilybank Gardens, F121 Conference Room

10th Summer School and Symposium on Computational Interaction (S³CIX)

Group: Inference, Dynamics and Interaction (IDI)
Speaker: multiple
Date: 20 June, 2026
Time: 09:00 - 16:00
Location: Sir Alwyn Williams Building, 422 Seminar Room

Welcome to the Symposium and Summer School on Computational Interaction! This year we are expanding from a Summer School format to also include a 4 day long academic Symposium. We anticipate about 30 students and 40 academics and invited speakers to attend. There will also be two workshops.

SPLV’26: Scottish Programming Languages and Verification Summer School 2026

Group: Scottish Informatics and Computer Science Alliance (SICSA)
Speaker: SICSA Event, SICSA
Date: 03 August, 2026
Time: 01:00 - 01:00
Location: TBA

The 2026 edition of SPLV will be held at the University of Glasgow, with the main courses running from within the Gilbert Scott Building. The school is aimed at PhD students in programming languages, verification and related areas. Researchers and practitioners are welcome, as are strong undergraduate and masters students with the support of a supervisor. Participants should have a background in computer science, mathematics or a related discipline. Prospective students may contact the organisers if they have any concerns about background knowledge. Registration will open March 2026. View full programme at SPLV 2026 | SPLV