We would like to welcome Arno Pauly, who has recently joined the computer science department here in Swansea. Today he is going to give a talk on Noncomputability in analysis as a part of our Computational Foundry Seminar Series.
More information: Many theorems in analysis state the existence of a certain object depending on some parameter. Each such theorem has an associated computational task: Compute the object from the parameter. From the viewpoint of a constructivist, these tasks are intricately linked to the meaningful truth of the theorems. From a pragmatic perspective, the applicability of a theorem to fields like physics or economics is tied to the solvability of the associated computational task.
Jan Peleska and Wen-ling Huang from the University of Bremen are visiting Swansea this week. Jan will give a talk on Safety-complete Test Suites as a part of Computational Foundry Seminar series.
More information: This presentation is about property-oriented testing. A novel safety-related variant of complete test suites for ﬁnite state machines is introduced. Under certain hypotheses which are similar to the ones used in the well-known complete testing methods like W-Method, Wp-Method, HSI-Method, or H-Method, the new method guarantees to uncover every safety violation, while erroneous outputs without safety-relevance may remain undetected. In well-deﬁned situations that can be precisely pre-determined from the reference model, this leads to a substantial reduction of test cases in comparison to the size of the analogous W, WP, HSI, H-test suites. We advocate this new test strategy for situations, where exhaustive testing of the complete system is too expensive. In these cases, strong guarantees with respect to fault coverage should only be given for the errors representing safety violations, while it is considered as acceptable if less critical errors remain undetected. An original version of this material has been published at the ICTSS 2017 conference; in this talk, we present a refined test suite based on the H-method which can be shown to always produce less or equally many test cases as when applying the original H-method. We sketch how this strategy can be extended to safety-complete equivalence class testing for systems with infinite input domains but finitely many internal states and finite output domains.
Adrian Mathias from the University of Reunion is visiting Swansea on 19 July 2016. He is mainly working in Set Theory. Here is the link to his talk in the PCV seminar.
Grant Malcom from the University of Liverpool is visiting Swansea on the 29th of April 2016. He gave a talk in the PCV Seminar entitled Structures of Transition Systems.
Olaf Beyersdorff from the University of Leeds is visiting Swansea on the 12th of April 2016.
He will give a talk in the Theory Seminar about Proof Complexity of Quantified Boolean Formulas
Nao Hirokawa from the Japan Advanced Institute of Science and Technology (JAIST) is visiting Swansea from 15 to 17 March. Nao is an expert in Term rewriting theory.
The abstract of his seminar talk about Basic Normalization on Thursday, 15 March can be found here.
Achim Jung from the University of Birmingham is visiting Swansea on Wednesday, 20 January 2016. He will give a talk in the PCV seminar series.
Title: On the sobriety of domains
Abstract: There are two ways in which a domain (in the sense of Dana
Scott) may arise from countable data: The classic way is via
order-theoretic approximation inside the domain, and leads to the
notion of algebraic and continuous domains. Alternatively, one can
view a domain as arising from the lattice of predicates that may be
formulated for a data type. This latter approach was pioneered and
developed by Samson Abramsky in his Domain Theory in Logical Form.
I will explain these two approaches and then present an example that
illustrates some of the subtlety that we may observe with the latter.
Time: 4-5 pm
Venue: Robert Recorde Room (Faraday Building 205)
The talk will be preceded by a talk by Margarita Korovina.
Margarita Korovina from IIS (A.P. Ershov Institute of Informatics Systems, Novosibirsk), is visiting Swansea as part of the EU project COMPUTAL.
She will give four talks in the PCV seminar:
Tuesday, 19/1, 2-3 pm and Thursday 21/ 2, 2-3 pm: What are decidable/undecidable in reachability verification of hybrid systems?
Wednesday, 20/1, 3-4 pm: Complexity for Partial Computable Functions over Computable Perfect Polish Spaces.
The talks will be in the Robert Recorde Room Robert (Faraday Building, Room 205)
Prof. Nobert Preining from JAIST is visiting Arnold Beckmann to continue work on their Royal Society Grant Hypersequents and Communication.
Prof Prof. Magne Haveraaen from University of Bergen visits the department and gives a talk “Specifying software the Magnolia way” on 10th, Dec 2015.