default search action
Matthew Lewis 0004
Person information
- affiliation: University of Freiburg, Germany
Other persons with the same name
- Matthew Lewis — disambiguation page
- Matthew Lewis 0001
— University of Hertfordshire, UK
- Matthew Lewis 0002
- Matthew Lewis 0003 — Robert Bosch GmbH, Reutlingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c16]Bernd Becker
ALLQBF Solving by Computational Learning. ATVA 2012: 370-384 - [c15]Paolo Marin, Christian Miller, Matthew Lewis, Bernd Becker
Verification of partial designs using incremental QBF solving. DATE 2012: 623-628 - 2011
- [b1]Matthew Lewis:
SAT, QBF, and multicore processors. University of Freiburg, Germany, 2011, ISBN 978-3-86247-120-1, pp. 1-210 - [j4]Stefan Kupferschmid, Matthew Lewis, Tobias Schubert, Bernd Becker
Incremental preprocessing methods for use in BMC. Formal Methods Syst. Des. 39(2): 185-204 (2011) - [j3]Matthew Lewis, Tobias Schubert, Bernd Becker
Parallel QBF Solving with Advanced Knowledge Sharing. Fundam. Informaticae 107(2-3): 139-166 (2011) - [c14]Matthias Sauer, Victor Tomashevich, Jörg Müller, Matthew Lewis, Andreas Spilla, Ilia Polian, Bernd Becker
An FPGA-based framework for run-time injection and analysis of soft errors in microprocessors. IOLTS 2011: 182-185 - 2010
- [j2]Alejandro Czutro, Ilia Polian, Matthew Lewis, Piet Engelke, Sudhakar M. Reddy, Bernd Becker
Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability Analysis. Int. J. Parallel Program. 38(3-4): 185-202 (2010) - [c13]Tobias Nopper, Christian Miller, Matthew Lewis, Bernd Becker, Christoph Scholl:
SAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs. MBMV 2010: 107-116 - [c12]Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker
Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs. SAT 2010: 194-208
2000 – 2009
- 2009
- [j1]Tobias Schubert, Matthew Lewis, Bernd Becker:
PaMiraXT: Parallel SAT Solving with Threads and Message Passing. J. Satisf. Boolean Model. Comput. 6(4): 203-222 (2009) - [c11]Paolo Marin, Matthew Lewis, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia:
Evaluation of Knowledge Sharing Strategies in a Parallel QBF Solver. RCRA@AI*IA 2009 - [c10]Paolo Marin, Massimo Narizzano
Comparison of knowledge sharing strategies in a parallel QBF solver. HPCS 2009: 161-167 - [c9]Matthew Lewis, Tobias Schubert, Bernd Becker:
QmiraXT - A Multithreaded QBF Solver. MBMV 2009: 7-16 - [c8]Matthew Lewis, Paolo Marin, Tobias Schubert, Massimo Narizzano
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing. SAT 2009: 509-523 - [c7]Alejandro Czutro, Ilia Polian, Matthew Lewis, Piet Engelke, Sudhakar M. Reddy, Bernd Becker
TIGUAN: Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability ANalysis. VLSI Design 2009: 227-232 - 2008
- [c6]Bernd Becker
Propositional approximations for bounded model checking of partial circuit designs. ICCD 2008: 52-59 - 2007
- [c5]Matthew Lewis, Tobias Schubert, Bernd Becker
Multithreaded SAT Solving. ASP-DAC 2007: 926-931 - 2005
- [c4]Tobias Schubert, Matthew D. T. Lewis, Bernd Becker
PaMira - A Parallel SAT Solver with Knowledge Sharing. MTV 2005: 29-36 - [c3]Matthew D. T. Lewis, Tobias Schubert, Bernd Becker
Speedup Techniques Utilized in Modern SAT Solvers. SAT 2005: 437-443 - 2004
- [c2]Matthew D. T. Lewis, Tobias Schubert, Bernd Becker:
Early Conflict Detection Based SAT Solving. MBMV 2004: 243-249 - [c1]Matthew D. T. Lewis, Tobias Schubert, Bernd Becker:
Early Conflict Detection Based BCP for SAT Solving. SAT 2004
Coauthor Index
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.
last updated on 2024-08-05 20:21 CEST 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: