[TYPES/announce] Last CfP: SCSS 2021

[Temur Kutsia]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

=
SCSS 2021
The 9th International Symposium on Symbolic Computation in Software Science
  -- In the era of Computational and Artificial Intelligence  --

September 8--10, 2021, virtual

Organized by RISC, Johannes Kepler University Linz, Austria
https://www.risc.jku.at/conferences/scss2021/
=


Overview

Symbolic Computation is the science of computing with symbolic objects
(terms, formulae, programs, representations of algebraic objects, etc.).
Powerful algorithms have been developed during the past decades for the
major subareas of symbolic computation: computer algebra and
computational logic. These algorithms and methods are successfully
applied in various fields, including software science, which covers a
broad range of topics about software construction and analysis.

Meanwhile, artificial intelligence methods and machine learning
algorithms are widely used nowadays in various domains and, in
particular, combined with symbolic computation. Several approaches mix
artificial intelligence and symbolic methods and tools deployed over
large corpora to create what is known as cognitive systems. Cognitive
computing focuses on building systems that interact with humans
naturally by reasoning, aiming at learning at scale.

The purpose of SCSS 2021 is to promote research on theoretical and
practical aspects of symbolic computation in software science, combined
with modern artificial intelligence techniques.


Scope
--
SCSS 2021 solicits submissions on all aspects of symbolic computation
and their applications in software science, in combination with
artificial intelligence and cognitive computing techniques. The topics
of the symposium include, but are not limited to the following:

- automated reasoning, knowledge reasoning, common-sense reasoning and
reasoning in science
- algorithm (program) synthesis and/or verification, alignment and joint
processing of formal, semi-formal, and informal libraries.
- formal methods for the analysis of network and system security
- termination analysis and complexity analysis of algorithms (programs)
- extraction of specifications from algorithms (programs)
- theorem proving methods and techniques, collaboration between
automated and interactive theorem proving
- proof carrying code
- generation of inductive assertion for algorithm (programs)
- algorithm (program) transformations
- combinations of linguistic/learning-based and semantic/reasoning methods
- formalization and computerization of knowledge (maths, medicine,
economy, etc.)
- methods for large-scale computer understanding of mathematics and science
- artificial intelligence, machine learning and big-data methods in
theorem proving and mathematics
- formal verification of artificial intelligence and machine learning
algorithms, explainable artificial intelligence, symbolic artificial
intelligence
- cognitive computing, cognitive vision, perception systems and
artificial reasoners for robotics
- component-based programming
- computational origami
- query languages (in particular for XML documents)
- semantic web and cloud computing


Important Dates
---
May 18: title and single-paragraph abstract submission deadline.
May 25: paper submission deadline.
July 12: notification deadline.
July 30: final paper submission deadline.
September 8-10, 2021: the symposium dates (virtual).


Keynote speaker
---
Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria)


Invited Speakers
--
Tateaki Sasaki (University of Tsukuba, Japan)
Martina Seidl (Johannes Kepler University Linz, Austria)
Stephen M. Watt (University of Waterloo, Canada)


General Chairs
-
Adel Bouhoula (Arabian Gulf University, Bahrain)
Tetsuo Ida (University of Tsukuba, Japan)


Program Chair
-
Temur Kutsia (Johannes Kepler University, Austria)


Program Committee
-
David Cerna (Czech Academy of Sciences, Czech Republic,
 and Johannes Kepler University Linz, Austria)
Changbo Chen (Chinese Academy of Sciences, China)
Rachid Echahed (CNRS, Grenoble, France)
Seyed Hossein Haeri (UC Louvain, Belgium)
Mohamed-Bécha Kaâniche (Sup'Com, Carthage University, Tunisia)
Cezary Kaliszyk (University of Innsbruck, Austria)
Yukiyoshi Kameyama (University of Tsukuba, Japan)
Michael Kohlhase (University of Erlangen-Nuremberg, Germany)
Laura Kovacs (Vienna University of Technology, Austria)
Temur Kutsia (Johannes Kepler University Linz, Austria) (Chair)
Zied Lachiri (ENIT, University of Tunis El Manar, Tunisia)
Christopher Lynch (Clarkson University, USA)
Mircea Marin (West University of Timisoara, Romania)
Yasuhiko Minamide (Tokyo Institute of Technology, Japan)
Yoshihiro Mizoguchi (Kyushu University, Japan)
Julien Narboux (Strasbourg University, France)
Michaël Rusinowitch (INRIA, France)
Wolfgang Schreiner (Johannes Kepler University Linz, 

[TYPES/announce] Seminar talk by Georg Moser on Automated Analysis of Splaying et al. (SCOT seminar)

[Baillot Patrick]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


Dear colleagues,

   The recently started web Seminar on Semantic and Formal Approaches 
to Complexity (SCOT) can be of interest to some members of the Types 
community. The next talk will be given by Georg Moser:


* Tuesday May 18th 2021, 3pm-4pm (CEST). *Georg Moser *(University of 
Innsbruck). *Title*: Automated Analysis of Splaying et al.

( the virtual room will open at 2:40 for coffee/chat)

Abstract: Being able to argue about the performance of self-adjusting 
data structures such as splay trees has been a main objective, when 
Sleator and Tarjan introduced the notion of *amortised* complexity. 
Analysing these data structures requires sophisticated potential 
functions, which typically contain logarithmic expressions. Possibly for 
these reasons, and despite the recent progress in automated resource 
analysis, they have so far eluded automation.
   In this talk, I will report on the first fully-automated amortised 
complexity analysis of self-adjusting data structures and the underlying 
theory. Following earlier work, the analysis is based on potential 
function templates with unknown coefficients.

This is joint work with Lorenz Leutgeb, David Obwaller and Florian Zuleger.

* *Connexion informations:* To get the connexion link please subscribe 
to the mailing list; for that send an email with subject "subscribe 
scot_webinar" and empty body to sy...@groupes.renater.fr


**About the seminar:*
The SCOT Seminar is devoted to the problem of reasoning on the 
complexity of programs in formal and compositional ways. Many approaches 
have been exploited for that, taking advantage from logic, category 
theory, denotational semantics, type systems, interpretations, etc. This 
seminar aims at providing a forum of discussion for all issues related 
to these questions, from foundational aspects on semantics of complexity 
to automated time or space complexity analysis. The seminar is held 
virtually and on a monthly basis.


Best regards
For the seminar:
Isabel Oitavem, Patrick Baillot, Ugo Dal Lago


Seminar web page: http://www.cs.unibo.it/~dallago/SCOSEM/
The list's homepage: https://groupes.renater.fr/sympa/info/scot_webinar
General information  about mailing lists: 
https://groupes.renater.fr/sympa/help/introduction
To unsubscribe from this list: send an email with subject "unsubscribe 
scot_webinar" and empty body to sy...@groupes.renater.fr
If you wish to subscribe: same procedure with subject "subscribe 
scot_webinar"

[TYPES/announce] 5 permanent positions (lecturer, senior lecturer, associate professor) at Swansea University, UK

[Roggenbach M.]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

5 Permanent Posts at Swansea University, UK - Closing Date: 13-06-2021

  *   LECTURER/ SENIOR LECTURER IN COMPUTER SCIENCE (RESEARCH) - 
https://tinyurl.com/SU-CSresearch2021
  *   ASSOCIATE PROFESSOR - COMPUTER SCIENCE (RESEARCH) - 
https://tinyurl.com/SU-CSresearchAP2021
  *   LECTURER/SENIOR LECTURER IN COMPUTER SCIENCE (TEACHING) - 
https://tinyurl.com/SU-CSteaching2021

Swansea University is seeking to appoint motivated individuals to enhance our 
research and learning and teaching within Computer Science.
The research focus can be in any area of Computer Science.  The Department of 
Computer Science at Swansea boasts one of the largest Theory groups in the UK. 
Over the past 50 years, Swansea theoreticians have made seminal discoveries in 
the theories of data, algorithms, processes, languages and verification.

Informal enquiries can be sent to Prof M Roggenbach (Director of Research): 
m.roggenb...@swansea.ac.uk

[TYPES/announce] Seminar talk on Mathematical Structures in Dependent Type Theory

[Harley D. Eades III]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Hi, everyone.

On Friday, May 14, 2021 between 9am and 10am EDT (1pm - 2pm UTC), Assia
Mahboubi will be giving a presentation as part of the CS Colloquium Series
at Augusta University.

Presentation details can be found here:

https://the-au-forml-lab.github.io/colloquium_talks/Mahboubi.html

Assia will be talking about the design of hierarchies of
algebraic structures in proof assistants based on dependent type theory.
It's going to be super interesting!

This talk will be open to the general public via Zoom only.  We will not be
recording or stream the presentation.  Please let me know if you would like
to join and I'll send you the Zoom link.

Feel free to share this message with everyone you know.

I hope all of you, your family and friends are doing well!

Very best, Harley