default search action
18th FoSSaCS 2015: London, UK (Part of ETAPS 2015)
- Andrew M. Pitts
:
Foundations of Software Science and Computation Structures - 18th International Conference, FoSSaCS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. Lecture Notes in Computer Science 9034, Springer 2015, ISBN 978-3-662-46677-3
Invited Talk
- Frank Pfenning, Dennis Griffith:
Polarized Substructural Session Types. 3-22
Semantics of Programming Languages I
- Konstantinos Mamouras:
Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism. 25-40 - Charles Grellois, Paul-André Melliès:
An Infinitary Model of Linear Logic. 41-55 - Pierre Clairambault, Peter Dybjer:
Game Semantics and Normalization by Evaluation. 56-70 - Martín Abadi, Frank McSherry, Gordon D. Plotkin:
Foundations of Differential Dataflow. 71-83
Categorical Models and Logics
- Bart Jacobs, Bas Westerbaan
States of Convex Sets. 87-101 - Matthijs Vákár:
A Categorical Semantics for Linear Logical Frameworks. 102-116 - Joost Winter:
A Completeness Result for Finite λ-bisimulations. 117-132 - Ranald Clouston, Rajeev Goré:
Sequent Calculus in the Topos of Trees. 133-147
Modal and Temporal Logics
- Bartek Klin
Coalgebraic Trace Semantics via Forgetful Logics. 151-166 - Laura Bozzelli, Bastien Maubert
Unifying Hyper and Epistemic Temporal Logics. 167-182
Concurrent, Probabilistic and Timed Systems
- Giorgio Bacci
On the Total Variation Distance of Semi-Markov Chains. 185-199 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Yue Ben:
Decidable and Expressive Classes of Probabilistic Automata. 200-214 - Blaise Genest, Doron A. Peled, Sven Schewe
Knowledge = Observation + Memory + Computation. 215-229 - Daniel Gebler, Kim Guldstrand Larsen
Compositional Metric Reasoning with Probabilistic Process Calculi. 230-245
Semantics of Programming Languages II
- Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong
Fragments of ML Decidable by Nested Data Class Memory Automata. 249-263 - Guilhem Jaber:
Operational Nominal Game Semantics. 264-278 - Ales Bizjak, Lars Birkedal:
Step-Indexed Logical Relations for Probability. 279-294
Automata, Games, Verification
- Stefan Kiefer, Ines Marusic, James Worrell
Minimisation of Multiplicity Tree Automata. 297-311 - Yaron Velner:
Robust Multidimensional Mean-Payoff Games are Undecidable. 312-327 - Hsi-Ming Ho
The Cyclic-Routing UAV Problem is PSPACE-Complete. 328-342 - Sylvain Salvati, Igor Walukiewicz:
Typing Weak MSOL Properties. 343-357
Logical Aspects of Computational Complexity
- Timos Antonopoulos, Paul Hunter
Three Variables Suffice for Real-Time Logic. 361-374 - Peter Habermehl, Dietrich Kuske:
On Presburger Arithmetic Extended with Modulo Counting Quantifiers. 375-389 - Moses Ganardi:
Parity Games of Bounded Tree- and Clique-Width. 390-404
Type Theory, Proof Theory and Implicit Computational Complexity
- Ranald Clouston, Ales Bizjak, Hans Bugge Grathwohl, Lars Birkedal:
Programming and Reasoning with Guarded Recursion for Coinductive Types. 407-421 - Daniel Leivant, Ramyaa Ramyaa:
The Computational Contents of Ramified Corecurrence. 422-435 - Marc Bagnol, Amina Doumane, Alexis Saurin:
On the Dependencies of Logical Rules. 436-450 - Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
On the Mints Hierarchy in First-Order Intuitionistic Logic. 451-465
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 2024-11-15 19:44 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: