Harry Bryant passed his MRes viva on his dissertation “Exploring the IC3 Algorithm to Improve the Siemens-Swansea Ladder Logic Verification Tool”.
Harry was supervised by Prof Markus Roggenbach and Dr Oliver Kullman. A big thank you goes to Prof Helen Treherne (Surrey University) and Dr Phil James as examiners, and Alma as chair of the committee.
Congratulations to Tobias Rosenberger who passed his PhD viva today.
Title: Institution-based Semantics and Tool Support for the UML
Tobias did a joint PhD with Grenoble, the examiners were
The supervisors were Markus Roggenbach (Swansea) and Saddek Bensalem (Grenoble).
Well done, Tobias, and all the best for the future!
Florian Lercher (Ausburg University is visiting Swansea). Today he is giving a talk on “Compositional Verification of Communicating UML State Machines”.
Abstract:
When dealing with large concurrent systems, verification methods such as model checking usually do not scale up well. This is because they need to explore the global state space of the system, which can grow exponentially with the number of concurrent components.Compositional verification methods, on the other hand, scale linearly with the number of components.To achieve this, compositional methods first prove local properties for each individual component and then compose these into a global property of the system.
We develop a compositional verification method for asynchronously communicating state machines.To this end, we modify the approach by de Roever et al. that works with synchronous communication.Our verification method follows the assumption-commitment paradigm, meaning that a property consists of an assumption about the environment and a commitment that the program has to satisfy only if the assumption holds. Due to the design of our model, representing a system of communicating UML state machines is relatively straightforward.We implement a tool to translate a system of communicating UML state machines into our formalism and generate the necessary proof obligations in an interactive theorem prover. To demonstrate the capabilities of our approach, we apply it to several examples.
In the talk, we will verify the LCR algorithm for distributed leader election and then explore the theory behind the approach.
AISB Workshop on Explainability and Transparency in AI (XTAI 2022) is going to take place in Swansea University, Bay Campus, Computational Foundry (and online) on
13 October 2022.
Web site: aiqt.uk/xtai-2022
AISB and the Department of Computer Science at Swansea University are holding a hybrid one-day workshop on explainability and transparency in AI. This workshop is free to attend for AISB members but requires registration.
Topics include:
he workshop will have invited and contributed talks as well as discussion sessions aimed at exploring cutting-edge research and open problems in areas related to explainable AI and transparency of automated data-driven decision making.
Programme:
10:00: Opening
10:05: Hsuan Fu – Explainability and Predictability of Machine Learning Methods in Finance Applications
10:35: Raghav Kovvuri – Investigating Global Open-Ended Funds diversification among G 11 countries through XAI
11:00: Break
11:30: Xiyui Fan – XAI with Probabilistic Structured Argumentation
12:00: Adam Wyner – Values in the Roots of Conflict in Argumentation
12:30: Lunch break
14:00: Arnold Beckmann – Hybrid AI approaches for Knowledge-Intense Manufacturing
14:30: Jay Morgan – Adaptive Neighbourhoods for the Discovery of Adversarial Examples
15:00: Coffee
15:30: Jamie Duell – Enhancing the Explainability of Electronic Health Record Predictions
16:00: Bertie Müller – PACE (Parametrised Automated Counterfactual Explanations) for Re3 (Reliable, Responsible & Resilient Design)
16:30: Panel Discussion
Organisers:
Email xtai@aiqt.uk for any other queries.
We are happy to welcome all the participants of the CiE (Computability in Europe) conference here in Swansea today.
The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics.
Just a reminder that BCTCS 2022 is taking place in April in Swansea. The registration is open until 30 March.
ABOUT THE BCTCS
The BCTCS is an annual event for UK-based researchers in Theoretical Computer Science to present their research and discuss future directions. The meeting aims to provide an environment in which PhD students can gain experience in presenting their work, to broaden their outlook on the subject, and to benefit from contact with established researchers. The scope of the colloquium includes all aspects of Theoretical Computer Science, including Automata Theory, Algorithms, Complexity Theory, Semantics, Formal Methods, Concurrency, Types, Languages and Logics.
SPECIAL SESSIONS AND THEMES – Explainable AI, Security, History of TCS, Teaching of TCS
There will be two Special Sessions during the meeting: one on Explainable AI, the other on Theoretical Aspects of Security.
Four of the Invited Speakers have been chosen based on their lifetime achievements in developing Theoretical Computer Science in the UK and have been invited to present personal histories of their fields of expertise.
At the end of the first day there will be a discussion event led by Barnaby Martin on the Pedagogy of Theoretical Computer Science.
BCTCS will also celebrate two important birthdays, John Tucker, 70 and Faron Moller, 60.
INVITED SPEAKERS
SPECIAL SESSION SPEAKERS (INVITED)
BCTCS 2022 deadline for submission of contributed talks has been extended until 25 February 2022.
We are happy to welcome Giovanni Solda amongst us. He is joining Swansea University as a postdoctoral researcher and will be working with Arno Pauly.
Giovanni was awarded 1 of 15 London Mathematical Society Early Career Fellowships, which provide 6 months of funding to fresh UK PhD graduates in math to spend at any institution across the world.
Congratulations to Jay Morgan for passing his PhD viva on
“Trustable Machine Learning Systems: Strategies to use expert domain knowledge to improve the performance of Deep Learning systems”.
The University of Birmingham is hosting this year’s CCC 2021 Continuity, Computability, Constructivity: From Logic to Algorithms on 20-24 September 2021. There is a special session in honour of Ulrich Berger taking place on Tuesday as a part of this conference.
