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

Front Cover
Jean Goubault-Larrecq, Barbara König
Springer Nature, Apr 17, 2020 - Mathematics - 644 pages

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

 

Selected pages

Contents

MPCbased Supervised Learning of Flocking Controllers
1
On WellFounded and Recursive Coalgebras
17
Timed Negotiations
37
Cartesian Difference Categories
57
Contextual Equivalence for Signal Flow Graphs
77
Parameterized Synthesis for Fragments of FirstOrder Logic over Data Words
97
Controlling a random population
119
Decomposing Probabilistic LambdaCalculi
136
Induction Rules for Truly Nested Types
339
Exponential Automatic Amortized Resource Analysis
359
from Hypotheses to Completeness
381
Graded Algebraic Theories
401
From untyped to secondorder lazy λμcalculus
422
An Axiomatic Approach to Reversible Computation
442
on the Towerhardness of logics featuring reachability and submodel reasoning
462
The Inconsistent Labelling Problem of StutterPreserving PartialOrder Reduction
482

On the ksynchronizability of Systems
157
General Supervised Learning as Change Propagation with Delta Lenses
177
Nonidempotent intersection types in logical form
198
On Computability of Data Word Functions Defined by Transducers
217
Minimal Coverability Tree Construction Made Complete and Efficient
237
Constructing Infinitary QuotientInductive Types
257
Relative full completeness for bicategorical cartesian closed structure
277
A duality theoretic view on limits of finite structures
299
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing
319
Semantical Analysis of Contextual Types
502
Ambiguity Weakness and Regularity in Probabilistic Büchi Automata
522
A BIHyperdoctrine for Full Ground Store
542
Causality and Affine Type Theory
562
Spinal Atomic LambdaCalculus
582
Learning Weighted Automata over Principal Ideal Domains
602
The Polynomial Complexity of Vector Addition Systems with States
622
Author Index
642
Copyright

Other editions - View all

Foundations of Software Science and Computation Structures: 23rd ...
Jean Goubault-Larrecq,Barbara König
Limited preview - 2020
Foundations of Software Science and Computation Structures: 23rd ...
Jean Goubault-Larrecq,Barbara König
No preview available - 2020

Common terms and phrases

abstraction accepting action addition algebra algorithm allows apply automata bound called Cartesian closed coalgebra complete composition Computer Computer Science condition configuration consider construction contains context corresponding decidable defined Definition denote derive difference differential elements equational equivalence example execution exists expressive extended Figure finite flow formula function functor give given graded graph hence holds hypotheses included induction infinite initial International interpretation introduce labelled language Lemma license linear logic monad morphism natural negotiations node Note notion objects obtain operations pair path positive present preserves problem Programming proof properties Proposition prove recursive reduction relation represents requires respectively result rules satisfies semantics sequence space step structure Theorem theory transitions University variables write

Bibliographic information

TitleFoundations 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
Volume 12077 of Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
EditorsJean Goubault-Larrecq, Barbara König
PublisherSpringer Nature, 2020
ISBN303045231X, 9783030452315
Length644 pages
Subjects ›  › 

Computers / Artificial Intelligence / General
Computers / Data Science / General
Computers / Languages / General
Computers / Networking / General
Computers / Programming / General
Mathematics / Discrete Mathematics
Mathematics / General
Mathematics / History & Philosophy
Mathematics / Logic
  
Export CitationBiBTeX EndNote RefMan