default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th FoSSaCS 2013: Rome, Italy
- Frank Pfenning:
Foundations of Software Science and Computation Structures - 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Lecture Notes in Computer Science 7794, Springer 2013, ISBN 978-3-642-37074-8
Models of Computation
- Jonathan Hayman, Tobias Heindel:
Pattern Graphs and Rule-Based Models: The Semantics of Kappa. 1-16 - Nikos Tzevelekos, Radu Grigore:
History-Register Automata. 17-33 - Michael Huth, Jim Huan-Pu Kuo, Nir Piterman
:
Fatal Attractors in Parity Games. 34-49
Reasoning about Processes
- Jannik Dreier, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech:
On Unique Decomposition of Processes in the Applied π-Calculus. 50-64 - Rémi Bonnet, Rohit Chadha:
Bounded Context-Switching and Reentrant Locking. 65-80 - Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre:
Reachability of Communicating Timed Processes. 81-96
Bisimulation
- Martin Churchill, Peter D. Mosses:
Modular Bisimulation Theory for Computations and Values. 97-112 - Fernando Orejas, Artur Boronat, Ulrike Golas, Nikos Mylonakis:
Checking Bisimilarity for Attributed Graph Transformation. 113-128 - Faris Abou-Saleh, Dirk Pattinson:
Comodels and Effects in Mathematical Operational Semantics. 129-144 - Shin-ya Katsumata, Tetsuya Sato:
Preorders on Monads and Coalgebraic Simulations. 145-160
Modal and Higher-Order Logics
- Matteo Mio, Alex Simpson:
A Proof System for Compositional Verification of Probabilistic Concurrent Processes. 161-176 - Lukasz Czajka:
Partiality and Recursion in Higher-Order Logic. 177-192 - Fredrik Dahlqvist, Dirk Pattinson:
Some Sahlqvist Completeness Results for Coalgebraic Logics. 193-208 - Lutz Straßburger:
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics. 209-224
Reasoning about Programs
- Andrej Bauer, Martin Hofmann, Aleksandr Karbyshev:
On Monadic Parametricity of Second-Order Functionals. 225-240 - Andrzej S. Murawski, Nikos Tzevelekos:
Deconstructing General References via Game Semantics. 241-256 - Robbert Krebbers, Freek Wiedijk:
Separation Logic for Non-local Control Flow and Block Scope Variables. 257-272
Computational Complexity
- Prateek Karandikar, Sylvain Schmitz:
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. 273-288 - Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens:
Deciding Definability by Deterministic Regular Expressions. 289-304 - Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux:
Type-Based Complexity Analysis for Fork Processes. 305-320 - Martin Hofmann, Ramyaa Ramyaa, Ulrich Schöpp:
Pure Pointer Programs and Tree Isomorphism. 321-336
Quantitative Models
- Pietro Di Gianantonio, Abbas Edalat:
A Language for Differentiable Functions. 337-352 - Michael Ummels, Christel Baier:
Computing Quantiles in Markov Reward Models. 353-368 - Guy Avni, Orna Kupferman:
Parameterized Weighted Containment. 369-384 - Benedikt Bollig, Paul Gastin, Benjamin Monmege:
Weighted Specifications over Nested Words. 385-400
Categorical Models
- Sam Staton:
An Algebraic Presentation of Predicate Logic - (Extended Abstract). 401-417 - Glynn Winskel:
Strategies as Profunctors. 418-433 - Ranald Clouston:
Generalised Name Abstraction for Nominal Sets. 434-449
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 2026-04-22 23: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:
