Остановите войну!
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 42 matches
- 2003
- Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso:
Algorithmic Improvements in Regular Model Checking. CAV 2003: 236-248 - Husam Abu-Haimed, Sergey Berezin, David L. Dill:
Strengthening Invariants by Symbolic Consistency Testing. CAV 2003: 407-419 - Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular Strategies for Infinite Games on Recursive Graphs. CAV 2003: 67-79 - Roy Armoni, Limor Fix, Alon Flaisher, Orna Grumberg, Nir Piterman, Andreas Tiemeyer, Moshe Y. Vardi:
Enhanced Vacuity Detection in Linear Temporal Logic. CAV 2003: 368-380 - Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121 - Constantinos Bartzis, Tevfik Bultan:
Efficient Image Computation in Infinite State Model Checking. CAV 2003: 249-261 - Gerd Behrmann, Kim Guldstrand Larsen, Radek Pelánek:
To Store or Not to Store. CAV 2003: 433-445 - Dirk Beyer, Claus Lewerentz, Andreas Noack:
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems. CAV 2003: 122-125 - Bernard Boigelot, Frédéric Herbreteau, Sébastien Jodogne:
Hybrid Acceleration Using Real Vector Automata (Extended Abstract). CAV 2003: 193-205 - Bernard Boigelot, Axel Legay, Pierre Wolper:
Iterating Transducers in the Large (Extended Abstract). CAV 2003: 223-235 - Rafael H. Bordini, Michael Fisher, Carmen Pardavila, Willem Visser, Michael J. Wooldridge:
Model Checking Multi-Agent Programs with CASP. CAV 2003: 110-113 - Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit:
Timed Control with Partial Observability. CAV 2003: 180-192 - Liana Bozga, Yassine Lakhnech, Michaël Périn:
HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols. CAV 2003: 219-222 - Gaurav Chakravorty, Paritosh K. Pandya:
Digitizing Interval Duration Logic. CAV 2003: 167-179 - Marsha Chechik, Arie Gurfinkel:
TLQSolver: A Temporal Logic Query Checker. CAV 2003: 210-214 - Gianfranco Ciardo, Radu Siminiceanu:
Structural Symbolic CTL Model Checking of Asynchronous Systems. CAV 2003: 40-53 - Edmund M. Clarke, Orna Grumberg, Muralidhar Talupur, Dong Wang:
Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates. CAV 2003: 126-140 - Michael Colón, Sriram Sankaranarayanan, Henny Sipma:
Linear Invariant Generation Using Non-linear Constraint Solving. CAV 2003: 420-432 - Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka:
Evidence Explorer: A Tool for Exploring Model-Checking Proofs. CAV 2003: 215-218 - Doron Drusinsky:
Monitoring Temporal Rules Combined with Time Series. CAV 2003: 114-117 - Cindy Eisner, Dana Fisman, John Havlicek, Yoad Lustig, Anthony McIsaac, David Van Campenhout:
Reasoning with Temporal Logic on Truncated Paths. CAV 2003: 27-39 - Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B. Saxe:
Theorem Proving Using Lazy Proof Explication. CAV 2003: 355-367 - Marc Geilen:
An Improved On-The-Fly Tableau Construction for a Real-Time Temporal Logic. CAV 2003: 394-406 - Marcelo Glusman, Shmuel Katz:
Model Checking Conformance with Scenario-Based Specifications. CAV 2003: 328-340 - Orna Grumberg, Tamir Heyman, Assaf Schuster:
A Work-Efficient Distributed Algorithm for Reachability Analysis. CAV 2003: 54-66 - Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Yang, Pranav Ashar:
Abstraction and BDDs Complement SAT-Based BMC in DiVer. CAV 2003: 206-209 - Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Shaz Qadeer:
Thread-Modular Abstraction Refinement. CAV 2003: 262-274 - Hardi Hungar, Oliver Niese, Bernhard Steffen:
Domain-Specific Optimization in Automata Learning. CAV 2003: 315-327 - Yonit Kesten, Nir Piterman, Amir Pnueli:
Bridging the Gap between Fair Simulation and Trace Inclusion. CAV 2003: 381-393 - Shuvendu K. Lahiri, Randal E. Bryant:
Deductive Verification of Advanced Out-of-Order Microprocessors. CAV 2003: 341-353
skipping 12 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-08-31 23:09 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