default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2011
- Andreas Abel:
Irrelevance in Type Theory with a Heterogeneous Equality Judgement. FoSSaCS 2011: 57-71 - Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Fernando Pino, Frank D. Valencia:
Deriving Labels and Bisimilarity for Concurrent Constraint Programming. FoSSaCS 2011: 138-152 - Robert Atkey, Patricia Johann, Neil Ghani:
When Is a Type Refinement an Inductive Type? FoSSaCS 2011: 72-87 - Holger Bock Axelsen, Robert Glück:
What Do Reversible Programs Compute? FoSSaCS 2011: 42-56 - Alexis Bernadet, Stéphane Lengrand:
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types. FoSSaCS 2011: 88-107 - Jean-Philippe Bernardy, Marc Lasson:
Realizability and Parametricity in Pure Type Systems. FoSSaCS 2011: 108-122 - Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen:
A Game Approach to Determinize Timed Automata. FoSSaCS 2011: 245-259 - Udi Boker, Orna Kupferman:
Co-Büching Them All. FoSSaCS 2011: 184-198 - Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo:
Ordinal Theory for Expressiveness of Well Structured Transition Systems. FoSSaCS 2011: 153-167 - Michele Boreale, Francesca Pampaloni, Michela Paolini:
Asymptotic Information Leakage under One-Try Attacks. FoSSaCS 2011: 396-410 - Didier Caucal, Dinh Trong Hieu:
Regularity and Context-Freeness over Word Rewriting Systems. FoSSaCS 2011: 214-228 - Pierre Clairambault:
Estimation of the Length of Interactions in Arena Game Semantics. FoSSaCS 2011: 335-349 - Patrick Cousot, Radhia Cousot, Laurent Mauborgne:
The Reduced Product of Abstract Domains and the Combination of Decision Procedures. FoSSaCS 2011: 456-472 - Christian Dax, Felix Klaedtke:
Alternation Elimination for Automata over Nested Words. FoSSaCS 2011: 168-183 - Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro:
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. FoSSaCS 2011: 441-455 - Murdoch James Gabbay, Vincenzo Ciancia:
Freshness and Name-Restriction in Sets of Traces with Names. FoSSaCS 2011: 365-380 - Dan R. Ghica, Mohamed Nabih Menaa:
Synchronous Game Semantics via Round Abstraction. FoSSaCS 2011: 350-364 - Shulamit Halamish, Orna Kupferman:
Minimizing Deterministic Lattice Automata. FoSSaCS 2011: 199-213 - Makoto Hamana:
Polymorphic Abstract Syntax via Grothendieck Construction. FoSSaCS 2011: 381-395 - Naohiko Hoshino:
A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy. FoSSaCS 2011: 320-334 - Bart Jacobs:
Coalgebraic Walks, in Quantum and Turing Computation. FoSSaCS 2011: 12-26 - Rémi Jaubert, Pierre-Alain Reynier:
Quantitative Robustness Analysis of Flat Timed Automata. FoSSaCS 2011: 229-244 - Naoki Kobayashi:
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes. FoSSaCS 2011: 260-274 - Paul Blain Levy:
Similarity Quotients as Final Coalgebras. FoSSaCS 2011: 27-41 - Matteo Mio:
Probabilistic Modal μ-Calculus with Independent Product. FoSSaCS 2011: 290-304 - Anders Møller, Mathias Schwarz:
HTML Validation of Context-Free Languages. FoSSaCS 2011: 426-440 - Prakash Panangaden:
The Search for Structure in Quantum Computation. FoSSaCS 2011: 1-11 - Adrien Piérard, Eijiro Sumii:
Sound Bisimulations for Higher-Order Distributed Process Calculus. FoSSaCS 2011: 123-137 - Jan Schwinghammer, Lars Birkedal, Kristian Støvring:
A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces. FoSSaCS 2011: 305-319 - Christian Stahl, Walter Vogler:
A Trace-Based View on Operating Guidelines. FoSSaCS 2011: 411-425
skipping 2 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-01-03 05:41 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint