default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th FoSSaCS@ETAPS 2025: Hamilton, ON, Canada
- Parosh Aziz Abdulla
, Delia Kesner:
Foundations of Software Science and Computation Structures - 28th International Conference, FoSSaCS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3-8, 2025, Proceedings. Lecture Notes in Computer Science 15691, Springer 2025, ISBN 978-3-031-90896-5 - Matt Earnshaw, Mario Román:
Context-Free Languages of String Diagrams. 1-23 - Linan Chen, Florence Clerc, Prakash Panangaden:
A Behavioural Pseudometric for Continuous-Time Markov Processes. 24-44 - Daniel Gratzer, Mathias Adam Møller, Lars Birkedal:
Idempotent Resources in Separation Logic - The Heart of core in Iris. 45-66 - Marco Bernardo, Andrea Esposito, Claudio Antares Mezzina:
Alternative Characterizations of Hereditary History-Preserving Bisimilarity via Backward Ready Multisets. 67-87 - Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Complementation of Emerson-Lei Automata. 88-110 - Pedro Nora, Jurriaan Rot, Lutz Schröder, Paul Wild:
Relational Connectors and Heterogeneous Simulations. 111-132 - Esaïe Bauer, Alexis Saurin:
On the cut-elimination of the modal μ-calculus: Linear Logic to the rescue. 133-154 - Kinnari Dave, Louis Lemonnier, Romain Péchoux, Vladimir Zamdzhiev:
Combining quantum and classical control: syntax, semantics and adequacy. 155-175 - Kevin Batz, Joost-Pieter Katoen, Nora Orhan:
Quantifier Elimination and Craig Interpolation: The Quantitative Way. 176-197 - Bálint Kocsis, Jurriaan Rot:
Complete Test Suites for Automata in Monoidal Closed Categories. 198-219 - Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty, César Sánchez:
Temporal Hyperproperties for Population Protocols. 220-242 - Leandro Gomes, Patrick Baillot, Marco Gaboardi:
BiGKAT: An Algebraic Framework for Relational Verification of Probabilistic Programs. 243-264 - Tobias Kappé, Todd Schmid:
A General Completeness Theorem for Skip-Free Star Algebras. 265-286 - Pablo Barenbaum, Eduardo Bonelli:
Sharing and Linear Logic with Restricted Access. 287-307 - Filippo Bonchi, Alessandro Di Giorgio, Elena Di Lavore:
A Diagrammatic Algebra for Program Logics. 308-330 - Ashwani Anand, Satya Prakash Nayak, Ritam Raha, Irmak Saglam, Anne-Kathrin Schmuck:
Fair Quantitative Games. 331-354 - Petr Jancar, Jérôme Leroux, Jiri Valusek:
Structural Liveness of Conservative Petri Nets. 355-376 - Yotam Dvir, Ohad Kammar, Ori Lahav, Gordon D. Plotkin:
Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics. 377-398 - Patricia Bouyer, B. Srivathsan, Vaishnavi Vishwanath:
Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route. 399-421
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-05-27 21:42 CEST 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:
