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 33 matches
- 2017
- Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, Yaron Velner:
Quantitative Assume Guarantee Synthesis. CAV (2) 2017: 353-374 - Matthew Amy, Martin Roetteler, Krysta M. Svore:
Verified Compilation of Space-Efficient Reversible Circuits. CAV (2) 2017: 3-21 - Paul Beame, Vincent Liew:
Towards Verifying Nonlinear Integer Arithmetic. CAV (2) 2017: 238-258 - Amir M. Ben-Amram, Samir Genaim:
On Multiphase-Linear Ranking Functions. CAV (2) 2017: 601-620 - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Suha Orhun Mutluergil:
Proving Linearizability Using Forward Simulations. CAV (2) 2017: 542-563 - Quentin Carbonneaux, Jan Hoffmann, Thomas W. Reps, Zhong Shao:
Automated Resource Analysis with Coq Proof Objects. CAV (2) 2017: 64-85 - Luca Cardelli, Milan Ceska, Martin Fränzle, Marta Z. Kwiatkowska, Luca Laurenti, Nicola Paoletti, Max Whitby:
Syntax-Guided Optimal Synthesis for Chemical Reaction Networks. CAV (2) 2017: 375-395 - Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. CAV (2) 2017: 41-63 - Sylvain Conchon, Mohamed Iguernelala, Kailiang Ji, Guillaume Melquiond, Clément Fumex:
A Three-Tier Strategy for Reasoning About Floating-Point Numbers in SMT. CAV (2) 2017: 419-435 - Andrei Marian Dan, Manu Sridharan, Satish Chandra, Jean-Baptiste Jeannin, Martin T. Vechev:
Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts. CAV (2) 2017: 521-541 - Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen, Matthias Volk:
A Storm is Coming: A Modern Probabilistic Model Checker. CAV (2) 2017: 592-600 - Burak Ekici, Alain Mebsout, Cesare Tinelli, Chantal Keller, Guy Katz, Andrew Reynolds, Clark W. Barrett:
SMTCoq: A Plug-In for Integrating SMT Solvers into Coq. CAV (2) 2017: 126-133 - Ahmed El-Hassany, Petar Tsankov, Laurent Vanbever, Martin T. Vechev:
Network-Wide Configuration Synthesis. CAV (2) 2017: 261-281 - Peter Faymonville, Bernd Finkbeiner, Leander Tentrup:
BoSy: An Experimentation Framework for Bounded Synthesis. CAV (2) 2017: 325-332 - John Fearnley:
Efficient Parallel Strategy Improvement for Parity Games. CAV (2) 2017: 137-154 - Bernd Finkbeiner, Christopher Hahn, Marvin Stenger:
EAHyper: Satisfiability, Implication, and Equivalence Checking of Hyperproperties. CAV (2) 2017: 564-570 - Marie Fortin, Anca Muscholl, Igor Walukiewicz:
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. CAV (2) 2017: 155-175 - Adrià Gascón, Ashish Tiwari, Brent Carmer, Umang Mathur:
Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis. CAV (2) 2017: 86-103 - Shelly Grossman, Sara Cohen, Shachar Itzhaky, Noam Rinetzky, Mooly Sagiv:
Verifying Equivalence of Spark Programs. CAV (2) 2017: 282-300 - Ayrat Khalimov, Roderick Bloem:
Bounded Synthesis for Streett, Rabin, and \text CTL*. CAV (2) 2017: 333-352 - Quang Loc Le, Makoto Tatsuta, Jun Sun, Wei-Ngan Chin:
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic. CAV (2) 2017: 495-517 - Ognjen Maric, Christoph Sprenger, David A. Basin:
Cutoff Bounds for Consensus Algorithms. CAV (2) 2017: 217-237 - Jedidiah McClurg, Hossein Hojjat, Pavol Cerný:
Synchronization Synthesis for Network Programs. CAV (2) 2017: 301-321 - Alexander Nadel:
A Correct-by-Decision Solution for Simultaneous Place and Route. CAV (2) 2017: 436-452 - Andrew Reynolds, Maverick Woo, Clark W. Barrett, David Brumley, Tianyi Liang, Cesare Tinelli:
Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification. CAV (2) 2017: 453-474 - Olli Saarikivi, Margus Veanes:
Minimization of Symbolic Transducers. CAV (2) 2017: 176-196 - Eshan Singh, Clark W. Barrett, Subhasish Mitra:
E-QED: Electrical Bug Localization During Post-silicon Validation Enabled by Quick Error Detection and Formal Methods. CAV (2) 2017: 104-125 - Marcelo Sousa, César Rodríguez, Vijay Victor D'Silva, Daniel Kroening:
Abstract Interpretation with Unfoldings. CAV (2) 2017: 197-216 - Leander Tentrup:
On Expansion and Resolution in CEGAR Based QBF Solving. CAV (2) 2017: 475-494 - Valentin Touzeau, Claire Maïza, David Monniaux, Jan Reineke:
Ascertaining Uncertainty for Efficient Exact Cache Analysis. CAV (2) 2017: 22-40
skipping 3 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-09-20 11:55 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