FoSSaCS seeks original papers on foundational research with a clear significance for software science. The conference invites submissions on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems. The specific topics covered by the conference include, but are not limited to, the following:
- categorical models and logics;
- language theory, automata, and games;
- modal, spatial, and temporal logics;
- type theory and proof theory;
- concurrency theory and process calculi;
- rewriting theory;
- semantics of programming languages;
- program analysis, correctness, transformation, and verification;
- logics of programming;
- software specification and refinement;
- models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems;
- emerging models of computation;
- logical aspects of computational complexity;
- models of software security;
- logical foundations of data bases
Invited speaker
Thomas Colcombet (IRIF, France)
Dates
Mon 8 AprDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Mon 8 Apr
Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:30 - 12:30 | |||
10:30 30mTalk | Trees in Partial Higher Dimensional AutomataBest paper nomination FOSSACS Link to publication | ||
11:00 30mTalk | Rewriting Abstract Structures: Materialization Explained CategoricallyBest paper nomination FOSSACS Andrea Corradini , Tobias Heindel , Barbara König University of Duisburg-Essen, Dennis Nolte University of Duisburg-Essen, Arend Rensink University of Twente, The Netherlands Link to publication | ||
11:30 30mTalk | Change Actions: Models of Generalised Differentiation FOSSACS Link to publication | ||
12:00 30mTalk | Causal Inference by String Diagram Surgery FOSSACS Aleks Kissinger Radboud University, Bart Jacobs Radboud University Nijmegen, Fabio Zanasi University College London Link to publication |
14:00 - 16:00 | Categories and (Co)algebraFOSSACS at MOON Chair(s): Sergey Goncharov FAU Erlangen-Nürnberg, Lehrstuhl 8 | ||
14:00 30mTalk | Equational Axiomatization of Algebras wth Structure FOSSACS Link to publication | ||
14:30 30mTalk | Equational Theories and Monads from Polynomial Cayley Representations FOSSACS Maciej Piróg University of Wrocław, Piotr Polesiuk University of Wrocław, Filip Sieczkowski University of Wrocław Link to publication | ||
15:00 30mTalk | Path category for free - Open morphisms from coalgebras with non-deterministic branching FOSSACS Thorsten Wißmann Friedrich-Alexander-Universität Erlangen, Jérémy Dubut , Shin-ya Katsumata National Institute of Informatics, Ichiro Hasuo National Institute of Informatics Link to publication | ||
15:30 30mTalk | Coalgebra Learning via Duality FOSSACS Link to publication |
Tue 9 AprDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Tue 9 Apr
Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:30 - 12:30 | |||
10:30 30mTalk | Justness: A Completeness Criterion for Capturing Liveness Properties FOSSACS Link to publication | ||
11:00 30mTalk | A Complete Normal-Form Bisimilarity for State FOSSACS Dariusz Biernacki University of Wrocław, Sergueï Lenglet University of Lorraine, France, Piotr Polesiuk University of Wrocław Link to publication | ||
11:30 30mTalk | A Sound and Complete Logic for Algebraic Effects FOSSACS Link to publication | ||
12:00 30mTalk | Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces FOSSACS Link to publication |
14:00 - 16:00 | |||
14:00 30mTalk | A Dialectica-Like Interpretation of a Linear MSO on Infinite Words FOSSACS Link to publication | ||
14:30 30mTalk | Higher-order distributions for differential linear logic FOSSACS Link to publication | ||
15:00 30mTalk | Causality in Linear Logic: Full Completeness and Injectivity (unit-free multiplicative-additive fragment) FOSSACS Link to publication | ||
15:30 30mTalk | Resource-Tracking Concurrent Games FOSSACS Link to publication |
Wed 10 AprDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Wed 10 Apr
Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:30 - 12:30 | |||
10:30 30mTalk | Optimal Satisfiability Checking for Arithmetic mu-Calculi FOSSACS Link to publication | ||
11:00 30mTalk | Two-Way Parikh Automata with a Visibly Pushdown Stack FOSSACS Link to publication | ||
11:30 30mTalk | Constructing Inductive-Inductive Types in Cubical Type Theory FOSSACS Link to publication | ||
12:00 30mTalk | Towards a Structural Proof Theory of Probabilistic mu–calculi FOSSACS Link to publication |
14:00 - 16:00 | |||
14:00 30mTalk | Identifiers in Registers – Describing Network Algorithms with Logic FOSSACS Benedikt Bollig CNRS, LSV, ENS Paris-Saclay, Patricia Bouyer LSV, CNRS & ENS Cachan, University Paris Saclay, Fabian Reiter Link to publication | ||
14:30 30mTalk | Continuous Reachability for Unordered Data Petri Nets is in PTime FOSSACS Link to publication | ||
15:00 30mTalk | Languages ordered by the subword order FOSSACS Link to publication | ||
15:30 30mTalk | Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time FOSSACS Link to publication |
Thu 11 AprDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Thu 11 Apr
Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
14:00 - 16:00 | |||
14:00 30mTalk | Tight Worst-Case Bounds for Polynomial Loop Programs FOSSACS Link to publication | ||
14:30 30mTalk | Kleene algebra with hypotheses FOSSACS Link to publication | ||
15:00 30mTalk | The Impatient May Use Limited Optimism to Minimize Regret FOSSACS Link to publication | ||
15:30 30mTalk | Partial and Conditional Expectations in Markov Decision Processes with Integer Weights FOSSACS Link to publication |
16:30 - 17:00 | |||
16:30 30mTalk | The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary DomainsBest paper nomination FOSSACS Link to publication |
Accepted Papers
Submission
See the ETAPS 2019 joint call for papers. Submit your paper via the FoSSaCS 2019 author interface of Easychair.
The review process of FoSSaCS 2019 is single-blind, with a rebuttal phase.
FoSSaCS 2019 has just one paper category: regular research papers of max 15 pages (excluding bibliography).