Skip to main content
  • Conference proceedings
  • Open Access
  • © 2020

Foundations of Software Science and Computation Structures

23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings

Conference proceedings info: FoSSaCS 2020.

Buying options

Softcover Book USD 49.99
Price excludes VAT (USA)

Table of contents (32 papers)

  1. Front Matter

    Pages i-xv
  2. Neural Flocking: MPC-Based Supervised Learning of Flocking Controllers

    • Usama Mehmood, Shouvik Roy, Radu Grosu, Scott A. Smolka, Scott D. Stoller, Ashish Tiwari
    Pages 1-16Open Access
  3. On Well-Founded and Recursive Coalgebras

    • Jiří Adámek, Stefan Milius, Lawrence S. Moss
    Pages 17-36Open Access
  4. Timed Negotiations

    • S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital
    Pages 37-56Open Access
  5. Cartesian Difference Categories

    • Mario Alvarez-Picallo, Jean-Simon Pacaud Lemay
    Pages 57-76Open Access
  6. Contextual Equivalence for Signal Flow Graphs

    • Filippo Bonchi, Robin Piedeleu, Paweł Sobociński, Fabio Zanasi
    Pages 77-96Open Access
  7. Parameterized Synthesis for Fragments of First-Order Logic Over Data Words

    • Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
    Pages 97-118Open Access
  8. Controlling a Random Population

    • Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
    Pages 119-135Open Access
  9. Decomposing Probabilistic Lambda-Calculi

    • Ugo Dal Lago, Giulio Guerrieri, Willem Heijltjes
    Pages 136-156Open Access
  10. On the k-synchronizability of Systems

    • Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes
    Pages 157-176Open Access
  11. Non-idempotent Intersection Types in Logical Form

    • Thomas Ehrhard
    Pages 198-216Open Access
  12. On Computability of Data Word Functions Defined by Transducers

    • Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
    Pages 217-236Open Access
  13. Minimal Coverability Tree Construction Made Complete and Efficient

    • Alain Finkel, Serge Haddad, Igor Khmelnitsky
    Pages 237-256Open Access
  14. Constructing Infinitary Quotient-Inductive Types

    • Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp
    Pages 257-276Open Access
  15. Relative Full Completeness for Bicategorical Cartesian Closed Structure

    • Marcelo Fiore, Philip Saville
    Pages 277-298Open Access
  16. A Duality Theoretic View on Limits of Finite Structures

    • Mai Gehrke, Tomáš Jakl, Luca Reggio
    Pages 299-318Open Access
  17. Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

    • Mathieu Huot, Sam Staton, Matthijs Vákár
    Pages 319-338Open Access
  18. Deep Induction: Induction Rules for (Truly) Nested Types

    • Patricia Johann, Andrew Polonsky
    Pages 339-358Open Access
  19. Exponential Automatic Amortized Resource Analysis

    • David M. Kahn, Jan Hoffmann
    Pages 359-380Open Access

Other Volumes

  1. Foundations of Software Science and Computation Structures

    23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings

About this book

This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020.
The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions.
The papers cover topics such as 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; and logical foundations of data bases

Keywords

  • 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
  • emerging models of computation
  • logical aspects of computational complexity
  • models of software security
  • logical foundations of data bases
  • mathematics
  • artificial intellegence
  • formal logic
  • linguistics

Editors and Affiliations

  • ENS/CNRS, Université Paris-Saclay, Cachan, France

    Jean Goubault-Larrecq

  • University of Duisburg-Essen, Duisburg, Germany

    Barbara König

Bibliographic Information

Buying options

Softcover Book USD 49.99
Price excludes VAT (USA)