Остановите войну!
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 30 matches
- 2018
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer:
Trau: SMT solver for string constraints. FMCAD 2018: 1-5 - Bernhard K. Aichernig, Roderick Bloem, Masoud Ebrahimi, Martin Tappler, Johannes Winter:
Automata Learning for Symbolic Execution. FMCAD 2018: 1-9 - Sourav Anand, Nadia Polikarpova:
Automatic Synchronization for GPU Kernels. FMCAD 2018: 1-9 - Peter Backeman, Philipp Rümmer, Aleksandar Zeljic:
Bit-Vector Interpolation and Quantifier Elimination by Lazy Reduction. FMCAD 2018: 1-10 - John Backes, Pauline Bolignano, Byron Cook, Catherine Dodge, Andrew Gacek, Kasper Søe Luckow, Neha Rungta, Oksana Tkachuk, Carsten Varming:
Semantic-based Automated Reasoning for AWS Access Policies using SMT. FMCAD 2018: 1-9 - Heiko Becker, Nikita Zyuzin, Raphaël Monat, Eva Darulova, Magnus O. Myreen, Anthony C. J. Fox:
A Verified Certificate Checker for Finite-Precision Error Bounds in Coq and HOL4. FMCAD 2018: 1-10 - Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. FMCAD 2018: 1-10 - Julien Brunel, David Chemouil, Jeanne Tawa:
Analyzing the Fundamental Liveness Property of the Chord Protocol. FMCAD 2018: 1-9 - Pavel Cadek, Clemens Danninger, Moritz Sinn, Florian Zuleger:
Using Loop Bound Analysis For Invariant Generation. FMCAD 2018: 1-9 - Roberto Cavada, Alessandro Cimatti, Sergio Mover, Mirko Sessa, Giuseppe Cadavero, Giuseppe Scaglione:
Analysis of Relay Interlocking Systems via SMT-based Model Checking of Switched Multi-Domain Kirchhoff Networks. FMCAD 2018: 1-9 - Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi:
Functional Synthesis via Input-Output Separation. FMCAD 2018: 1-9 - Grigory Fedyukovich, Sumanth Prabhu, Kumar Madhukar, Aarti Gupta:
Solving Constrained Horn Clauses Using Syntax and Data. FMCAD 2018: 1-9 - Eugene Goldberg:
Complete Test Sets And Their Approximations. FMCAD 2018: 1-9 - Alberto Griggio, Marco Roveri, Stefano Tonetta:
Certifying Proofs for LTL Model Checking. FMCAD 2018: 1-9 - Hossein Hojjat, Philipp Rümmer:
The ELDARICA Horn Solver. FMCAD 2018: 1-7 - Alexander Ivrii, Ziv Nevo, Jason Baumgartner:
k-FAIR = k-LIVENESS + FAIR Revisiting SAT-based Liveness Algorithms. FMCAD 2018: 1-5 - Dejan Jovanovic, Andrew Reynolds:
The FMCAD 2018 Graduate Student Forum. FMCAD 2018: 1 - Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer:
BMC with Memory Models as Modules. FMCAD 2018: 1-9 - Bjørnar Luteberget, Koen Claessen, Christian Johansen:
Design-Time Railway Capacity Verification using SAT modulo Discrete Event Simulation. FMCAD 2018: 1-9 - Viktor Malík, Martin Hruska, Peter Schrammel, Tomás Vojnar:
Template-Based Verification of Heap-Manipulating Programs. FMCAD 2018: 1-9 - Cristian Mattarei, Makai Mann, Clark W. Barrett, Ross G. Daly, Dillon Huff, Pat Hanrahan:
CoSA: Integrated Verification for Agile Hardware Design. FMCAD 2018: 1-5 - Nina Narodytska:
Formal Verification of Deep Neural Networks. FMCAD 2018: 1 - Daniel Neider, Ivan Gavran:
Learning Linear Temporal Properties. FMCAD 2018: 1-10 - Oded Padon:
Deductive Verification of Distributed Protocols in First-Order Logic. FMCAD 2018: 1 - Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham:
Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems. FMCAD 2018: 1-11 - Thomas Pani, Georg Weissenbacher, Florian Zuleger:
Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms. FMCAD 2018: 1-9 - Vikas Rao, Utkarsh Gupta, Irina Ilioaea, Arpitha Srinath, Priyank Kalla, Florian Enescu:
Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques. FMCAD 2018: 1-9 - Adrian Rebola-Pardo, Luís Cruz-Filipe:
Complete and Efficient DRAT Proof Checking. FMCAD 2018: 1-9 - Hongce Zhang, Caroline Trippel, Yatin A. Manerkar, Aarti Gupta, Margaret Martonosi, Sharad Malik:
ILA-MCM: Integrating Memory Consistency Models with Instruction-Level Abstractions for Heterogeneous System-on-Chip Verification. FMCAD 2018: 1-10 - Nikolaj S. Bjørner, Arie Gurfinkel:
2018 Formal Methods in Computer Aided Design, FMCAD 2018, Austin, TX, USA, October 30 - November 2, 2018. IEEE 2018, ISBN 978-0-9835678-8-2 [contents]
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-25 17:13 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