Wordpress is loading infos from uni-trier
Please wait for API server guteurls.de
to collect data from
Computing with Infinite Data EU Horizon 2020 Marie Sklodowska-Curie Research and Innovation Staff Exchange (MSCA-RISE), 4 years, start April 2017, total value 1,462,500 Euros Participating universities Siegen (Germany), Trier(Germany), Munich (Germany), Swansea (UK), Birmingham (UK), INRIA (France), Ljubljana (Slovenia), Maastricht (Netherlands), Stockholm (Sweden), Padova (Italy), Algarve (Portugal), Aston (UK), Dortmund(Germany), KAIST (Korea), JAIST (Japan), Novosibirsk (Russia), UNISA (South-Africa), Andres Bello (Chile), Canterbury (NZ), Cincinnati (USA), Nanyang (Singapore), Abstract The joint research in this programme will study important aspects—both theoretical as well as applied—of computing with infinite objects. A central aim is laying the grounds for the generation of efficient and verified software in engineering applications. A prime example for infinite data is provided by the real numbers, most commonly conceived as infinite sequences of digits. While most applications in science and engineering substitute the reals with floating point numbers of fixed finite precision and thus have to deal with truncation and rounding errors, the approach in this project is different: exact real numbers are taken as first-class citizens and while any computation can only exploit a finite portion of its input in finite time, increased precision is always available by continuing the computation process. This project aims to bring together the expertise of specialists in mathematics, logic, and computer science to push the frontiers of our theoretical and practical understanding of computing with infinite objects. Three overarching motivations drive the proposed collaboration: Representability. Cardinality considerations tell us that it is not possible to represent arbitrary mathematical objects in a way that is accessible to computation. We will enlist expertise in topology, logic, and set theory, to address the question of which objects are representable and how they can be represented most efficiently. Constructivity. Working in a constructive mathematical universe can greatly enhance our understanding of the link between computation and mathematical structure. It not only informs us which are the objects of relevance, it also allows us to devise always correct algorithms from proofs. Efficient implementation. We also aim to make progress on concrete implementations. Theoretical insights from elsewhere will be tested in actual computer systems; obstacles encountered in the latter will inform the direction of mathematical investigation.
The Theory Group is part of a new 4 year EU HORIZON 2020 research project called Computing with Infinite data (CID). It involves partners from all continents of the world.
Hideki Tsuiki from Kyoto University is visiting Swansea from 15 to 28 August 2016. He is an expert in Domain Theory, Effective Topology and Exact Real Number Computation. He is working with Ulrich Berger and the Munich Minlog group on the Extraction of infinity Gray code for real numbers.
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.
Markus Roggenbach and John Tucker, in collaboration with their colleagues Mark Jones and Xianghia Xie from the Visual Computing Group were awarded an EPSRC grant for their research project Data Release – Trust, Identity, Privacy and Security (DETIPS).
Data Release – Trust, Identity, Privacy and Security Mark Jones (PI), Markus Roggenbach, John Tucker and Xianghua Xie (CoIs) EPSRC grant The Open Data Initiative (ODI) demonstrates that there is a growing ambition from government to publish internal data as open data sets. (See https://data.gov.uk). Data custodians, particularly large governmental organisations such as the DVLA and HMRC, have a legal duty, enforced by the Information Commissioner’s Office (ICO), and social duty of care to the public, to ensure that privacy is not breached by the release of data as open data sets. These large organisations face an increasingly difficult task in establishing whether the release of data will result in enough data being open to triangulate individuals and destroy privacy. Our research takes a collaborative approach uniquely combining formal methods, counter-fraud, data mining and data visualization to produce new tools, methodologies and theory for working with data release. We will produce tools that allow interactive analysis of data sets to determine if data release can combine with existing data to triangulate personal data. We will take a new approach of using formal notions about data, memorandums of understanding (of data use) and criteria of control to auto-generate software tools that allow the user to manipulate, investigate and analyse data sets for potential unintended consequences if released. We will undertake empirical studies with data keepers, data users and members of the public to inform data policies surrounding release of data and integrate this within our toolsets and methodologies.
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.
On November 12th and 13th Markus Roggenbach, Xu Wang and Phillip James went to the 3rd meeting of the ETWG-RC in Amsterdam. The session was chaired by Markus and Swansea presented recent work towards modelling ERTMS in Real-Time Maude (presented at FTSCS 2015). Talks from other participants included: Jan Peleska (Bremen): Complete Bounded Model Checking and Testing of Interlocking Systems. Alessandro Fantechi (Firence): Certification challenges of innovative signalling systems. Marielle Stoelinga (Twente): Railway Maintenance Engineering (in co-operation with ProRail) . Jan Pelseka (Bremen): Overview on OpenETCS. Jaco van de Pol (Twente) / Anne Haxthausen (Lyngby): Introduce/discussion about the Rascal working group on Verification Technology. A good time was had by all with many fruitful discussions and ideas being exchanged. The Swansea Railway Verification Group dearly missed Monika who heroically stayed in Swansea in order to help organise the yearly departmental colloquium to be held next week in Gregynog, but we thank her for all her hard work towards our presentation slides. Faron will also be doubly sorry for unfortunately having to miss the trip, not only for missing the Science but also the tasty meals and refreshing beverages!