![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 27 matches
- 2015
- Takumi Akazaki, Ichiro Hasuo:
Time Robustness in MTL and Expressivity in Hybrid System Falsification. CAV (2) 2015: 356-374 - Rajeev Alur, Pavol Cerný, Arjun Radhakrishna:
Synthesis Through Unification. CAV (2) 2015: 163-179 - Rajeev Alur, Mukund Raghothaman
, Christos Stergiou, Stavros Tripakis
, Abhishek Udupa:
Automatic Completion of Distributed Protocols with Symmetry. CAV (2) 2015: 395-412 - Fahiem Bacchus, George Katsirelos:
Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. CAV (2) 2015: 70-86 - Kshitij Bansal, Andrew Reynolds, Tim King, Clark W. Barrett
, Thomas Wies:
Deciding Local Theory Extensions via E-matching. CAV (2) 2015: 87-105 - Amir M. Ben-Amram, Samir Genaim
:
Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. CAV (2) 2015: 304-321 - Romain Brenguier, Jean-François Raskin
:
Pareto Curves of Multidimensional Mean-Payoff Games. CAV (2) 2015: 251-267 - Pavol Cerný, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
:
From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis. CAV (2) 2015: 180-197 - Supratik Chakraborty
, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly
, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry:
Word-Level Symbolic Trajectory Evaluation. CAV (2) 2015: 128-143 - Jürgen Christ, Jochen Hoenicke
:
Cutting the Mix. CAV (2) 2015: 37-52 - Vijay D'Silva, Caterina Urban:
Conflict-Driven Conditional Termination. CAV (2) 2015: 271-286 - Ankush Desai, Sanjit A. Seshia, Shaz Qadeer, David Broman, John C. Eidson:
Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems. CAV (2) 2015: 429-448 - Jyotirmoy V. Deshmukh, Rupak Majumdar, Vinayak S. Prabhu:
Quantifying Conformance Using the Skorokhod Metric. CAV (2) 2015: 234-250 - Amit Erez, Alexander Nadel
:
Finding Bounded Path in Graph Using SMT for Automatic Clock Routing. CAV (2) 2015: 20-36 - Thomas Ferrère, Oded Maler, Dejan Nickovic, Dogan Ulus
:
Measuring with Timed Patterns. CAV (2) 2015: 322-337 - Chris Hawblitzel, Erez Petrank, Shaz Qadeer, Serdar Tasiran:
Automated and Modular Refinement Reasoning for Concurrent Programs. CAV (2) 2015: 449-465 - Jinseong Jeon, Xiaokang Qiu
, Armando Solar-Lezama, Jeffrey S. Foster:
Adaptive Concretization for Parallel Program Synthesis. CAV (2) 2015: 377-394 - Etienne Kneuss, Manos Koukoutos, Viktor Kuncak:
Deductive Program Repair. CAV (2) 2015: 217-233 - Takuya Kuwahara, Ryosuke Sato
, Hiroshi Unno
, Naoki Kobayashi
:
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs. CAV (2) 2015: 287-303 - Rebekah Leslie-Hurd, Dror Caspi, Matthew Fernandez:
Verifying Linearizability of Intel® Software Guard Extensions. CAV (2) 2015: 144-160 - Panagiotis Manolios
, Jorge Pais, Vasilis Papavasileiou:
The Inez Mathematical Programming Modulo Theories Framework. CAV (2) 2015: 53-69 - William Mansky, Dmitri Garbuzov, Steve Zdancewic:
An Axiomatic Specification for Sequential Memory Models. CAV (2) 2015: 413-428 - Andrew Reynolds, Morgan Deters, Viktor Kuncak, Cesare Tinelli
, Clark W. Barrett
:
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT. CAV (2) 2015: 198-216 - Muralidaran Vijayaraghavan, Adam Chlipala, Arvind, Nirav Dave:
Modular Deductive Verification of Multiprocessor Hardware Designs. CAV (2) 2015: 109-127 - He Zhu
, Gustavo Petri, Suresh Jagannathan:
Poling: SMT Aided Linearizability Proofs. CAV (2) 2015: 3-19 - Liang Zou, Martin Fränzle
, Naijun Zhan, Peter Nazier Mosaad:
Automatic Verification of Stability and Safety for Delay Differential Equations. CAV (2) 2015: 338-355 - Daniel Kroening
, Corina S. Pasareanu:
Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9207, Springer 2015, ISBN 978-3-319-21667-6 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-24 08:51 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