Остановите войну!
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 39 matches
- 2001
- Parosh Aziz Abdulla, Bengt Jonsson:
Channel Representations in Protocol Verification. CONCUR 2001: 1-15 - Alessandro Aldini:
Probabilistic Information Flow in a Process Algebra. CONCUR 2001: 152-168 - Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala:
Compositional Methods for Probabilistic Systems. CONCUR 2001: 351-365 - Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar:
Symbolic Algorithms for Infinite-State Games. CONCUR 2001: 536-550 - Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang:
The Control of Synchronous Systems, Part II. CONCUR 2001: 566-582 - Paul C. Attie, Nancy A. Lynch:
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. CONCUR 2001: 137-151 - Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel:
Compositional Modeling of Reactive Systems Using Open Nets. CONCUR 2001: 502-518 - Paolo Baldan, Andrea Corradini, Barbara König:
A Static Analysis Technique for Graph Transformation Systems. CONCUR 2001: 381-395 - Patricia Bouyer, Antoine Petit, Denis Thérien:
An Algebraic Characterization of Data and Timed Languages. CONCUR 2001: 248-261 - Franck van Breugel, James Worrell:
An Algorithm for Quantitative Verification of Probabilistic Transition Systems. CONCUR 2001: 336-350 - Michele Bugliesi, Giuseppe Castagna, Silvia Crafa:
Reasoning about Security in Mobile Ambients. CONCUR 2001: 102-120 - Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli:
Typing Mobility in the Seal Calculus. CONCUR 2001: 82-101 - Marsha Chechik, Benet Devereux, Steve M. Easterbrook, Albert Y. C. Lai, Victor Petrovykh:
Efficient Multiple-Valued Model-Checking Using Lattice Representations. CONCUR 2001: 441-455 - Yifeng Chen, Jeff W. Sanders:
Logic of Global Synchrony. CONCUR 2001: 487-501 - Marie Duflot, Laurent Fribourg, Ulf Nilsson:
Unavoidable Configurations of Parameterized Rings of Processes. CONCUR 2001: 472-486 - Jaco Geldenhuys, Antti Valmari:
Techniques for Smaller Intermediary BDDs. CONCUR 2001: 233-247 - Marcelo Glusman, Shmuel Katz:
Extending Memory Consistency of Finite Prefixes to Infinite Computations. CONCUR 2001: 411-425 - Patrice Godefroid, Michael Huth, Radha Jagadeesan:
Abstraction-Based Model Checking Using Modal Transition Systems. CONCUR 2001: 426-440 - John Hatcliff, Matthew B. Dwyer:
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software. CONCUR 2001: 39-58 - Keijo Heljanko:
Bounded Reachability Checking with Process Semantics. CONCUR 2001: 218-232 - Holger Hermanns, Joost-Pieter Katoen:
Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains. CONCUR 2001: 59-81 - Dan Hirsch, Ugo Montanari:
Synchronized Hyperedge Replacement with Name Mobility. CONCUR 2001: 121-136 - Victor Khomenko, Maciej Koutny:
Towards an Efficient Algorithm for Unfolding Petri Nets. CONCUR 2001: 366-380 - Steve Kremer, Jean-François Raskin:
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. CONCUR 2001: 551-565 - Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Extended Temporal Logic Revisited. CONCUR 2001: 519-535 - Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston:
Symbolic Computation of Maximal Probabilistic Reachability. CONCUR 2001: 169-183 - Natalia López, Manuel Núñez:
A Testing Theory for Generally Distributed Stochastic Processes. CONCUR 2001: 321-335 - Gerald Lüttgen, Walter Vogler:
A Faster-than Relation for Asynchronous Processes. CONCUR 2001: 262-276 - Robin Milner:
Bigraphical Reactive Systems. CONCUR 2001: 16-35 - Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez:
Local First Search - A New Paradigm for Partial Order Reductions. CONCUR 2001: 396-410
skipping 9 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-06-13 06:41 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