16.12.2019, 17:15. Venue:room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

]]>tactic subsystem of Coq provides means for proof automation, which

facilitates a broad range of its application as a proof assistant. At

the same time the attempts to utilize the rich type system of Coq for

writing dependently typed programs often face certain problems. In

particular, elimination for deep dependent types (using such tactics as

inversion/destruct as well as direct pattern matching construct) can be

cumbersome. In the talk we consider some of these difficulties and

present the ways to work them around.

Speaker: Dmitrii Boulytchev

02.11.2019, 17:15.

Venue:room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28 ]]>Ссылка на статью: https://vhellendoorn.github.io/PDF/icse2019.pdf

Докладчик: Анастасия Тучина.

Язык доклада: русский.

Дата и время: 11-е декабря, 19:30-21:00.

Место: Таймс, аудитория 404.

Видео с семинаров доступно по ссылке: http://bit.ly/MLJBSeminars

]]>We will investigate parallel complexity of variants of CFL-reachability problem with interesting subclasses of context-free grammars and graphs. A Boolean circuit for this problem will be presented. We will obtain characteristic affecting the effectiveness of Boolean circuit and will observe lower and upper bounds on its value.

Speaker: Ekaterina Shemetova

02.11.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

18.11.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg
State University, Stary Peterhof, Universitetski pr., 28

model typeclasses, synthesize proofs. Programmable type inference is one of the key ingredients

for the successful formalization of the Odd Order Theorem and is being widely used in the Mathcomp library.

On concrete examples we will show the inner workings of Coq's unification algorithm,

touch upon the questions of organizing algebraic hierarchies, and briefly compare

the language of Canonical Structures to the one of Type Classes and Unification Hints.

Presenter: Anton Trunov

11.11.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint PetersburgState University, Stary Peterhof, Universitetski pr., 28

]]>В Сочи Павел сделал обзорный доклад про автоматический анализ и генерацию юмора, а в Екатеринбурге -- о подходах и данных для генерации программного кода на основе текстов на естественном языке.

]]>NSUCRYPTO is the unique cryptographic Olympiad containing scientific mathematical problems for professionals, school and university students from any country. Its aim is to involve young researchers in solving curious and tough scientific problems of modern cryptography. From the very beginning, the concept of the Olympiad was not to focus on solving olympic tasks but on including unsolved research problems at the intersection of mathematics and cryptography. There were more than 1600 participants from 52 countries in the first five Olympiads NSUCRYPTO (2014 - 2018).

We are looking forward for the results! www.nsucrypto.nsu.ru

]]>28.10.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint PetersburgState University, Stary Peterhof, Universitetski pr., 28

]]>21.10.2019, 17:15.

State University, Stary Peterhof, Universitetski pr., 28

]]>If we follow the tradition and take widely known first order set theory, namely ZFC, as a foundation, we will fail soon. Why? ZFC and first order languages "as is" are not suitable for a computer to verify as well as for a human to read. In the talk we consider different solutions for these obstacles and how they adopted by Metamath project.

In the second part of the talk we will gradually shift from the very basic notion of class to the very abstract notion of category. On this way we consider familiar concepts of ordinals, relations, functions, numbers and algebraic structures.

Presenter: Kirill K. Smirnov

7.10.2019, 17:15.

State University, Stary Peterhof, Universitetski pr., 28

]]>Целью семинара было собрать в одном месте представителей из разных научных областей, чтобы обсудить перспективы использования методов искусственного интеллекта, машинного обучения и обработки естественного языка в программной инженерии. В мероприятии приняли участие 24 исследователя из Великобритании и России. Российские участники приехали в Йорк из Санкт-Петербурга, Москвы, Перми, Казани и Новосибирска и Нижнего Новгорода. Программа семинара включала обзорные лекции:

- James Cussens (York University) Bayesian Network Learning for Software Engineering
- Дмитрий Кознов (СПбГУ) Duplicate Management in Software Data
- Тимофей Брыксин (JBR/ВШЭ СПб/СПбГУ) SE applications with ML aspects
- Павел Браславский (JBR/ВШЭ СПб/УрФУ) Natural Language Understanding and its Application to Code Generation
- Suresh Manandhar (York University) Attention based models for image and multi modal data analysis

В рамках стендовой секции участники представили свои свои текущие научные проекты. Важной части семинара была работа в группах по выработке планов возможных совместных проектов и исследований.

]]>The KA theory has many practically interesting models.

Moreover, it possesses several good properties, including the decidability and completeness of equational fragment.

In this talk, an overview of various extensions of this theory will be given

(including Kleene algebras with converse, Kleene allegories, Kleene algebras with tests and concurrent Kleene algebras).

to the problem of validation of compiler optimizations and Hoare-style program verification.

Presenter: Eugenii Moiseenko

7.10.2019, 17:15.

State University, Stary Peterhof, Universitetski pr., 28

]]>Presenter: Petr Lozov

30.09.2019, 17:15.

State University, Stary Peterhof, Universitetski pr., 28

]]>We want to discuss what few-shot learning is, how to do it right, what kind of problems it can solve and how we use it in our projects.

In this talk, we will deeply look at the few-shot learning approaches. Investigate different architectures and datasets. Figure out when the few-shot learning works and when does not. In the end, you should be able to understand all landscape of few-shot learning field and could continue your journey in this area.

Speaker: Kyryl Truskovskyi.

Presentation language: Russian.

Date and time: September 24th, 8:00-9:30 pm.

Location: Times, room 204.

Videos from previous seminars are available at http://bit.ly/MLJBSeminars

]]>The seminar will be held at 403 LK at MIPT on September 27 from 12.20 to 13.45.

]]>In the first seminar of this season, we research this topic by reviewing two recent papers that aim to study the changes that machine learning brings to development by conducting an extensive survey among the developers, as well as describe the experience of AI developing teams and present it in a structured fashion to uncover their common features and create an effective development strategy.

Speakers: Yaroslav Golubev.

Presentation language: Russian.

Date and time: September 18th, 7:30-9:00 pm.

Location: Times, room 404.

Videos from previous seminars are available at http://bit.ly/MLJBSeminars

]]>At the seminar, we will talk about RevNets, how they allow to reduce memory consumption and protect against adversarial attacks.

Speaker: Rauf Kurbanov.

Presentation language: Russian.

Date and time: September 17th, 8:00-9:30 pm.

Location: Times, room 204.

Videos from previous seminars are available at http://bit.ly/MLJBSeminars

]]>