default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th FoSSaCS 2011: Saarbrücken, Germany (Part of ETAPS 2011)
- Martin Hofmann:
Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings. Lecture Notes in Computer Science 6604, Springer 2011, ISBN 978-3-642-19804-5 - Prakash Panangaden:
The Search for Structure in Quantum Computation. 1-11
Coalgebra and Computability
- Bart Jacobs:
Coalgebraic Walks, in Quantum and Turing Computation. 12-26 - Paul Blain Levy:
Similarity Quotients as Final Coalgebras. 27-41 - Holger Bock Axelsen, Robert Glück
:
What Do Reversible Programs Compute? 42-56
Type Theory
- Andreas Abel:
Irrelevance in Type Theory with a Heterogeneous Equality Judgement. 57-71 - Robert Atkey, Patricia Johann, Neil Ghani:
When Is a Type Refinement an Inductive Type? 72-87 - Alexis Bernadet, Stéphane Lengrand:
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types. 88-107 - Jean-Philippe Bernardy, Marc Lasson:
Realizability and Parametricity in Pure Type Systems. 108-122
Process Calculi
- Adrien Piérard, Eijiro Sumii:
Sound Bisimulations for Higher-Order Distributed Process Calculus. 123-137 - Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Fernando Pino, Frank D. Valencia:
Deriving Labels and Bisimilarity for Concurrent Constraint Programming. 138-152 - Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo:
Ordinal Theory for Expressiveness of Well Structured Transition Systems. 153-167
Automata Theory
- Christian Dax, Felix Klaedtke:
Alternation Elimination for Automata over Nested Words. 168-183 - Udi Boker, Orna Kupferman:
Co-Büching Them All. 184-198 - Shulamit Halamish, Orna Kupferman:
Minimizing Deterministic Lattice Automata. 199-213 - Didier Caucal, Dinh Trong Hieu:
Regularity and Context-Freeness over Word Rewriting Systems. 214-228 - Rémi Jaubert, Pierre-Alain Reynier:
Quantitative Robustness Analysis of Flat Timed Automata. 229-244 - Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen:
A Game Approach to Determinize Timed Automata. 245-259 - Naoki Kobayashi:
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes. 260-274 - Yaron Velner, Alexander Rabinovich:
Church Synthesis Problem for Noisy Input. 275-289 - Matteo Mio:
Probabilistic Modal μ-Calculus with Independent Product. 290-304
Semantics
- Jan Schwinghammer, Lars Birkedal, Kristian Støvring:
A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces. 305-319 - Naohiko Hoshino:
A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy. 320-334 - Pierre Clairambault:
Estimation of the Length of Interactions in Arena Game Semantics. 335-349 - Dan R. Ghica, Mohamed Nabih Menaa:
Synchronous Game Semantics via Round Abstraction. 350-364
Binding
- Murdoch James Gabbay, Vincenzo Ciancia:
Freshness and Name-Restriction in Sets of Traces with Names. 365-380 - Makoto Hamana:
Polymorphic Abstract Syntax via Grothendieck Construction. 381-395
Security
- Michele Boreale, Francesca Pampaloni, Michela Paolini:
Asymptotic Information Leakage under One-Try Attacks. 396-410 - Christian Stahl, Walter Vogler:
A Trace-Based View on Operating Guidelines. 411-425
Program Analysis
- Anders Møller, Mathias Schwarz:
HTML Validation of Context-Free Languages. 426-440 - Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro:
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. 441-455 - Patrick Cousot, Radhia Cousot, Laurent Mauborgne:
The Reduced Product of Abstract Domains and the Combination of Decision Procedures. 456-472
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-11-11 23:03 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:
