ETAPS 2019
Sat 6 - Thu 11 April 2019 Prague, Czech Republic

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
You're viewing the program in a time zone which is different from your device's time zone -

Mon 8 Apr
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna

10:30 - 12:30: Applied CategoriesFOSSACS at MOON
Chair(s): Alex SimpsonUniversity of Ljubljana
10:30 - 11:00
Talk
Trees in Partial Higher Dimensional AutomataBest paper nomination
FOSSACS
Link to publication
11:00 - 11:30
Talk
Rewriting Abstract Structures: Materialization Explained CategoricallyBest paper nomination
FOSSACS
Andrea Corradini, Tobias Heindel, Barbara KönigUniversity of Duisburg-Essen, Dennis NolteUniversity of Duisburg-Essen, Arend RensinkUniversity of Twente, The Netherlands
Link to publication
11:30 - 12:00
Talk
Change Actions: Models of Generalised Differentiation
FOSSACS
Mario Alvarez-PicalloUniversity of Oxford, C.-H. Luke OngUniversity of Oxford
Link to publication
12:00 - 12:30
Talk
Causal Inference by String Diagram Surgery
FOSSACS
Aleks KissingerRadboud University, Bart JacobsRadboud University Nijmegen, Fabio ZanasiUniversity College London
Link to publication
14:00 - 16:00: Categories and (Co)algebraFOSSACS at MOON
Chair(s): Sergey GoncharovFAU Erlangen-Nürnberg, Lehrstuhl 8
14:00 - 14:30
Talk
Equational Axiomatization of Algebras wth Structure
FOSSACS
Link to publication
14:30 - 15:00
Talk
Equational Theories and Monads from Polynomial Cayley Representations
FOSSACS
Maciej PirógUniversity of Wrocław, Piotr PolesiukUniversity of Wrocław, Filip SieczkowskiUniversity of Wrocław
Link to publication
15:00 - 15:30
Talk
Path category for free - Open morphisms from coalgebras with non-deterministic branching
FOSSACS
Thorsten Wißmann, Jérémy Dubut, Shin-ya KatsumataNational Institute of Informatics, Ichiro HasuoNational Institute of Informatics
Link to publication
15:30 - 16:00
Talk
Coalgebra Learning via Duality
FOSSACS
Simone Barlocco, Clemens KupkeUniversity of Strathclyde, Jurriaan RotRadboud University Nijmegen
Link to publication

Tue 9 Apr
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna

Wed 10 Apr
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna

14:00 - 16:00: AutomataFOSSACS at MOON
Chair(s): Thomas ColcombetIRIF, University Paris Diderot and CNRS, France
14:00 - 14:30
Talk
Identifiers in Registers – Describing Network Algorithms with Logic
FOSSACS
Benedikt BolligCNRS, LSV, ENS Paris-Saclay, Patricia BouyerLSV, CNRS & ENS Cachan, University Paris Saclay, Fabian Reiter
Link to publication
14:30 - 15:00
Talk
Continuous Reachability for Unordered Data Petri Nets is in PTime
FOSSACS
Link to publication
15:00 - 15:30
Talk
Languages ordered by the subword order
FOSSACS
Dietrich Kuske, Georg ZetzscheMax Planck Institute for Software Systems (MPI-SWS)
Link to publication
15:30 - 16:00
Talk
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
FOSSACS
Helmut SeidlTechnische Universität München, Raphaela Palenta, Sebastian Maneth
Link to publication

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).

Accepted Papers

Title
A Complete Normal-Form Bisimilarity for State
FOSSACS
Link to publication
A Dialectica-Like Interpretation of a Linear MSO on Infinite Words
FOSSACS
Link to publication
A Sound and Complete Logic for Algebraic Effects
FOSSACS
Link to publication
Causal Inference by String Diagram Surgery
FOSSACS
Link to publication
Causality in Linear Logic: Full Completeness and Injectivity (unit-free multiplicative-additive fragment)
FOSSACS
Link to publication
Change Actions: Models of Generalised Differentiation
FOSSACS
Link to publication
Coalgebra Learning via Duality
FOSSACS
Link to publication
Constructing Inductive-Inductive Types in Cubical Type Theory
FOSSACS
Link to publication
Continuous Reachability for Unordered Data Petri Nets is in PTime
FOSSACS
Link to publication
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
FOSSACS
Link to publication
Equational Axiomatization of Algebras wth Structure
FOSSACS
Link to publication
Equational Theories and Monads from Polynomial Cayley Representations
FOSSACS
Link to publication
Higher-order distributions for differential linear logic
FOSSACS
Link to publication
Identifiers in Registers – Describing Network Algorithms with Logic
FOSSACS
Link to publication
Justness: A Completeness Criterion for Capturing Liveness Properties
FOSSACS
Link to publication
Kleene algebra with hypotheses
FOSSACS
Link to publication
Languages ordered by the subword order
FOSSACS
Link to publication
Optimal Satisfiability Checking for Arithmetic mu-Calculi
FOSSACS
Link to publication
Partial and Conditional Expectations in Markov Decision Processes with Integer Weights
FOSSACS
Link to publication
Path category for free - Open morphisms from coalgebras with non-deterministic branching
FOSSACS
Link to publication
Resource-Tracking Concurrent Games
FOSSACS
Link to publication
Rewriting Abstract Structures: Materialization Explained CategoricallyBest paper nomination
FOSSACS
Link to publication
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces
FOSSACS
Link to publication
The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary DomainsBest paper nomination
FOSSACS
Link to publication
The Impatient May Use Limited Optimism to Minimize Regret
FOSSACS
Link to publication
Tight Worst-Case Bounds for Polynomial Loop Programs
FOSSACS
Link to publication
Towards a Structural Proof Theory of Probabilistic mu–calculi
FOSSACS
Link to publication
Trees in Partial Higher Dimensional AutomataBest paper nomination
FOSSACS
Link to publication
Two-Way Parikh Automata with a Visibly Pushdown Stack
FOSSACS
Link to publication