Abstract is missing.
- Pattern Graphs and Rule-Based Models: The Semantics of KappaJonathan Hayman, Tobias Heindel. 1-16 [doi]
- History-Register AutomataNikos Tzevelekos, Radu Grigore. 17-33 [doi]
- Fatal Attractors in Parity GamesMichael Huth, Jim Huan-Pu Kuo, Nir Piterman. 34-49 [doi]
- On Unique Decomposition of Processes in the Applied π-CalculusJannik Dreier, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech. 50-64 [doi]
- Bounded Context-Switching and Reentrant LockingRémi Bonnet, Rohit Chadha. 65-80 [doi]
- Reachability of Communicating Timed ProcessesLorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre. 81-96 [doi]
- Modular Bisimulation Theory for Computations and ValuesMartin Churchill, Peter D. Mosses. 97-112 [doi]
- Checking Bisimilarity for Attributed Graph TransformationFernando Orejas, Artur Boronat, Ulrike Golas, Nikos Mylonakis. 113-128 [doi]
- Comodels and Effects in Mathematical Operational SemanticsFaris Abou-Saleh, Dirk Pattinson. 129-144 [doi]
- Preorders on Monads and Coalgebraic SimulationsShin-ya Katsumata, Tetsuya Sato. 145-160 [doi]
- A Proof System for Compositional Verification of Probabilistic Concurrent ProcessesMatteo Mio, Alex Simpson. 161-176 [doi]
- Partiality and Recursion in Higher-Order LogicLukasz Czajka. 177-192 [doi]
- Some Sahlqvist Completeness Results for Coalgebraic LogicsFredrik Dahlqvist, Dirk Pattinson. 193-208 [doi]
- Cut Elimination in Nested Sequents for Intuitionistic Modal LogicsLutz Straßburger. 209-224 [doi]
- On Monadic Parametricity of Second-Order FunctionalsAndrej Bauer, Martin Hofmann, Aleksandr Karbyshev. 225-240 [doi]
- Deconstructing General References via Game SemanticsAndrzej S. Murawski, Nikos Tzevelekos. 241-256 [doi]
- Separation Logic for Non-local Control Flow and Block Scope VariablesRobbert Krebbers, Freek Wiedijk. 257-272 [doi]
- The Parametric Ordinal-Recursive Complexity of Post Embedding ProblemsPrateek Karandikar, Sylvain Schmitz. 273-288 [doi]
- Deciding Definability by Deterministic Regular ExpressionsWojciech Czerwinski, Claire David, Katja Losemann, Wim Martens. 289-304 [doi]
- Type-Based Complexity Analysis for Fork ProcessesEmmanuel Hainry, Jean-Yves Marion, Romain Péchoux. 305-320 [doi]
- Pure Pointer Programs and Tree IsomorphismMartin Hofmann, Ramyaa Ramyaa, Ulrich Schöpp. 321-336 [doi]
- A Language for Differentiable FunctionsPietro Di Gianantonio, Abbas Edalat. 337-352 [doi]
- Computing Quantiles in Markov Reward ModelsMichael Ummels, Christel Baier. 353-368 [doi]
- Parameterized Weighted ContainmentGuy Avni, Orna Kupferman. 369-384 [doi]
- Weighted Specifications over Nested WordsBenedikt Bollig, Paul Gastin, Benjamin Monmege. 385-400 [doi]
- An Algebraic Presentation of Predicate Logic - (Extended Abstract)Sam Staton. 401-417 [doi]
- Strategies as ProfunctorsGlynn Winskel. 418-433 [doi]
- Generalised Name Abstraction for Nominal SetsRanald Clouston. 434-449 [doi]