Остановите войну!
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
- 2018
- Alessandro Abate, Cristina David, Pascal Kesseli, Daniel Kroening, Elizabeth Polgreen:
Counterexample Guided Inductive Synthesis Modulo Theories. CAV (1) 2018: 270-288 - S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
What's Hard About Boolean Functional Synthesis? CAV (1) 2018: 251-269 - Aws Albarghouthi, Justin Hsu:
Constraint-Based Synthesis of Coupling Proofs. CAV (1) 2018: 327-346 - George Argyros, Loris D'Antoni:
The Learnability of Symbolic Automata. CAV (1) 2018: 427-445 - Suguman Bansal, Kedar S. Namjoshi, Yaniv Sa'ar:
Synthesis of Asynchronous Reactive Programs from Temporal Specifications. CAV (1) 2018: 367-385 - Ezio Bartocci, Roderick Bloem, Dejan Nickovic, Franz Röck:
A Counting Semantics for Monitoring LTL Specifications over Finite Traces. CAV (1) 2018: 547-564 - Anna Becchi, Enea Zaffanella:
A Direct Encoding for NNC Polyhedra. CAV (1) 2018: 230-248 - Michael Blondin, Javier Esparza, Stefan Jaax:
Peregrine: A Tool for the Analysis of Population Protocols. CAV (1) 2018: 604-611 - Frederik M. Bønneland, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marco Muñiz, Jirí Srba:
Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. CAV (1) 2018: 527-546 - Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
ADAC: Automated Design of Approximate Circuits. CAV (1) 2018: 612-620 - Byron Cook:
Formal Reasoning About the Security of Amazon Web Services. CAV (1) 2018: 38-47 - Lucas C. Cordeiro, Pascal Kesseli, Daniel Kroening, Peter Schrammel, Marek Trtík:
JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode. CAV (1) 2018: 183-190 - Tommaso Dreossi, Somesh Jha, Sanjit A. Seshia:
Semantic Adversarial Deep Learning. CAV (1) 2018: 3-26 - Marco Eilers, Peter Müller:
Nagini: A Static Verifier for Python. CAV (1) 2018: 596-603 - Michael Emmi, Constantin Enea:
Monitoring Weak Consistency. CAV (1) 2018: 487-506 - Chuchu Fan, Umang Mathur, Sayan Mitra, Mahesh Viswanathan:
Controller Synthesis Made Real: Reach-Avoid Specifications and Linear Dynamics. CAV (1) 2018: 347-366 - Grigory Fedyukovich, Yueling Zhang, Aarti Gupta:
Syntax-Guided Termination Analysis. CAV (1) 2018: 124-143 - Yijun Feng, Joost-Pieter Katoen, Haokun Li, Bican Xia, Naijun Zhan:
Monitoring CTMCs by Multi-clock Timed Automata. CAV (1) 2018: 507-526 - Bernd Finkbeiner, Christopher Hahn, Philip Lukert, Marvin Stenger, Leander Tentrup:
Synthesizing Reactive Systems from Hyperproperties. CAV (1) 2018: 289-306 - Bernd Finkbeiner, Christopher Hahn, Hazem Torfah:
Model Checking Quantitative Hyperproperties. CAV (1) 2018: 144-163 - Goran Frehse, Mirco Giacobbe, Thomas A. Henzinger:
Space-Time Interpolants. CAV (1) 2018: 468-486 - Daniel J. Fremont, Sanjit A. Seshia:
Reactive Control Improvisation. CAV (1) 2018: 307-326 - Ilya Grishchenko, Matteo Maffei, Clara Schneidewind:
Foundations and Tools for the Static Analysis of Ethereum Smart Contracts. CAV (1) 2018: 51-78 - Qinheping Hu, Loris D'Antoni:
Syntax-Guided Synthesis with Quantitative Syntactic Objectives. CAV (1) 2018: 386-403 - Edon Kelmendi, Julia Krämer, Jan Kretínský, Maximilian Weininger:
Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. CAV (1) 2018: 623-642 - Hui Kong, Ezio Bartocci, Thomas A. Henzinger:
Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes. CAV (1) 2018: 449-467 - Bernhard Kragl, Shaz Qadeer:
Layered Concurrent Programs. CAV (1) 2018: 79-102 - Jan Kretínský, Tobias Meggendorfer, Salomon Sickert, Christopher Ziegler:
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton. CAV (1) 2018: 567-577 - Kenneth L. McMillan:
Eager Abstraction for Symbolic Model Checking. CAV (1) 2018: 191-208 - Philipp J. Meyer, Salomon Sickert, Michael Luttenberger:
Strix: Explicit Reactive Synthesis Strikes Back! CAV (1) 2018: 578-586
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-04-25 07:33 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