Остановите войну!
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 45 matches
- 1992
- Kim Guldstrand Larsen, Arne Skou:
Computer Aided Verification, 3rd International Workshop, CAV '91, Aalborg, Denmark, July, 1-4, 1991, Proceedings. Lecture Notes in Computer Science 575, Springer 1992, ISBN 3-540-55179-4 [contents] - 1991
- Henrik Reif Andersen, Glynn Winskel:
Compositional Checking of Satisfaction. CAV 1991: 24-36 - George S. Avrunin, Ugo A. Buy, James C. Corbett:
Integer Programming in the Analysis of Concurrent Systems. CAV 1991: 92-102 - Michel Barbeau, Gregor von Bochmann:
The Lotos Model of a Fault Protected System and its Verification Using a Petri Net Based Approach. CAV 1991: 103-113 - William R. Bevier, Jørgen F. Søgaard-Andersen:
Mechanically Checked Proofs of Kernel Specification. CAV 1991: 70-82 - Ed Brinksma:
From Data Structure to Process Structure. CAV 1991: 244-254 - Linda Christoff, Ivan Christoff:
Efficient Algorithms for Verification of Equivalences for Probabilistic Processes. CAV 1991: 310-321 - Rance Cleaveland, Bernhard Steffen:
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. CAV 1991: 48-58 - Costas Courcoubetis:
Minimum and Maximum Delay Problems in Real-Time Systems. CAV 1991: 399-409 - Costas Courcoubetis, Susanne Graf, Joseph Sifakis:
An Algebra of Boolean Processes. CAV 1991: 454-465 - David L. Dill, Alan J. Hu, Howard Wong-Toi:
Checking for Language Inclusion Using Simulation Preorders. CAV 1991: 255-265 - Reinhard Enders, Thomas Filkorn, Dirk Taubner:
Generating BDDs for Symbolic Model Checking in CCS. CAV 1991: 203-213 - Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund:
Complexity Results for POMSET Languages. CAV 1991: 343-353 - Jean-Claude Fernandez, Laurent Mounier:
"On the Fly" Verification of Behavioural Equivalences and Preorders. CAV 1991: 181-191 - Thomas Filkorn:
Functional Extension of Symbolic Model Checking. CAV 1991: 225-232 - Alain Finkel, Laure Petrucci:
Avoiding State Exposion by Composition of Minimal Covering Graphs. CAV 1991: 169-180 - Nicoletta De Francesco, Paola Inverardi:
A Semantic Driven Method to Check the Finiteness of CCS Processes. CAV 1991: 266-276 - Armen Gabrielian, R. Iyer:
Verifying Properties of HMS Machine Specifications of Real-Time Systems. CAV 1991: 421-431 - Stein Gjessing, Stein Krogdahl, Ellen Munthe-Kaas:
A Top Down Approach to the Formal Specification of SCI Cache Coherence. CAV 1991: 83-91 - Patrice Godefroid, Pierre Wolper:
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. CAV 1991: 332-342 - David M. Goldschlag:
Mechanically Verifying Safety and Liveness Properties of Delay Insensitive Circuits. CAV 1991: 354-364 - Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima:
Formal Verification of Speed-Dependent Asynchronous Cicuits Using Symbolic Model Checking of branching Time Regular Temporal Logic. CAV 1991: 410-420 - Hiromi Hiraishi, Kiyoharu Hamaguchi, Hiroyuki Ochi, Shuzo Yajima:
Vectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification. CAV 1991: 214-224 - Uno Holmer, Kim Guldstrand Larsen, Wang Yi:
Deciding Properties of Regular Real Time Processes. CAV 1991: 443-453 - Hans Hüttel:
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes. CAV 1991: 2-12 - Claude Jard, Thierry Jéron:
Bounded-memory Algorithms for Verification On-the-fly. CAV 1991: 192-202 - Alan Jeffrey:
A Linear Time Process Algebra. CAV 1991: 432-442 - Claus Torp Jensen:
The Concurrency Workbench with Priorities. CAV 1991: 147-157 - Gjalt G. de Jong:
An Automata Theoretic Approach to Temporal Logic. CAV 1991: 477-487 - Henri Korver:
Computing Distinguishing Formulas for Branching Bisimulation. CAV 1991: 13-23
skipping 15 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-13 06:57 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