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 28 matches
- 2001
- Martín Abadi, Bruno Blanchet:
Secrecy Types for Asymmetric Communication. FoSSaCS 2001: 25-41 - Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
Axiomatizing Tropical Semirings. FoSSaCS 2001: 42-56 - Dominique Ambroise, Patrick Augé, Kamel Bouchefra, Brigitte Rozoy:
MARRELLA and the Verification of an Embedded System. FoSSaCS 2001: 409-412 - Gilles Barthe, Olivier Pons:
Type Isomorphisms and Proof Reuse in Dependent Type Theory. FoSSaCS 2001: 57-71 - Michel Bidoit, Rolf Hennicker, Alexander Kurz:
On the Duality between Observability and Reachability. FoSSaCS 2001: 72-87 - Mikolaj Bojanczyk:
The Finite Graph Problem for Two-Way Alternating Automata. FoSSaCS 2001: 88-103 - Maria Grazia Buscemi, Vladimiro Sassone:
High-Level Petri Nets as Type Theories in the Join Calculus. FoSSaCS 2001: 104-120 - Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro:
Temporary Data in Shared Dataspace Coordination Languages. FoSSaCS 2001: 121-136 - Cristiano Calcagno, Peter W. O'Hearn:
On Garbage and Program Logic. FoSSaCS 2001: 137-151 - Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot:
The Complexity of Model Checking Mobile Ambients. FoSSaCS 2001: 152-167 - Horatiu Cirstea, Claude Kirchner, Luigi Liquori:
The Rho Cube. FoSSaCS 2001: 168-183 - Mario Coppo:
Type Inference with Recursive Type Equations. FoSSaCS 2001: 184-198 - Irène Durand, Aart Middeldorp:
On the Modularity of Deciding Call-by-Need. FoSSaCS 2001: 199-213 - Valérie Gouranton, Pierre Réty, Helmut Seidl:
Synchronized Tree Languages Revisited and New Applications. FoSSaCS 2001: 214-229 - Annegret Habel, Detlef Plump:
Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245 - Masahito Hasegawa, Yoshihiko Kakutani:
Axioms for Recursion in Call-by-Value. FoSSaCS 2001: 246-260 - Thomas P. Jensen, Fausto Spoto:
Class Analysis of Object-Oriented Programs through Abstract Interpretation. FoSSaCS 2001: 261-275 - Valerie King, Orna Kupferman, Moshe Y. Vardi:
On the Complexity of Parity Word Automata. FoSSaCS 2001: 276-286 - Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce:
Foundations for a Graph-Based Approach to the Specification of Access Control Policies. FoSSaCS 2001: 287-302 - Sava Krstic, John Launchbury, Dusko Pavlovic:
Categories of Processes Enriched in Final Coalgebras. FoSSaCS 2001: 303-317 - François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Model Checking CTL+ and FCTL is Hard. FoSSaCS 2001: 318-331 - Rémi Morin:
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. FoSSaCS 2001: 332-346 - Tobias Nipkow:
Verified Bytecode Verifiers. FoSSaCS 2001: 347-363 - Gordon D. Plotkin, John Power:
Adequacy for Algebraic Effects. FoSSaCS 2001: 1-24 - Christine Röckl, Daniel Hirschkoff, Stefan Berghofer:
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts. FoSSaCS 2001: 364-378 - Colin Stirling:
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. FoSSaCS 2001: 379-393 - Simone Tini:
An Axiomatic Semantics for the Synchronous Language Gentzen. FoSSaCS 2001: 394-409 - Furio Honsell, Marino Miculan:
Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings. Lecture Notes in Computer Science 2030, Springer 2001, ISBN 3-540-41864-4 [contents]
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 2024-09-26 02:02 CEST 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