default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st FoSSaCS 2018: Thessaloniki, Greece (Part of ETAPS 2018)
- Christel Baier
, Ugo Dal Lago:
Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings. Lecture Notes in Computer Science 10803, Springer 2018, ISBN 978-3-319-89365-5
Semantics
- Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel:
Non-angelic Concurrent Game Semantics. 3-19 - Guilhem Jaber, Nikos Tzevelekos:
A Trace Semantics for System F Parametric Polymorphism. 20-38 - Clément Jacq, Paul-André Melliès:
Categorical Combinatorics for Non Deterministic Strategies on Simple Games. 39-70 - Marco Devesas Campos, Paul Blain Levy:
A Syntactic View of Computational Adequacy. 71-87
Linearity
- Ornela Dardha, Simon J. Gay:
A New Linear Logic for Deadlock-Free Session-Typed Processes. 91-109 - Shin-ya Katsumata:
A Double Category Theoretic Analysis of Graded Linear Exponential Comonads. 110-127 - Bernardo Toninho, Nobuko Yoshida:
Depending on Session-Typed Processes. 128-145 - Gabriel Scherer, Max S. New, Nick Rioux, Amal Ahmed:
Fab ous Interoperability for ML and a Linear Language. 146-162
Concurrency
- Paolo Baldan, Tommaso Padoan:
Automata for True Concurrency Properties. 165-182 - Rob van Glabbeek:
A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract). 183-202 - Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir:
A Framework for Parameterized Monitorability. 203-220 - Xinxin Liu, Tingting Yu, Wenhui Zhang:
Logics for Bisimulation and Divergence. 221-237
Lambda-Calculi and Types
- Delia Kesner, Alejandro Ríos, Andrés Viso:
Call-by-Need, Neededness and All That. 241-257 - Ranald Clouston:
Fitch-Style Modal Lambda Calculi. 258-275 - Étienne Miquey, Hugo Herbelin:
Realizability Interpretation and Normalization of Typed Call-by-Need \lambda -calculus with Control. 276-292 - Thorsten Altenkirch, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus, Fredrik Nordvall Forsberg:
Quotient Inductive-Inductive Types. 293-310
Category Theory and Quantum Control
- Sergey Goncharov, Lutz Schröder:
Guarded Traced Categories. 313-330 - Ana Sokolova, Harald Woracek:
Proper Semirings and Proper Convex Functors. 331-347 - Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto:
From Symmetric Pattern-Matching to Quantum Control. 348-364
Quantitative Models
- Stéphane Le Roux, Guillermo A. Pérez:
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. 367-383 - Pedro R. D'Argenio, Marcus Gerhold, Arnd Hartmanns, Sean Sedwards:
A Hierarchy of Scheduler Classes for Stochastic Automata. 384-402 - Hugo Bazille, Eric Fabre, Blaise Genest:
Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings. 403-419 - Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi:
Comparator Automata in Quantitative Verification. 420-437
Logics and Equational Theories
- Simon Docherty, David J. Pym:
Modular Tableaux Calculi for Separation Theories. 441-458 - Abbas Edalat, Mehrdad Maleki:
Differential Calculus with Imprecise Input and Its Logical Framework. 459-475 - Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Propositional Separation Logic. 476-493 - Luigi Santocanale:
The Equational Theory of the Natural Join and Inner Union is Decidable. 494-510
Graphs and Automata
- Guillaume Rabusseau:
Minimization of Graph Weighted Models over Circular Strings. 513-529 - Patricia Bouyer:
Games on Graphs with a Public Signal Monitoring. 530-547 - Slawomir Lasota, Radoslaw Piórkowski:
WQO Dichotomy for 3-Graphs. 548-564 - Thomas Genet, Timothée Haudebourg, Thomas P. Jensen:
Verifying Higher-Order Functions with Tree Automata. 565-582
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-03-18 20:32 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:
