Today Swansea is hosting the first virtual WADT, and you are gently invited to participate.
The virtual WADT is part of the 25th International Workshop on Algebraic Development Techniques 2020, which hopefully will still happen as a physical meeting in autumn this year. The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems).
The workshop takes place under the auspices of IFIP WG 1.3.
Please see below for the programme.
25th INTERNATIONAL WORKSHOP ON ALGEBRAIC DEVELOPMENT TECHNIQUES 2020
Our colleague Arno Pauly is on the Programme Committee of the Computability Theory and its Applications seminar series, which currently is taking place virtually.
The seminar now has a YouTube channel where you can find the recordings of past talks you may have missed. The information on future talks, the timings of those, and the links to the videos are all available on the webpage here:
CTA Seminar – Computability
The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia.
Due to COVID-19 outbreak across the world, we need to move our theory seminars online to ZOOM. We are staying on track with the schedule and Yoriyuki Yamagata will give his talk tomorrow at 2pm.
Topic: Falsification of Cyber-Physical Systems Using Deep Reinforcement Learning.
Abstract: “Falsification” is a method to find a system input or parameter (counter-example) which causes a behavior violating a given specification (usually given by metric or signal temporal logic). Because the correctness of a complex CPS is difficult to be proven, falsification is more practical approach than full verification. A counter-example found by falsification can be used for debugging and testing. Failure of falsification does not generally mean the correctness of the system, but suggests it in some degree. “Robustness guided falsification” is an approach of falsification. “Robustness” is a numerical measure of how robustly a formula holds. If robustness becomes negative, the formula is false. Therefore, minimizing robustness can lead falsification of a formula.
In this talk, we introduce a method to recast robustness guided falsification to a “reinforcement learning problem”. Reinforcement learning is a machine learning technique in which an agent finds a law of an interacting environment and maximizes a reward. We implement our method using “deep reinforcement leaning”, in which deep neural networks are used, and present a case study to explore its effectiveness. (This work is a collaboration with Shuang Liu, Takumi Akazaki, Yihai Duan, Jianye Hao)
Senior Researcher, Software Analytics Research Group, Information Technology Reseaerch Institute, AIST
We are glad to announce that Professor Jan A Bergstra, formerly Director of Informatics, University of Amsterdam, and chair of Informatics Section of Academia Europaea will be visiting Swansea University next week.
Johannes Aldert "Jan" Bergstra (born 1951) is a Dutch computer scientist. His work has focussed on logic and the theoretical foundations of software engineering, especially on formal methods for system design.
Today as a part of the 2nd World Logic Day our Theory group commemorated the work of Erik Palmgren (1963-2019), who sadly passed away last year.
Anton Setzer presented Erik’s most influential papers, which had a big impact on Anton’s own research.
We are looking forward to welcome Paul Schafer, who will be visiting Swansea University on 18 to 23 January.
When people who are logicians ask me about what I do, I tell them that I study computability theory.
Wordpress is loading infos from ac
Please wait for API server guteurls.de
to collect data from
Swansea University is looking forward to host BCTCS2020 this April.
We meet to remember the great logician Erik Palmgren who sadly passed away in November 2019 .
To honor Erik Palmgren’s work, Anton Setzer will give a talk with the title:
Palmgren’s interpretation of inductive definitions in type theory and development of higher type universes in type theory.
The meeting also marks the 2nd World Logic Day.
Venue: Theory Lab (CoFo 209)
Time: 14th of January 2020, 2-3 pm
We are glad to welcome Hideki Tsuiki in Swansea again. This Thursday we really enjoyed his talk on “Imaginary Cubes — Mathematics, Puzzle, Art and Education”.
Abstract: Imaginary cubes are three-dimensional objects with square projections in three orthogonal ways just as a cube has. How many different kinds of imaginary cubes can you imagine? In this talk we show that there are 16 kinds of minimal convex imaginary cubes which includes regular tetrahedron, cuboctahedron, and two objects that we call H and T. As we will explain, H and T have a lot of beautiful mathematical properties related to tiling, fractal, and higher-dimensional geometry, and based on these properties, the speaker has designed a puzzle, constructed three-dimensional math-art objects, and used them for educations at various levels from elemental school to graduate schools. In this talk, I will explain mathematics of imaginary cubes and show the activities I have been engaged in. I will carry a couple of copies of the puzzle and some of the math-art objects so that the audience can enjoy them while I am staying in Swansea.