Остановите войну!
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 38 matches
- 2013
- Gadi Aleksandrowicz, Jason Baumgartner, Alexander Ivrii, Ziv Nevo:
Generalized counterexamples to liveness properties. FMCAD 2013: 169-180 - Rajeev Alur, Rastislav Bodík, Garvit Juniwal, Milo M. K. Martin, Mukund Raghothaman, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, Abhishek Udupa:
Syntax-guided synthesis. FMCAD 2013: 1-8 - Rajeev Alur, Salar Moarref, Ufuk Topcu:
Counter-strategy guided refinement of GR(1) temporal logic specifications. FMCAD 2013: 26-33 - Pranav Ashar:
Static verification based signoff - A key enabler for managing verification complexity in the modern soc. FMCAD 2013: 15 - Sam Bayless, Celina G. Val, Thomas Ball, Holger H. Hoos, Alan J. Hu:
Efficient modular SAT solving for IC3. FMCAD 2013: 149-156 - Sagar Chaki, Arie Gurfinkel, Ofer Strichman:
Verifying periodic programs with priority inheritance locks. FMCAD 2013: 137-144 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Andreas Pavlogiannis:
Distributed synthesis for LTL fragments. FMCAD 2013: 18-25 - Alessandro Cimatti, Alberto Griggio, Sergio Mover, Stefano Tonetta:
Parameter synthesis with IC3. FMCAD 2013: 165-168 - Koen Claessen, Niklas Eén, Baruch Sterin:
A circuit approach to LTL model checking. FMCAD 2013: 53-60 - Lori A. Clarke:
Using process modeling and analysis techniques to reduce errors in healthcare. FMCAD 2013: 14 - Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout, Fatiha Zaïdi:
Invariants for finite instances and beyond. FMCAD 2013: 61-68 - David Déharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure:
Computing prime implicants. FMCAD 2013: 46-52 - Yulia Demyanova, Helmut Veith, Florian Zuleger:
On the concept of variable roles and its use in software analysis. FMCAD 2013: 226-230 - Hassan Eldib, Chao Wang:
An SMT based method for optimizing arithmetic computations in embedded software code. FMCAD 2013: 129-136 - Nate Foster, Arjun Guha, Mark Reitblatt, Cole Schlesinger:
Tutorial: Practical verification of network programs. FMCAD 2013: 9-10 - Sicun Gao, Soonho Kong, Edmund M. Clarke:
Satisfiability modulo ODEs. FMCAD 2013: 105-112 - Eugene Goldberg, Panagiotis Manolios:
Quantifier elimination via clause redundancy. FMCAD 2013: 85-92 - Jim Grundy:
Firmware validation: challenges and opportunities. FMCAD 2013: 11 - Zyad Hassan, Aaron R. Bradley, Fabio Somenzi:
Better generalization in IC3. FMCAD 2013: 157-164 - Marijn Heule, Warren A. Hunt Jr., Nathan Wetzler:
Trimming while checking clausal proofs. FMCAD 2013: 181-188 - Georg Hofferek, Ashutosh Gupta, Bettina Könighofer, Jie-Hong Roland Jiang, Roderick Bloem:
Synthesizing multiple boolean functions using interpolation on a single proof. FMCAD 2013: 77-84 - Alex Horn, Michael Tautschnig, Celina G. Val, Lihao Liang, Tom Melham, Jim Grundy, Daniel Kroening:
Formal co-validation of low-level hardware/software interfaces. FMCAD 2013: 121-128 - Somesh Jha, Thomas W. Reps, William R. Harris:
Secure programs via game-based synthesis. FMCAD 2013: 12-13 - Barbara Jobstmann, Sandip Ray:
Preface. FMCAD 2013 - Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Parameterized model checking of fault-tolerant distributed algorithms by abstraction. FMCAD 2013: 201-209 - Tim King, Clark W. Barrett, Bruno Dutertre:
Simplex with sum of infeasibilities for SMT. FMCAD 2013: 189-196 - Viktor Kuncak, Régis Blanc:
Interpolation for synthesis on unbounded domains. FMCAD 2013: 93-96 - Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Proving termination of imperative programs using Max-SMT. FMCAD 2013: 218-225 - Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Efficient MUS extraction with resolution. FMCAD 2013: 197-200 - John W. O'Leary, Roope Kaivola, Tom Melham:
Relational STE and theorem proving for formal verification of industrial circuit designs. FMCAD 2013: 97-104
skipping 8 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-05-25 07:08 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