Foundations of Software Science and Computation Structures : : 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings / / edited by Orna Kupferman, Pawel Sobocinski.
This open access book constitutes the proceedings of the 26th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2023, which was held during April 22-27, 2023, in Paris, France, as part of the European Joint Conferences on Theory and Practice of Softwar...
Saved in:
| Superior document: | Lecture notes in computer science ; Volume 13992 |
|---|---|
| TeilnehmendeR: | |
| Place / Publishing House: | Cham : : Springer Nature Switzerland,, 2023. |
| Year of Publication: | 2023 |
| Edition: | 1st ed. |
| Language: | English |
| Series: | Lecture notes in computer science ;
Volume 13992. |
| Physical Description: | 1 online resource (xiv, 562 pages) :; illustrations (some color). |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- When Programs Have to Watch Paint Dry Deciding contextual equivalence of nu-calculus with effectful contexts Kantorovich Functors and Characteristic Logics for Behavioural Distances A Logical Framework with Higher-Order Rational (Circular) Terms A Higher-Order Language for Markov Kernels and Linear Operators A Formal Logic for Formal Category Theory A Strict Constrained Superposition Calculus for Graphs A programming language characterizing quantum polynomial time On the Existential Arithmetics with Addition and Bitwise Minimum Coverability in 2-VASS with One Unary Counter is in NP On History-Deterministic One-Counter Nets Unboundedness problems for machines with reversal-bounded counters Reverse Bisimilarity vs. Forward Bisimilarity Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains Weighted and Branching Bisimilarities from Generalized Open Maps Preservation and Reflection of Bisimilarity via Invertible Steps Quantitative Safety and Liveness On the Comparison of Discounted-Sum Automata with Multiple Discount Factors Fast Matching of Regular Patterns with Synchronizing Counting Compositional Learning for Interleaving Parallel Automata Pebble minimization: the last theorems Noetherian topologies defined via fixed-points An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic Just Testing Model and Program Repair via Group Actions Subgame optimal strategies in finite concurrent games with prefix-independent objectives.