default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 54 matches
- 2008
- Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza, Ahmed Rezine:
Monotonic Abstraction for Programs with Dynamic Memory Heaps. CAV 2008: 341-354 - Rajeev Alur, Aditya Kanade, Gera Weiss
:
Ranking Automata and Games for Prioritized Requirements. CAV 2008: 240-253 - Michael Backes, Stefan Lorenz, Matteo Maffei, Kim Pecina:
The CASPA Tool: Causality-Based Abstraction for Security Protocol Analysis. CAV 2008: 419-422 - Surender Baswana, Shashank K. Mehta, Vishal Powar:
Implied Set Closure and Its Application to Memory Consistency Verification. CAV 2008: 94-106 - Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv:
Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413 - Dirk Beyer, Damien Zufferey, Rupak Majumdar:
CSIsat: Interpolation for LA+EUF. CAV 2008: 304-308 - Per Bjesse:
A Practical Approach to Word Level Model Checking of Industrial Netlists. CAV 2008: 446-458 - Mihaela Gheorghiu Bobaru, Corina S. Pasareanu, Dimitra Giannakopoulou:
Automated Assume-Guarantee Reasoning by Abstraction Refinement. CAV 2008: 135-148 - Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
The Barcelogic SMT Solver. CAV 2008: 294-298 - Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani:
The MathSAT 4SMT Solver. CAV 2008: 299-303 - Sebastian Burckhardt, Madanlal Musuvathi:
Effective Program Verification for Relaxed Memory Models. CAV 2008: 107-120 - Ariel Cohen, Kedar S. Namjoshi:
Local Proofs for Linear-Time Properties of Concurrent Programs. CAV 2008: 149-161 - Ariel Cohen, Amir Pnueli, Lenore D. Zuck:
Mechanical Verification of Transactional Memories with Non-transactional Memory Accesses. CAV 2008: 121-134 - Byron Cook, Sumit Gulwani, Tal Lev-Ami, Andrey Rybalchenko, Mooly Sagiv:
Proving Conditional Termination. CAV 2008: 328-340 - Cas J. F. Cremers:
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols. CAV 2008: 414-418 - Deepak D'Souza, Madhu Gopinathan:
Conflict-Tolerant Features. CAV 2008: 227-239 - Stefan Edelkamp, Peter Sanders, Pavel Simecek:
Semi-external LTL Model Checking. CAV 2008: 530-542 - Cindy Eisner, Amir Nahir, Karen Yorav:
Functional Verification of Power Gated Designs by Compositional Reasoning. CAV 2008: 433-445 - Azadeh Farzan, P. Madhusudan:
Monitoring Atomicity in Concurrent Programs. CAV 2008: 52-65 - Edward W. Felten:
Coping with Outside-the-Box Attacks. CAV 2008: 3-4 - Harry Foster:
Assertion-Based Verification: Industry Myths to Realities (Invited Tutorial). CAV 2008: 5-10 - Ambar A. Gadkari, Anand Yeolekar, J. Suresh, S. Ramesh, Swarup Mohalik, K. C. Shashidhar:
AutoMOTGen: Automatic Model Oriented Test Generator for Embedded Control Systems. CAV 2008: 204-208 - Simon J. Gay, Rajagopal Nagarajan, Nikolaos Papanikolaou:
QMC: A Model Checker for Quantum Systems. CAV 2008: 543-547 - Rob J. van Glabbeek, Bas Ploeger:
Correcting a Space-Efficient Simulation Algorithm. CAV 2008: 517-529 - Bhargav S. Gulavani, Sumit Gulwani:
A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis. CAV 2008: 370-384 - Sumit Gulwani, Ashish Tiwari:
Constraint-Based Approach for Analysis of Hybrid Systems. CAV 2008: 190-203 - John Harrison:
Theorem Proving for Verification (Invited Tutorial). CAV 2008: 11-18 - Holger Hermanns, Björn Wachter, Lijun Zhang:
Probabilistic CEGAR. CAV 2008: 162-175 - Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith:
FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement. CAV 2008: 209-213 - Himanshu Jain, Edmund M. Clarke, Orna Grumberg:
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations. CAV 2008: 254-267
skipping 24 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-11-24 06:27 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
