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 46 matches
- 2022
- Guy Amir, Tom Zelazny, Guy Katz, Michael Schapira:
Verification-Aided Deep Ensemble Selection. FMCAD 2022: 27-37 - June Andronick:
The seL4 Verification Journey: How Have the Challenges and Opportunities Evolved. FMCAD 2022: 1 - Martin Blicha
, Grigory Fedyukovich, Antti E. J. Hyvärinen, Natasha Sharygina:
Split Transition Power Abstraction for Unbounded Safety. FMCAD 2022: 349-358 - Randal E. Bryant:
Tbuddy: A Proof-Generating BDD Package. FMCAD 2022: 49-58 - Mario Bucev, Viktor Kuncak:
Formally Verified Quite OK Image Format. FMCAD 2022: 343-348 - Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan:
Reducing NEXP-complete problems to DQBF. FMCAD 2022: 199-204 - Hana Chockler:
Why Do Things Go Wrong (or Right)? Applications of Causal Reasoning to Verification. FMCAD 2022: 1 - Ross Daly, Caleb Donovick, Jackson Melchert, Rajsekhar Setaluri, Nestan Tsiskaridze, Priyanka Raina, Clark W. Barrett, Pat Hanrahan:
Synthesizing Instruction Selection Rewrite Rules from RTL using SMT. FMCAD 2022: 139-150 - Ali Ebnenasir:
Synthesizing Self-Stabilizing Parameterized Protocols with Unbounded Variables. FMCAD 2022: 245-254 - Zafer Esen, Philipp Rümmer:
Tricera: Verifying C Programs Using the Theory of Heaps. FMCAD 2022: 380-391 - Oliver Flatt, Samuel Coward, Max Willsey, Zachary Tatlock, Pavel Panchekha:
Small Proofs from Congruence Closure. FMCAD 2022: 75-83 - Pamina Georgiou, Bernhard Gleiss, Ahmed Bhayat, Michael Rawson, Laura Kovács, Giles Reger:
The Rapid Software Verification Framework. FMCAD 2022: 255-260 - Adwait Godbole, Yatin A. Manerkar, Sanjit A. Seshia:
Automated Conversion of Axiomatic to Operational Models: Theory and Practice. FMCAD 2022: 331-342 - Anvay Grover, Ruediger Ehlers, Loris D'Antoni:
Synthesizing Transducers from Complex Specifications. FMCAD 2022: 294-303 - Aarti Gupta, Roope Kaivola, Mihir Parang Mehta, Vaibhav Singh:
Error Correction Code Algorithm and Implementation Verification Using Symbolic Representations. FMCAD 2022: 151-159 - Jonas Haglund, Roberto Guanciale:
Formally Verified Isolation of DMA. FMCAD 2022: 118-128 - Håkan Hjort:
On Applying Model Checking in Formal Verification. FMCAD 2022: 1 - Omri Isac, Clark W. Barrett, Min Zhang, Guy Katz:
Neural Network Verification with Proof Production. FMCAD 2022: 38-48 - Swen Jacobs, Mouhammad Sakr, Marcus Völp:
Automatic Repair and Deadlock Detection for Parameterized Systems. FMCAD 2022: 225-234 - Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. FMCAD 2022: 284-293 - Roope Kaivola, Neta Bar Kama:
Timed Causal Fanin Analysis for Symbolic Circuit Simulation. FMCAD 2022: 99-107 - Pankaj Kumar Kalita, Miriyala Jeevan Kumar, Subhajit Roy:
Synthesis of Semantic Actions in Attribute Grammars. FMCAD 2022: 304-314 - Nishant Kheterpal, Elanor Tang, Jean-Baptiste Jeannin:
Automating Geometric Proofs of Collision Avoidance with Active Corners. FMCAD 2022: 1-10 - Alexander Konrad, Christoph Scholl, Alireza Mahzoon, Daniel Große, Rolf Drechsler:
Divider Verification Using Symbolic Computer Algebra and Delayed Don't Care Optimization. FMCAD 2022: 1-10 - Niklas Lauffer, Beyazit Yalcinkaya, Marcell Vazquez-Chanlatte, Ameesh Shah, Sanjit A. Seshia:
Learning Deterministic Finite Automata Decompositions from Examples and Demonstrations. FMCAD 2022: 1-6 - Yannan Li, Jingbo Wang, Chao Wang:
Proving Robustness of KNN Against Adversarial Data Poisoning. FMCAD 2022: 7-16 - Evan Lohn, Chris Lambert, Marijn J. H. Heule:
Compact Symmetry Breaking for Tournaments. FMCAD 2022: 179-188 - Andreas Lööw:
Reconciling Verified-Circuit Development and Verilog Development. FMCAD 2022: 1-10 - Benedikt Maderbacher, Roderick Bloem:
Reactive Synthesis Modulo Theories using Abstraction Refinement. FMCAD 2022: 315-324 - Abhishek Anil Nair, Saranyu Chattopadhyay, Haoze Wu, Alex Ozdemir, Clark W. Barrett:
Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers. FMCAD 2022: 84-88
skipping 16 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-16 23:19 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:
