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 /
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:
Corporate Authors: | , |
---|---|
Other Authors: | , |
Format: | Electronic Conference Proceeding eBook |
Language: | English |
Published: |
Cham, Switzerland :
Springer,
2023.
|
Series: | Lecture notes in computer science ;
13992. Lecture notes in computer science. Advanced research in computing and software science. |
Subjects: | |
Online Access: | CONNECT CONNECT |
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. .