default search action
23rd FoSSaCS@ETAPS 2020: Dublin, Ireland
- Jean Goubault-Larrecq
, Barbara König
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. Lecture Notes in Computer Science 12077, Springer 2020, ISBN 978-3-030-45230-8 - Usama Mehmood, Shouvik Roy, Radu Grosu, Scott A. Smolka, Scott D. Stoller, Ashish Tiwari:
Neural Flocking: MPC-Based Supervised Learning of Flocking Controllers. 1-16 - Jirí Adámek, Stefan Milius
On Well-Founded and Recursive Coalgebras. 17-36 - S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital:
Timed Negotiations. 37-56 - Mario Alvarez-Picallo, Jean-Simon Pacaud Lemay
Cartesian Difference Categories. 57-76 - Filippo Bonchi
Contextual Equivalence for Signal Flow Graphs. 77-96 - Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. 97-118 - Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a Random Population. 119-135 - Ugo Dal Lago
Decomposing Probabilistic Lambda-Calculi. 136-156 - Cinzia Di Giusto
On the k-synchronizability of Systems. 157-176 - Zinovy Diskin:
General Supervised Learning as Change Propagation with Delta Lenses. 177-197 - Thomas Ehrhard
Non-idempotent Intersection Types in Logical Form. 198-216 - Léo Exibard
On Computability of Data Word Functions Defined by Transducers. 217-236 - Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Minimal Coverability Tree Construction Made Complete and Efficient. 237-256 - Marcelo P. Fiore
Constructing Infinitary Quotient-Inductive Types. 257-276 - Marcelo Fiore
Relative Full Completeness for Bicategorical Cartesian Closed Structure. 277-298 - Mai Gehrke, Tomas Jakl, Luca Reggio
A Duality Theoretic View on Limits of Finite Structures. 299-318 - Mathieu Huot, Sam Staton, Matthijs Vákár
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing. 319-338 - Patricia Johann, Andrew Polonsky:
Deep Induction: Induction Rules for (Truly) Nested Types. 339-358 - David M. Kahn, Jan Hoffmann:
Exponential Automatic Amortized Resource Analysis. 359-380 - Tobias Kappé
Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness. 381-400 - Satoshi Kura
Graded Algebraic Theories. 401-421 - James Laird
A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λ μ-Calculus. 422-441 - Ivan Lanese
An Axiomatic Approach to Reversible Computation. 442-461 - Alessio Mansutti
An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning. 462-481 - Thomas Neele
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. 482-501 - Brigitte Pientka, Ulrich Schöpp
Semantical Analysis of Contextual Types. 502-521 - Christof Löding, Anton Pirogov
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. 522-541 - Miriam Polzer, Sergey Goncharov
Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store. 542-561 - Romain Péchoux
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. 562-581 - David Sherratt, Willem Heijltjes
Spinal Atomic Lambda-Calculus. 582-601 - Gerco van Heerdt, Clemens Kupke
Learning Weighted Automata over Principal Ideal Domains. 602-621 - Florian Zuleger:
The Polynomial Complexity of Vector Addition Systems with States. 622-641
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-29 21:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: