Остановите войну!
for scientists:
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 40 matches
- 2009
- Hugo Gimbert, Florian Horn:
Solving Simple Stochastic Games with Few Random Vertices. 5(2) (2009) - Jesper Bengtson, Joachim Parrow:
Formalising the pi-calculus using nominal logic. Log. Methods Comput. Sci. 5(2) (2009) - Alexander Rabinovich:
The Church Problem for Countable Ordinals. Log. Methods Comput. Sci. 5(2) (2009) - Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Log. Methods Comput. Sci. 5(1) (2009) - Jirí Srba:
Beyond Language Equivalence on Visibly Pushdown Automata. Log. Methods Comput. Sci. 5(1) (2009) - William Blum, C.-H. Luke Ong:
The Safe Lambda Calculus. Log. Methods Comput. Sci. 5(1) (2009) - Koen Claessen, Jan-Willem Roorda:
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation. Log. Methods Comput. Sci. 5(2) (2009) - Helle Hvid Hansen, Clemens Kupke, Eric Pacuit:
Neighbourhood Structures: Bisimilarity and Basic Model Theory. Log. Methods Comput. Sci. 5(2) (2009) - Christoph Benzmüller, Chad E. Brown, Michael Kohlhase:
Cut-Simulation and Impredicativity. Log. Methods Comput. Sci. 5(1) (2009) - Martin Grohe, Götz Schwandtner:
The Complexity of Datalog on Linear Orders. Log. Methods Comput. Sci. 5(1) (2009) - Olha Shkaravska, Marko C. J. D. van Eekelen, Ron van Kesteren:
Polynomial Size Analysis of First-Order Shapely Functions. Log. Methods Comput. Sci. 5(2) (2009) - Laurent Doyen, Jean-François Raskin:
Antichains for the Automata-Based Approach to Model-Checking. Log. Methods Comput. Sci. 5(1) (2009) - Mohammad Raza, Philippa Gardner:
Footprints in Local Reasoning. Log. Methods Comput. Sci. 5(2) (2009) - Benedetto Intrigila, Richard Statman:
The Omega Rule is Π11-Complete in the λβ-Calculus. Log. Methods Comput. Sci. 5(2) (2009) - José Espírito Santo, Ralph Matthes, Luís Pinto:
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi. Log. Methods Comput. Sci. 5(2) (2009) - Jean-Yves Marion:
On tiered small jump operators. Log. Methods Comput. Sci. 5(1) (2009) - Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Axel Legay:
Qualitative Logics and Equivalences for Probabilistic Systems. Log. Methods Comput. Sci. 5(2) (2009) - Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Yan Jurski, Mihaela Sighireanu:
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes. Log. Methods Comput. Sci. 5(2) (2009) - Amir M. Ben-Amram, Chin Soon Lee:
Ranking Functions for Size-Change Termination II. Log. Methods Comput. Sci. 5(2) (2009) - Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi:
Explicit fairness in testing semantics. Log. Methods Comput. Sci. 5(2) (2009) - Florent R. Madelaine:
Universal Structures and the logic of Forbidden Patterns. Log. Methods Comput. Sci. 5(2) (2009) - Mikolaj Bojanczyk:
Two-Way Unary Temporal Logic over Trees. Log. Methods Comput. Sci. 5(3) (2009) - Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh:
Simulating reachability using first-order logic with applications to verification of linked data structures. Log. Methods Comput. Sci. 5(2) (2009) - Delia Kesner:
A Theory of Explicit Substitutions with Safe and Full Composition. Log. Methods Comput. Sci. 5(3) (2009) - Johan van Benthem, Balder ten Cate, Jouko A. Väänänen:
Lindström theorems for fragments of first-order logic. Log. Methods Comput. Sci. 5(3) (2009) - Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Representations of Stream Processors Using Nested Fixed Points. Log. Methods Comput. Sci. 5(3) (2009) - Damiano Mazza:
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators. Log. Methods Comput. Sci. 5(4) (2009) - Catalin Hritcu, Jan Schwinghammer:
A Step-indexed Semantics of Imperative Objects. Log. Methods Comput. Sci. 5(4) (2009) - Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
RPO, Second-order Contexts, and Lambda-calculus. Log. Methods Comput. Sci. 5(3) (2009) - Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Computational Effects. Log. Methods Comput. Sci. 5(3) (2009)
skipping 10 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 2024-05-23 07:42 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