Остановите войну!
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 73 matches
- 2013
- Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
Learning Universally Quantified Invariants of Linear Data Structures. CAV 2013: 813-829 - Oshri Adler, Cindy Eisner, Tatyana Veksler:
Relative Equivalence in the Presence of Ambiguity. CAV 2013: 430-446 - Aws Albarghouthi, Sumit Gulwani, Zachary Kincaid:
Recursive Program Synthesis. CAV 2013: 934-950 - Aws Albarghouthi, Kenneth L. McMillan:
Beautiful Interpolants. CAV 2013: 313-329 - Jade Alglave, Daniel Kroening, Michael Tautschnig:
Partial Orders for Efficient Bounded Model Checking of Concurrent Software. CAV 2013: 141-157 - Shaull Almagor, Guy Avni, Orna Kupferman:
Automatic Generation of Quality Specifications. CAV 2013: 479-494 - Étienne André, Yang Liu, Jun Sun, Jin Song Dong, Shang-Wei Lin:
PSyHCoS: Parameter Synthesis for Hierarchical Concurrent Real-Time Systems. CAV 2013: 984-989 - Roy Armoni, Dana Fisman, Naiyong Jin:
SVA and PSL Local Variables - A Practical Approach. CAV 2013: 197-212 - Jiri Barnat, Lubos Brim, Vojtech Havel, Jan Havlícek, Jan Kriho, Milan Lenco, Petr Rockai, Vladimír Still, Jirí Weiser:
DiVinE 3.0 - An Explicit-State Model Checker for Multithreaded C & C++ Programs. CAV 2013: 863-868 - Tewodros A. Beyene, Corneliu Popeea, Andrey Rybalchenko:
Solving Existentially Quantified Horn Clauses. CAV 2013: 869-882 - Brad D. Bingham, Jesse D. Bingham, John Erickson, Mark R. Greenstreet:
Distributed Explicit State Model Checking of Deadlock Freedom. CAV 2013: 235-241 - Fabrizio Biondi, Axel Legay, Louis-Marie Traonouez, Andrzej Wasowski:
QUAIL: A Quantitative Security Analyzer for Imperative Code. CAV 2013: 702-707 - Thomas Braibant, Adam Chlipala:
Formal Verification of Hardware Synthesis. CAV 2013: 213-228 - Romain Brenguier:
PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games. CAV 2013: 890-895 - Lubos Brim, Milan Ceska, Sven Drazan, David Safránek:
Exploring Parameter Space of Stochastic Biochemical Systems Using Quantitative Model Checking. CAV 2013: 107-123 - Marc Brockschmidt, Byron Cook, Carsten Fuhs:
Better Termination Proving through Cooperation. CAV 2013: 413-429 - Pavol Cerný, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach:
Efficient Synthesis for Concurrency by Semantics-Preserving Transformations. CAV 2013: 951-967 - Arun Tejasvi Chaganty, Akash Lal, Aditya V. Nori, Sriram K. Rajamani:
Combining Relational Learning with SMT Solvers Using CEGAR. CAV 2013: 447-462 - Aleksandar Chakarov, Sriram Sankaranarayanan:
Probabilistic Program Analysis with Martingales. CAV 2013: 511-526 - Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
A Scalable and Nearly Uniform Generator of SAT Witnesses. CAV 2013: 608-623 - Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský:
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. CAV 2013: 559-575 - Krishnendu Chatterjee, Jakub Lacki:
Faster Algorithms for Markov Decision Processes with Low Treewidth. CAV 2013: 543-558 - Xin Chen, Erika Ábrahám, Sriram Sankaranarayanan:
Flow*: An Analyzer for Non-linear Hybrid Systems. CAV 2013: 258-263 - Chih-Hong Cheng, Harald Ruess, Natarajan Shankar:
JBernstein: A Validity Checker for Generalized Polynomial Constraints. CAV 2013: 656-661 - Vincent Cheval, Véronique Cortier, Antoine Plet:
Lengths May Break Privacy - Or How to Check for Equivalences with Length. CAV 2013: 708-723 - Tom Chothia, Yusuke Kawamoto, Chris Novakovic:
A Tool for Estimating Information Leakage. CAV 2013: 690-695 - Koen Claessen, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Qinsi Wang:
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets. CAV 2013: 85-100 - Maximilien Colange, Souheib Baarir, Fabrice Kordon, Yann Thierry-Mieg:
Towards Distributed Software Model-Checking Using Decision Diagrams. CAV 2013: 830-845 - Loris D'Antoni, Margus Veanes:
Equivalence of Extended Symbolic Finite Transducers. CAV 2013: 624-639 - Liyun Dai, Bican Xia, Naijun Zhan:
Generating Non-linear Interpolants by Semidefinite Programming. CAV 2013: 364-380
skipping 43 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-24 10:03 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